0% found this document useful (0 votes)
1 views

AIML Course File

The document outlines the course details for Artificial Intelligence and Machine Learning (CS3491) offered at Adhiparasakthi Engineering College for the 2023-2024 academic year. It includes course objectives, outcomes, practical exercises, and a detailed syllabus covering topics such as search algorithms, probabilistic reasoning, supervised learning, ensemble techniques, and neural networks. Additionally, it lists textbooks and references, as well as the department's vision and mission.

Uploaded by

subashiniapec
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

AIML Course File

The document outlines the course details for Artificial Intelligence and Machine Learning (CS3491) offered at Adhiparasakthi Engineering College for the 2023-2024 academic year. It includes course objectives, outcomes, practical exercises, and a detailed syllabus covering topics such as search algorithms, probabilistic reasoning, supervised learning, ensemble techniques, and neural networks. Additionally, it lists textbooks and references, as well as the department's vision and mission.

Uploaded by

subashiniapec
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Om Sakthi

Adhiparasakthi Engineering College, Melmaruvathur

Department of Computer Science and Engineering

COURSE DETAILS

Branch: Computer Science and Engineering

Batch: 2021-2025

Academic Year: 2023-2024(EVEN)

Year: II

Semester: IV

Total No. of Students: 88

Subject Code : CS3491

ARTIFICIAL INTELLIGENCE AND


Subject Name: MACHINE LEARNING

Name of the Faculty: SEKAR G

Designation: Assistant Professor

SUBJECT IN CHARGE HOD/CSE


CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING LTP 3 024

COURSE OBJECTIVES:

The main objectives of this course are to:

 Study about uninformed and Heuristic search techniques.

 Learn techniques for reasoning under uncertainty

 Introduce Machine Learning and supervised learning algorithms

 Study about ensembling and unsupervised learning algorithms

 Learn the basics of deep learning using neural networks

UNIT I PROBLEM SOLVING 9

Introduction to AI - AI Applications - Problem solving agents – search algorithms – uninformed


search strategies – Heuristic search strategies – Local search and optimization problems –
adversarial search – constraint satisfaction problems (CSP)

UNIT II PROBABILISTIC REASONING 9

Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic reasoning –
Bayesian networks – exact inference in BN – approximate inference in BN – causal networks.

UNIT III SUPERVISED LEARNING9

Introduction to machine learning – Linear Regression Models: Least squares, single & multiple
variables, Bayesian linear regression, gradient descent, Linear Classification Models: Discriminant
function – Probabilistic discriminative model - Logistic regression, Probabilistic generative model
– Naive Bayes, Maximum margin classifier – Support vector machine, Decision Tree, Random
forests

UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING 9

Combining multiple learners: Model combination schemes, Voting, Ensemble Learning - bagging,
boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN, Gaussian
mixture models and Expectation maximization

UNIT V NEURAL NETWORKS 9

Perceptron - Multilayer perceptron, activation functions, network training – gradient descent


optimization – stochastic gradient descent, error backpropagation, from shallow networks to deep
networks –Unit saturation (aka the vanishing gradient problem) – ReLU, hyperparameter tuning,
batch normalization, regularization, dropout.

45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS

1. Implementation of Uninformed search algorithms (BFS, DFS)

2. Implementation of Informed search algorithms (A*, memory-bounded A*)

3. Implement naïve Bayes models

4. Implement Bayesian Networks

5. Build Regression models

6. Build decision trees and random forests

7. Build SVM models

8. Implement ensembling techniques

9. Implement clustering algorithms

10. Implement EM for Bayesian networks

11. Build simple NN models

12. Build deep learning NN models

COURSE OUTCOMES:

At the end of this course, the students will be able to:

CO1: Use appropriate search algorithms for problem solving

CO2: Apply reasoning under uncertainty

CO3: Build supervised learning models

CO4: Build ensembling and unsupervised models

CO5: Build deep learning neural network model

TOTAL:75 PERIODS

TEXT BOOKS:

1. Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”,


Fourth Edition, Pearson Education, 2021.

2. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Fourth


Edition, 2020.
REFERENCES:

1. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”,


Pearson Education,2007

2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill,
2008

3. Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education,


2006

4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw


