0% found this document useful (0 votes)
62 views2 pages

21CSC305P Machine Learning C Professional Core L T P C 2 1 0 3

Uploaded by

Manmohan Y.
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)
62 views2 pages

21CSC305P Machine Learning C Professional Core L T P C 2 1 0 3

Uploaded by

Manmohan Y.
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/ 2

Course Course Course L T P C

21CSC305P MACHINE LEARNING C PROFESSIONAL CORE


Code Name Category 2 1 0 3

Pre-requisite Co- requisite Progressive


Nil Nil Nil
Courses Courses Courses
Course Offering Department School of Computing Data Book / Codes / Standards Nil

Course Learning Rationale (CLR): The purpose of learning this course is to: Program Outcomes (PO) Program
Specific
CLR-1: explore the fundamental mathematical concepts of machine learning algorithms 1 2 3 4 5 6 7 8 9 10 11 12 Outcomes
CLR-2: apply linear machine learning model to perform regression and classification

Individual & Team Work


Engineering Knowledge

Design/development of

Project Mgt. & Finance


Conduct investigations
of complex problems
CLR-3: utilize mixture models to group similar data items

Modern Tool Usage

Life Long Learning


The engineer and
Problem Analysis

Communication
CLR-4: develop machine learning models for time –series data prediction

Environment &
Sustainability
CLR-5: design ensemble learning models using various machine learning algorithms

solutions

society

PSO-1

PSO-2

PSO-3
Ethics
Course Outcomes (CO): At the end of this course, learners will be able to:
CO-1: understand the basics of machine learning using probability theory - 2 - - - - - - - - - - 1 - -
CO-2: implement machine learning models using supervised learning algorithms - 2 - 2 - - - - - - - - - - 2
CO-3: implement machine learning models using unsupervised learning algorithms - 3 - 3 - - - - - - - - - - 2
CO-4: implement machine learning models for sequential data analysis and prediction - 3 - 3 - - - - - - - - - - 3
CO-5: develop ensemble learning models for supervised and unsupervised learning - 3 3 - - - - - - - - - - 3

Unit-1 - Introduction 9 Hour


machine learning what and why?, supervised and unsupervised learning, polynomial curve fitting, probability theory- discrete random variables, fundamental rules,Bayes rule, Independence and conditional
independence, continuous random variables, Quantiles, Mean and variance, probability densities, Expectation and covariance.
Practice:
1. Devise a program to import, load and view dataset
2. Create a program to display the summary and statistics of the dataset
Unit-2 - Linear models for Regression 9 Hour
Maximum likelihood estimation – least squares, robust linear expression, ridge regression, Bayesian linear regression. Linear models for classification: Discriminant function – Probabilistic generative models,
Probabilistic discriminative models, Laplacian approximation, Bayesian logistic regression, Kernels functions, using kernels in GLMs, Kernel trick, SVMs.
Practice:
1. Implement linear regression to perform prediction
2. Implement Bayesian logistic regression and SVM for classification
Unit-3 - Mixture Models and EM 9 Hour
K-means clustering, mixtures of Gaussians, An alternative view of EM, Factor analysis, PCA, choosing the number of latent dimensions. Clustering – measuring dissimilarity, evaluating the output of clustering
methods, Hierarchical clustering.
Practice:
1. Implement K-means clustering, mixtures of Gaussians and Hierarchical clustering algorithm to categorize data.
2. Create a program to perform PCA
32
B.Tech / M.Tech (Integrated) Programmes-Regulations 2021-Volume-11-CSE-Higher Semester Syllabi-Control Copy
Unit-4 – Hidden Markov Models 9 Hour
Sequential data – Markov models, HMM – maximum likelihood for the HMM, The forward and Backward algorithm, the sum-product algorithm, scaling factors, Viterbi algorithm, linear dynamical systems.
Practice:
1. Implement HMM to predict the sequential data
Unit-5 – Combining Models 9 Hour
Bayesian model averaging, Boosting, Adaptive basis function models, CART, generalized additive models, Ensemble learning.
Practice:
1. Implement CART learning algorithms to perform categorization
2. Implement Ensemble learning models to perform classification

Learning
1. Pattern Recognition and Machine Learning, Christopher M Bishop, Springer, 2006. 2. Machine Learning- A probabilistic perspective, Kevin P.Murphy, The MIT Press, 2012.
Resources

Learning Assessment
Continuous Learning Assessment (CLA)
Formative Project Based Learning Report and Viva Voce Final Examination
Bloom’s
CLA-1 Average of unit test CLA-2 (20% weightage) (0% weightage)
Level of Thinking
(20%) (60%)
Theory Practice Theory Practice Theory Practice Theory Practice
Level 1 Remember 15% - - 15% - 15% - -
Level 2 Understand 25% - - 20% - 20% - -
Level 3 Apply 30% - - 25% - 25% - -
Level 4 Analyze 30% - - 25% - 25% - -
Level 5 Evaluate - - - 10% - 10% - -
Level 6 Create - - - 5% - 5% - -
Total 100 % 100 % 100 % -

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mr.Vaisakh. P.S, Assistant executive manager, Samsung 1. Dr.C.Oswald, Assistanrt professor, NIT, 1. A.Jackulin Mahariba, SRMIST
Electronics, Bangalore [email protected] Trichy,[email protected]

33
B.Tech / M.Tech (Integrated) Programmes-Regulations 2021-Volume-11-CSE-Higher Semester Syllabi-Control Copy

You might also like