Scribd
Upload
32 views

ML Syllabus Updated E13137

The document provides a machine learning syllabus for Chandigarh University. It includes 5 units that cover fundamental machine learning concepts, supervised learning algorithms like linear regression and decision trees, unsupervised learning techniques like clustering and PCA, and semi-supervised and reinforcement learning. It lists course outcomes, textbook references, a mapping of course outcomes to program outcomes, and 10 experiments to be performed in the machine learning lab.

Uploaded by

Tarun saraswat
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
32 views

ML Syllabus Updated E13137

The document provides a machine learning syllabus for Chandigarh University. It includes 5 units that cover fundamental machine learning concepts, supervised learning algorithms like linear regression and decision trees, unsupervised learning techniques like clustering and PCA, and semi-supervised and reinforcement learning. It lists course outcomes, textbook references, a mapping of course outcomes to program outcomes, and 10 experiments to be performed in the machine learning lab.

Uploaded by

Tarun saraswat
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/ 7

ML Syllabus updated E13137

Machine learning (Chandigarh University)

Studocu is not sponsored or endorsed by any college or university


Downloaded by Tarun Saraswat ([email protected])
.

Chandigarh University, Gharuan

Machine Learning L T P C

Total Contact Hours : 45Hours

Subject Code Common to all Specializations of CSE 3 0 0 3


3rdYear
CST-316
Prerequisite:
 Familiarity with the basic probability theory
 Familiarity with the basic linear algebra
Marks-100

Internal-40 External-60

Unit Course Outcomes

1
Apply the basic concept of Machine learning to deal with real-life Problems.
2 Understand different machine learning algorithms, as well as underlying theories the behind them.

3 Select and apply the appropriate machine learning algorithm to solve problems of moderate complexity

4 Interpret and evaluate models generated from data.

5 Optimize the models learned and report on the expected accuracy that can be attained by applying the
algorithms to a real-world problem.

Contents of the Syllabus

UNIT-I [14h]

Unit 1 (14 hrs)


Fundamental of Machine Learning: Introduction to Machine Learning (ML), Different types of
Machine Learning, Machine Learning Life Cycle: Data Discovery, Exploratory Analysis: Data
Preparation, Model Planning, Model Building, Model Evaluation, Real World Case Study. Foundation
of ML: ML Techniques.

Downloaded by Tarun Saraswat ([email protected])


.

Descriptive Statistics and inferential Statistics: Mean Median, Mode, Correlation,


Covariance, Quartile, Maximum Likelihood, Bayesian Inference, Bias, Variance, Distance metrics:
Euclidean Distance, Manhattan Distance,

Statistical Learning: Using Statistical Decision Theory, Background and General Method, Gaussian
(or Normal) Distributions, Conditionally Independent Binary Components, statistical hypothesis
testing.

Data Visualization and Preprocessing: Histograms, bar plots, Box plots, Scatter plots; Feature
Selection Methods, Missing Value Handling Methods.

Unit 2 (15 hrs)


Supervised Learning: Linear Regression, Multiple Regression, Logistic Regression, and Decision
Tree: Picking the best splitting attribute: entropy and information gain, over fitting and under fitting,
noisy data and pruning. Ensemble Methods: Random Forest, Support Vector Machine (SVM), Naive
Bayesian Classifier, K-Nearest Neighbor (KNN), Cross-Validation, Confusion Matrix. Evaluation of
the performance of an algorithm: Accuracy, Error Rate, Precision, Recall, Specificity, F1 Score, Mean
Squared Error, Root Mean Squared Error.

Unit 3 (16 hrs)

Unsupervised Learning: Clustering, Partitioning Method - K-means, K-medioids, Hierarchical


Clustering- Agglomerative and divisive clustering, Evaluation of clustering algorithms. Principal
Component Analysis (Eigen values, Eigen Vectors, Orthogonality). Association Rules: Association
Rule mining: Apriori Algorithm, Support and Confidence Parameters, Lift and Leverage. Feature
Reduction and Dimensionality Reduction.

Semi-Supervised Learning: Introduction, Assumptions, Working and Real-World Applications.


Reinforcement Learning: Introduction, Applications and Examples, Challenges of applying
reinforcement learning, reinforcement learning algorithm.

Text Books:

1. Ethem Alpaydın, Introduction to Machine Learning (Adaptive Computation and Machine


Learning), MIT Press, 2004.
2. Mitchell. T, Machine Learning, McGraw Hill, 1997.
3. Nilsson, Nils J. "Introduction to machine learning: An early draft of a proposed textbook."
(1996).

Downloaded by Tarun Saraswat ([email protected])


.

Reference Material:

1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.


2. Ryszard S. Michalski, Jaime G. Carbonell, Tom M. Mitchell, and Machine Learning: An Artificial
Intelligence Approach, Tioga Publishing Company, 1983.

CO-PO-Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1 PSO PSO
0 1 2 1 2
C
O

CO
-1
CO
-2
CO
-3
CO
-4
CO
-5

Student’s Outcomes

CA CA CA CA CA EA EA EA EA EA EA EA CA CA
C-- C-- C-- C-- C-- C- C- C- C- C- C- C- C-- C--
SO1 SO2 SO3 SO4 SO5 SO1 SO2 SO3 SO4 SO5 SO6 SO7 SO1 SO2

Downloaded by Tarun Saraswat ([email protected])


.

Chandigarh University, Gharuan


Machine Learning Lab L T P C

Total Contact Hours : 48Hours

Subject Code Common to all Specializations of CSE 3rd 0 0 2 1


Year
CSP-317
Prerequisite:
 Knowledge of basic computer science principles and skills, at a level
sufficient to write a reasonably non-trivial computer program.
Marks-100

Internal-60 External-40

Unit Course Outcome

List of Experiments
UNIT-I

1. Implement Exploratory Data Analysis on any data set.


2. Implement Data Visualization.
3. Implement Outlier Analysis.

UNIT-II

4. Implement Linear Regression on any data set with confusion Matrix and roc Curve
5. Implement Decision Tree, Implement Random Forest on any data set.
6. Implement Naïve Bayes.
7. Implement K-Nearest Neighbor on any data set.

UNIT-III

Downloaded by Tarun Saraswat ([email protected])


.

8. Implement K-means clustering algorithm (cluster some sample data set into disjoint
clusters using K-means).
9. Implement Principle Component Analysis.
10. Implement Association Rule Mining.

CO-PO-Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1 PSO PSO
0 1 2 1 2
C
O

CO
-1
CO
-2
CO
-3
CO
-4
CO
-5

Student’s Outcomes

CA CA CA CA CA EA EA EA EA EA EA EA CA CA
C-- C-- C-- C-- C-- C- C- C- C- C- C- C- C-- C--
SO1 SO2 SO3 SO4 SO5 SO1 SO2 SO3 SO4 SO5 SO6 SO7 SO1 SO2

Downloaded by Tarun Saraswat ([email protected])


.

Downloaded by Tarun Saraswat ([email protected])

You might also like