Hill Education, 2013 (http://nptel.ac.in/)

5. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer,


2006.

6. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.

7. Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC


Press, 2014

8. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, “Foundations of


Machine Learning”, MIT Press, 2012.

9. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press,
2016
Om Sakthi

Adhiparasakthi Engineering College, Melmaruvathur

Department of Computer Science and Engineering

VISION OF THE DEPARTMENT

To be a globally recognized leader in computer science and engineering education,


research, and innovation, driving advancements that address societal challenges and shape the
future of technology.

MISSION OF THE DEPARTMENT

 Foster a culture of interdisciplinary collaboration, encouraging students and faculty to


explore innovative solutions that integrate computer science and engineering with other
domains such as medicine, business, and the humanities.
 Conduct impactful research that advances the frontiers of computer science and
engineering, addressing fundamental questions and tackling real-world problems with
creativity and rigor.
 Engage with industry, government, and other stakeholders to translate research
discoveries into practical applications, driving economic growth and societal progress.
Course Code CS3491
Course Name ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Category Professional Core Course
No. of Credit 4
Class II YEAR CSE– IV Semester

COURSE OBJECTIVES

Course
Objective Course Objectives
No
I Study about uninformed and Heuristic search techniques
II Learn techniques for reasoning under uncertainty

III Introduce Machine Learning and supervised learning algorithms

IV Study about ensembling and unsupervised learning algorithms

V Learn the basics of deep learning using neural networks

COURSE OUTCOMES

Course
Outcome Course Outcome
No.
1 Use appropriate search algorithms for problem solving
2 Apply reasoning under uncertainty
3 Build supervised learning models
4 Build ensembling and unsupervised models
5 Build deep learning neural network model
PROGRAM OUTCOMES

Program
Program Outcomes
Outcomes
No.
1. Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
Identify, formulate, review research literature, and analyze complex engineering
2. problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
Design solutions for complex engineering problems and design system components or
3. processes that meet the specified needs with appropriate consideration for the public
health and safety, and the cultural, societal, and environmental considerations
Use research-based knowledge and research methods including design of experiments,
4. analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
Create, select, and apply appropriate techniques, resources, and modern engineering
5. and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
Apply reasoning informed by the contextual knowledge to assess societal, health,
6. safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice
Understand the impact of the professional engineering solutions in societal and
7. environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
8. Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9. Function effectively as an individual, and as a member or leader in diverse teams, and
in multidisciplinary settings
Communicate effectively on complex engineering activities with the engineering
10. community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and
receive clear instructions.
Demonstrate knowledge and understanding of the engineering and management
11. principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments
12. Recognize the need for, and have the preparation and ability to engage in independent
and life-long learning in the broadest context of technological change.
PROGRAM SPECIFIC OUTCOMES (PSOs)

1. Have proficiency in programming skills to design, develop and apply appropriate


techniques, to solve complex engineering problems.
2. Have knowledge to build, automate and manage business solutions using cutting edge
technologies.
3. Have excitement towards research in applied computer technologies.

CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 3 3 - 2 1 - - - - - 2 2 3 2

2 3 2 - 2 1 3 - - - - 2 2 3 2

3 3 - 3 - 3 - - - - - 2 3 3 2

4 3 - 3 - 3 - - - - - 2 2 3 2

5 3 - 3 - 3 - - - - - 2 2 3 2

AVg. 3 1 1.8 0.8 2.2 0.6 - - - - 2 2 3 2

1 - low, 2 - medium, 3 - high, “-“ no correlation

CO-PO Mapping Justification:

Low-L
Medium-M CO Mapping Justification
High-H
3-H Strongly mapped as the students will be able to
PO1- apply the knowledge of mathematics, science,
CO1,CO2,CO3,CO4,CO engineering fundamentals, and an engineering
5 specialization to the solution of complex
engineering problems.
PO2-CO1 Strongly mapped as the students will be able to
identify, formulate, review research literature, and
analyse complex engineering problems reaching
substantiated conclusions using first principles of
mathematics, natural sciences, and engineering
sciences.
Strongly mapped as the students will be able to
design solutions for complex engineering problems
and design system components or processes that
PO3-CO3,CO4,CO5 meet the specified needs with appropriate
consideration for the public health and safety, and
the cultural, societal, and environmental
considerations.
Strongly mapped as the students will be able to
create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools
PO5-CO3,CO4,CO5
including prediction and modeling to complex
engineering activities with an understanding of the
limitations.
PO6 – CO2
Strongly mapped as the students will be able to
recognize the need for, and have the preparation
PO12-CO3 and ability to engage in independent and life-long
learning in the broadest context of technological
change
Moderately mapped as the students will be able to
identify, formulate, review research literature, and
analyse complex engineering problems reaching
PO2-CO2 substantiated conclusions using first principles of
mathematics, natural sciences, and engineering
sciences.

Moderately mapped as the students will be able to


use research-based knowledge and research
PO4-CO1, CO2 methods including design of experiments, analysis
2-M and interpretation of data, and synthesis of the
information to provide valid conclusions.
Moderately mapped as the students will be able to
apply reasoning informed by the contextual
PO11 -
knowledge to assess societal, health, safety, legal
CO1,CO2,CO3,CO4,CO
and cultural issues and the consequent
5
responsibilities relevant to the professional
engineering practice
Moderately mapped as the students will be able to
PO12- function effectively as an individual, and as a
CO1,CO2,CO4,CO5 member or leader in diverse teams, and in
multidisciplinary settings
Slightly mapped as the students will be able to
apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal
1-L PO5- CO1,CO2
and cultural issues and the consequent
responsibilities relevant to the professional
engineering practice

CO-PSO Mapping Justification:


Low-L
Medium-M CO Mapping Justification
High-H
Strongly mapped as the student will be able to
PSO1-
have proficiency in programming skills to design,
3-H CO1,CO2,CO3,CO4,CO
develop and apply appropriate techniques, to solve
5
complex engineering problems.
PSO2- Moderately mapped as the student will be able to
2-M
CO1,CO2,CO3,CO4,CO have knowledge to build, automate and manage
5 business solutions using cutting edge technologies.
Name SEKAR G
Subject code & Name CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Semester and Year IV and II Year CSE
Academic Year 2023-2024 (EVEN)
Planned BT
Sl. No Date hrs.
Topics to be covered Text/Ref BB/PPT CO PO
L
UNIT I PROBLEM SOLVING

1. Introduction to AI 1 1,3

2. AI Applications 1 1,3
1 TEXT BOOKS
Problem solving agents 1,3
3. Stuart Russell
1
Search algorithms and Peter Norvig, 1,3
4. 1
“Artificial
Uninformed search strategies Intelligence – A PPT 1,3
5. 1
Modern
Heuristic search strategies Approach”, 1,3
6. 1
Fourth Edition,
Pearson 1,3
7. Local search and optimization problems 1
Education, 2021
1,3
8. Adversarial search 1

9. Constraint satisfaction problems (CSP) 1 1,3


UNIT II PROBABILISTIC REASONING

Acting under uncertainty


10. 2 1,6
1,6
11. Bayesian inference 2
1 TEXT BOOKS
1,6
12. Naïve bayes models Stuart Russell 2
and Peter Norvig,
1,6
13. “Artificial 2
Probabilistic reasoning
Intelligence – A
Bayesian networks 1,6
14. Modern PPT 2
Exact inference in BN Approach”,
15. 2 1,6
Fourth Edition,
Pearson 1,6
16. Approximate inference in BN Education, 2021 2

17. Approximate inference in BN 2 1,6

18. Causal networks 2 1,6


UNIT III SUPERVISED LEARNING

BB,
19. Introduction to machine learning PPT 3 1,5
2.Text
20. Linear Regression Models book:Ethem 3 1,5
Alpaydin,
21. Least squares, single & multiple variables “Introduction to 3 1,5
22. Bayesian linear regression, gradient descent 3 1,5
Linear Classification Models: Discriminant
23. 3 1,5
function
Probabilistic discriminative model Logistic
24. 3 1,5
regression
25. Probabilistic generative model 3 1,5

26. Naive Bayes, Maximum margin classifier 3 1,5


Support vector machine, Decision Tree,
27. 3 1,5
Random forests
UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING

28. Combining multiple learners 4 1,5 2

29. Model combination schemes 4 1,5 2

30. Voting, Ensemble Learning 4 1,5 1

31. Bagging, boosting 4 1,5 1

32. Stacking 2.Text BB, 4 1,5 1


book:Ethem PPT
33. Unsupervised learning: K-means Alpaydin,
“Introduction to
34. Instance Based Learning :KNN Machine 4 1,5
Learning”, MIT
Press, Fourth 4 1,5
35. Gaussian mixture models
Edition, 2020.
36. Expectation Maximization 4 1,5
UNIT V NEURAL NETWORKS

37. Perceptron 5 1,5

38. Multilayer perceptron, activation functions, 2.Text 5 1,5


network training book:Ethem
39. Gradient descent optimization 5 1,5
Alpaydin,
40. Stochastic gradient descent “Introduction 5 1,5
Error back propagation from shallow to Machine
41. networks to deep networks Learning”, PPT 5 1,5
MIT Press,
42. Unit saturation (aka the vanishing gradient 5 6,9
problem) Fourth
43. ReLU, hyperparameter tuning Edition, 2020. 5 6,9

44. Batch normalization, 5 6,9

45. Regularization, dropout 5 6,9


Along with below the following activities are also planned and included:

Activity Name No. of Activity per semester


Assessment Test 2
Model Exams 1
Assignment 3
Miniproject 0
No.of .Experiments 7
Seminar 1
Quiz /Role Play 0

SUBJECT IN-CHARGE HOD/CSE

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy