[go: up one dir, main page]

0% found this document useful (0 votes)
14 views4 pages

CS2011 - AI & ML Syllabus and Lecturewise Topic

The document outlines the syllabus for CS2011 - Introduction to AI and ML, detailing lecture topics, evaluation methods, course objectives, and outcomes. It covers key concepts in AI and ML, including intelligent agents, search algorithms, supervised and unsupervised learning, and various algorithms like K-Nearest Neighbour and clustering techniques. Essential and supplementary readings are also provided to support the course material.

Uploaded by

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

CS2011 - AI & ML Syllabus and Lecturewise Topic

The document outlines the syllabus for CS2011 - Introduction to AI and ML, detailing lecture topics, evaluation methods, course objectives, and outcomes. It covers key concepts in AI and ML, including intelligent agents, search algorithms, supervised and unsupervised learning, and various algorithms like K-Nearest Neighbour and clustering techniques. Essential and supplementary readings are also provided to support the course material.

Uploaded by

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

CS2011- Introduction to AI and ML

Lecture-wise Topics to be covered

Name of Lecture Topics to be covered


Lecture 1 Evolution of Computing, Intelligent machines, or what machines can do.
The Turing Imitation Game, Applications of AI Techniques (Just brief
discussion with graphical illustration if possible).
• Expert Systems
• Image Understanding and Computer Vision
• Navigational Planning for Mobile Robots
• Speech and Natural Language Understanding
• Scheduling
• Intelligent Control
Lecture 2 A Brief History of AI
• The Classical Period
• The Romantic Period
• The Modern Period
Give a glimpse of several Disciplines of AI
• Learning Systems
• Knowledge Representation and Reasoning
• Planning
• Knowledge Acquisition
• Intelligent Search
• Logic Programming
• Soft Computing
• Fuzzy Logic
• Artificial Neural Nets
• Genetic Algorithms
• Management of Imprecision and Uncertainty
THE STATE OF THE ART and Programming Language of AI.

Lecture 3 Introduction to Intelligent Agents with its Environments. Demonstration


with A vacuum-cleaner world. The rational agent and task environment
with PEAS description. Examples of Agent types and their PEAS
description. [Just give an idea about intelligent agent].
Lecture 4 Introduction to State Space Representation. Identify the AI problems and
Problem Formulation by Search. Search Framework.
Lecture 5 Illustrating examples on AI problem formulation such as Missionary and
Cannibal problems, Water Jug Problems, Tower of Hanoi, Monkey and
Banana, 8 Queens Problems and 8 Puzzle Problems.
Lecture 6 Basic Search Algorithm Framework. Breadth First Search Concepts and
illustration with examples
Lecture 7 Depth First Search Concepts and illustration with examples
Lecture 8 Introduction to Supervised, Unsupervised and Reinforcement Learning.
Explain with graphical illustrations and real-life examples.
Lecture 9 Performance Evaluation Metrics (Accuracy, Precision, Recall, F1-Score,
ROC etc.) of supervised classification techniques
Lecture 10 Performance Evaluation Metrics (Accuracy, Precision, Recall, F1-Score,
ROC etc.) of supervised classification techniques.
Lecture 11 Introduction to Cross-validation method and its usage.
Lecture 12 Introduction to Probability Density Function and Conditional probability
to understand Bayes’ classifier.
Lecture 13 Mathematical Formulation of Bayes’ Decision Rule
Lecture 14 Different Case studies of Bayes’ Decision Rule
Lecture 15 Single Variate regression Analysis
Lecture 16 Multi-variate regression analysis
Lecture 17 Introduction to Logistic Regression
Lecture 18 Single Layer Perceptron Algorithm
Lecture 19 Multi-Layer Perceptron Algorithm (Backpropagation method)
Lecture 20 Solving numerical problems on Single and Multi-layer perceptron
algorithms
Lecture 21 K-Nearest Neighbour Algorithm
Lecture 22 Introduction to Clustering and its properties
Lecture 23 K-Means clustering algorithm
Lecture 24 Introduction to DBSCAN clustering algorithm
Lecture 25 Examples on K-Means and DBSCAN clustering algorithms.
Lecture 26 Concepts of Dendrogram and Cluster validity with numerical examples

