JKKN COLLEGE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE and Affiliated to Anna University)
Natarajapuram, NH-544, (Salem to Coimbatore), Kumarapalayam- 638 183. Namakkal Dist.
Website: [Link]
Department of Information Technology
Faculty name : [Link], AP/CSE Lecture : 3
Subject Code : CS3491 Tutorial : 0
Artificial Intelligence and
Subject Name : Practical : 0
Machine Learning
Course/ Branch : B.E CSE Credit : 4
Year/Semester : III/VI Total : 45
Academic Year : 2023-2024 Regulation : 2021
Course Objective:
1. Study about uninformed and Heuristic search techniques.
2. Learn techniques for reasoning under uncertainty
3. Introduce Machine Learning and supervised learning algorithms
4. Study about ensembling and unsupervised learning algorithms
5. Learn the basics of deep learning using neural networks
Text /
Unit Teaching Assignment Hour
Topic Name Reference Date
No Aid / Seminar s
Book
1. UNIT I PROBLEM SOLVING
Introduction to AI T1 T1,R1
AI Applications T1.T2 T1,R1
Problem solving agents T1.T3 T1,R1 A1
Search algorithms T1.T2 T1,R1
Uninformed search strategies T1.T3 T1,R1
Heuristic search strategies T1.T2 T1,R1
Local search and optimization problems T1.T2 T1,R1 S1
Adversarial search T1.T3 T1,R1
Constraint satisfaction problems (CSP) T1.T2 T1,R1
Review
Total hours required to complete the unit
Text /
Unit Teaching Assignment Hour
Topic Name Reference Date
No Aid / Seminar s
Book
UNIT II PROBABILISTIC REASONING
Acting under uncertainty T1 T1,R1
Bayesian inference T1.T3 T1,R1 A2
Naïve bayes models T1.T2 T1,R1
Probabilistic reasoning T1.T3 T1,R1
2.
Bayesian networks T1.T3 T1,R1
Exact inference in BN T1.T2 T1,R1 S2
Approximate inference in BN T1.T2 T1,R1
Causal networks T1.T3 T1,R1
Review
Total hours required to complete the unit
Text /
Unit Teaching Assignment Hour
Topic Name Reference Date
No Aid / Seminar s
Book
3. UNIT III SUPERVISED LEARNING
Introduction to machine learning T1 T1,R1
Linear Regression Models: Least squares T1.T3 T1,R1
Single & multiple variables T1.T3 T1,R1
Bayesian linear regression, gradient
T1.T3 T1,R1 A3
descent
Linear Classification Models: Discriminant
T1.T2 T1,R1
function
Probabilistic discriminative model T1.T2 T1,R1
Logistic regression, Probabilistic
T1.T3 T1,R1
generative model
Naive Bayes, Maximum margin classifier T1 T1,R1 S3
Support vector machine, Decision Tree,
T1.T3 T1,R1
Random forests
Total hours required to complete the unit
Text /
Unit Teaching Assignment Hour
Topic Name Reference Date
No Aid /Seminar s
Book
UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING
Combining multiple learners: Model
T1,T3 T1,R1
combination schemes
Voting, Ensemble Learning T1.T2 T1,R1
Bagging, Boosting T1.T3 T1,R1 A4
4.
Stacking T1.T2 T1,R1
Unsupervised learning: K-means T1.T2 T1,R1
Instance Based Learning: KNN T1.T2 T1,R1 S4
Gaussian mixture models and Expectation
T1.T3 T1,R1
maximization
Total hours required to complete the unit
Text /
Unit Teaching Assignment Hour
Topic Name Reference Date
No Aid /Seminar s
Book
5. UNIT V NEURAL NETWORKS
Perceptron T1,T3 T1,R1
Multilayer perceptron, activation functions,
T1.T2 T1,R1
network training
Gradient descent optimization T1.T3 T1,R1
Stochastic gradient descent T1.T2 T1,R1 A5
Error backpropagation T1.T2 T1,R1
From shallow networks to deep
T1.T2 T1,R1
networks
Unit saturation (aka the vanishing gradient
T1.T3 T1,R1
problem)
ReLU, hyper parameter tuning T1,T3 T1,R1 S5
Batch normalization, Regularization,
T1.T2 T1,R1
Dropout
Total hours required to complete the unit
Course Outcomes:
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 models
Text Books (T)
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.
Reference Books (R)
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
([Link]
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
Teaching Aid (TA)
1. Chalk and Talk
2. Power Point Presentation
3. Video Lecture
4. Design Thinking
5. Hand Written Material
Seminar (S)
1. Local search and optimization problems
2. Bayesian inference
3. Naive Bayes, Maximum margin classifier
4. Instance Based Learning: KNN
5. ReLU, hyper parameter tuning
Assignments (A)
1. Problem solving agents
2. Bayesian inference
3. Bayesian linear regression, gradient descent
4. Bagging,Boosting
5. Stochastic gradient descent
Guest Lecture (GL)
1. Nil
Subject In-charge HOD PRINCIPAL
