SEMESTER-V
COURSE: UNSUPERVISED ML WITH PYTHON
Theory Credits: 3 hrs/week
Aim and objectives of Course (Unsupervised ML with Python):
Unsupervised Machine Learning involves finding patterns in datasets.
The core of this course involves study of Clustering, feature extraction and optimization
algorithms.
The purpose of this course is to serve as an introduction to machine learning with
Python.
Learning outcomes of Course:
Able to do Clustering, feature extraction and optimization.
Students will be able to understand and implement in Python algorithms of Unsupervised
Machine Learning and apply them to real-world datasets.
Syllabus: (Total Hours: 90 including Teaching, Lab and internal exams, etc.)
UNIT I:
Unsupervised Learning: Clustering: k-means clustering algorithm, Improving cluster
performance with post processing, Bisecting k-means, Example: clustering points on a map
UNIT II:
Association analysis : Apriori algorithm: Association analysis, The Apriori principle, Finding
frequent item sets with the Apriori algorithm, Mining association rules from frequent item sets,
uncovering patterns in congressional voting
UNIT III:
Finding frequent item sets: FP-growth –FP trees, Build FP-tree, mining frequent from an FP-
tree, finding co-occurring words in a Twitter feed, mining a click stream from a news site.
UNIT IV:
Principal component analysis: Dimensionality reduction techniques, using PCA to reduce the
dimensionality of semiconductor manufacturing data
UNIT V:
Singular value decomposition: Applications of the SVD, Matrix factorization, SVD in Python,
Collaborative filtering–based recommendation engines, a restaurant dish recommendation engine
TEXT BOOK:
1. Machine learning in action, Peter Harrington by Manning publicationsUnsupervised ML with
Python Lab
SEMESTER- V
COURSE 13: UNSUPERVISED ML WITH PYTHON
Practical Credits: 1 2 hrs/week
Details of Lab/Practical/Experiments/Tutorials syllabus:
1. Implementation of K-Means Clustering
2. Implement the bisecting k-means clustering algorithm
3. Implement Apriori algorithm
4. Implement Association rule-generation functions
5. Implement FP-tree creation
6. Write a function to find all paths ending with a given item.
7. Implement Code to access the Twitter Python library
8. Implement the PCA algorithm
9. Write a program to find Rating estimation by using the SVD
10. Implement Image-compression functions using SVD.