Evaluation Methods:
Component Weightage (%)
Midterm 30
Quiz/Project/Seminar
20
Presentation/Assignments
End Term 50
COURSE DETAILS
Subject {L-T-P / C} : CS2011 : Introduction to AI and ML {2-0-0 / 2}
Subject Nature : Theory
Program: BTech, 3rd Semester
Coordinator : Anup Nandy, Puneet Kumar Jain

COURSE OBJECTIVES
1. In this course, the students will learn some core AI/ML ideas
2. The courses concentrate on those topics that find applications in several areas rather than in
the context of specific applications.
3. To know about specific AI/ML technique and its suitability for the given task.

COURSE OUTCOMES
After completing this course the student must demonstrate the knowledge and ability to:
Reason about the state-space search algorithm to use under different problem
CO1
specific conditions.
CO2 Identify problems that are amenable to solution by AI methods.
Implement probabilistic solutions for decision making such as Hidden Markov
CO3
Models, Bayes’ Networks, etc.
Learn and implement basic supervised methods like Decision Trees, Nearest Neighbours,
CO4
Perceptron, Linear regression, Logistic regression, SVM and Ensemble Techniques.
CO5 Gain an understanding of basic unsupervised methods like Clustering.

SYLLABUS
Lecture
Topics
Hours

UNIT – I Preamble, History, Philosophical Foundations, Architecture,


Characteristics, Programming, Ethical Issues, Explainability of AI, Rule-based and 6
Frame-based AI Expert System and applications with past, present, and future.

UNIT – II General problem solving approaches, heuristic searching techniques,


12
iterative search, uninformed search, adversarial search.
UNIT – III Reasoning with uncertainty, Markov Models, Hidden Markov Models,
6
Bayes’ rule, Bayes’ Nets: Representation, Independence and Inference.
UNIT – IV Machine Learning Paradigms, Supervised Learning, Naïve Bayes,
Linear and Logistic Regression, Overfitting and underfitting, Decision Trees, 12
Support Vector Machines, KNN, Neural Network, Ensemble learning
UNIT-V Unsupervised Learning, Introduction to Clustering, Partitional clustering, 4
Hierarchical Clustering, Density-based clustering
ESSENTIAL READING
1. Stuart Russell, Peter Norvig, Artificial Intelligence – A Modern Approach, 3rd Edition,
Pearson Education, 2009.
2. A Course in Machine Learning by Hal Daumé III,Self-Published, http://ciml.info/

SUPPLEMENTARY READING
1. Elaine Rich and Kevin Knight, Artificial Intelligence, 3rd Edition, McGraw-Hill, 2017.
2. Nils J. Nilsson, The Quest for Artificial Intelligence, Cambridge University Press. 2009.
3. Trevor Hastie , Robert Tibshirani , Jerome Friedman, The Elements of Statistical Learning,
2nd Edition, Springer, 2009.
4. Christopher M. Bishop, and Nasser M. Nasrabadi. Pattern recognition and machine learning.
Vol. 4. No. 4., Springer, 2006.

Additional Resources (NPTEL, MIT Video Lectures, Web resources etc.):


1. UC Berkeley CS188 Intro to AI -- Course Materials http://ai.berkeley.edu/home.html
2. NPTEL course: An Introduction to Artificial Intelligence By Prof. Mausam | IIT Delhi
https://onlinecourses.nptel.ac.in/noc21_cs42/preview
3. NPTEL course: INTRODUCTION TO MACHINE LEARNING By Prof. B.
Ravindran | IIT Madras https://archive.nptel.ac.in/courses/106/106/106106139/
https://www.cs.columbia.edu/~jebara/4771/handouts.html
https://www.seas.upenn.edu/~cis5190/fall2017/

You might also like