RAGHU ENGINEERING COLLEGE,
DAKAMARRI
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DS)
Branch : CSE Year: III Year-I Sem
Subject Name: Data Mining and Data Warehousing
Faculty Name: D.Hima Bindu
UNIT III
Classification: Basic Concepts, General Approach to solving a classification problem, Decision Tree classifier: A
Basic Algorithm to Build a Decision Tree , Methods for Expressing Attribute Test Conditions, Measures for
Selecting an Attribute Test Condition, Algorithm for Decision Tree Induction, Characteristics of Decision Tree
Classifiers, Model over fitting: Reasons for Model over fitting, evaluating the performance of classifier: holdout
method, Cross-validation, Random sub sampling.
S.No Topic You Tube Link Duration
1. General approach to solving a https://youtu.be/_9CXhMYflrc? 20.14-26.54
classification problem. si=EwCZhDL7h0-wtbif 6.40 mins
2. Basic algorithm used to build a https://youtu.be/PQbz0j56T3A?si=n- 17.42 mins
decision tree. asaZTcW9efJYyN
3. Common methods for https://youtu.be/zLXRLxXT5Is? 5.00 mins
expressing attribute test si=vhLl1415LKsMB2DF
conditions in decision trees
4. Decision tree induction https://youtu.be/mb3N4_pYtqE? 6.43 mins
si=is6rQkoyPbXBe_A5
5. Confusion matrix https://youtu.be/_9CXhMYflrc? 27.28-34.28
si=S4pFEUWTSZZ0jD1V 7.00 mins
6. Measures for selecting an https://youtu.be/lDapB3F8Lw8? 8.59 mins
attribute test condition si=9KeH4PDMhNelB4xz
7. Algorithm for decision tree https://youtu.be/Bjy81x3Efvk? 21.40-31.59
induction si=9qHsV9u9W3hu3As1 10.19 mins
8. Hunt’s algorithm https://youtu.be/MhtAHhJBsMo? 23.19 mins
si=iQ4pc8R5tCKRbZpG
9. Characteristics of decision tree https://youtu.be/EF9fyVjb1TM?si=PB2JC- 22.46 mins
ztbd4Grp5z
10. Measures for node impurity https://youtu.be/Bjy81x3Efvk? 9.33-21.10
si=9qHsV9u9W3hu3As1 12.23 mins
11. Holdout method to evaluate the https://youtu.be/fvfHTGqpR-M? 3.45 mins
performance of classifier si=pbBMYRmG4xtM6L9n
12. Random sub sampling to https://youtu.be/QtBxBJQsI2A? 5.25-7.48
evaluate the performance of si=62l2k9lNydWpJkDe 2.23 mins
classifier
13. k-fold cross validation https://youtu.be/QtBxBJQsI2A? 7.55-19.25
si=62l2k9lNydWpJkDe 12.30 mins
14. Creating decision tree, example https://youtu.be/zNYdkpAcP-g? 14.17 mins
si=QOTMOlumCE0HZBW0
15. Explain overfitting with an https://youtu.be/cSUEmTX9qSU? 10.16 mins
example.
si=apQQQRpBuUzRaWxd
16. Explain Reasons for Model Over https://youtu.be/EF9fyVjb1TM? 22.40 mins
fitting in Decision Tree si=zeFJMQEKrlFKEkvv
Induction.
17. Explain difference between https://youtu.be/mzW66DB48oM? 4.30 mins
entropy and gini index si=nX26pPJ45QR-krU4
Total Time mins
UNIT 4
Association Analysis: problem definition, Frequent Item set generation-The Apriori principle,
Frequent Item set generation in Apriori algorithm, candidate generation and pruning, support
counting , Rule generation, Compact representation of Frequent item sets, FP-Growth
algorithm.
1 Association rule mining https://youtu.be/IpBJ-veH-g0?
si=A_rmx8y6UUD4om8w
2 Association rule mining ex https://youtu.be/RDQplhHYUr0?
si=ZfAFZEnbZsKhmaz4
3 Fp growth algortihm https://youtu.be/7oGz4PCp9jI?
si=dZLs4KyeSi71oPhv
4 Compact representation of https://youtu.be/uox4Z9yh63o?si=lZTMRD-7k3-
frequent item sets (or) maximal 7nY9e
and closed frequent item sets
5 Different types of candidate https://youtu.be/B5Yszom_Tvk?
generation methods si=Abq4qu7PgGy5AvTr
6
7
8
9
10
11
12
13
14
15
16
17
18
UNIT V
Overview, K-means- Basic K- means algorithm ,additional issues, Bisecting k- means,
strengths and weaknesses. Agglomerative Hierarchical clustering-Basic agglomerative
hierarchical clustering algorithm, outliers, strengths and weaknesses. DBSCAN: Traditional
density: DBSCAN algorithm, strengths and weaknesses.
1 k-means clustering algorithm https://youtu.be/aR4yt5fBc_g?
with example for numeric data si=idnPwq97ZPef5yCk
2 k-means clustering algorithm https://youtu.be/KzJORp8bgqs?si=Qv5lt--H-
with example for point data c2L3-l1
3 Agglomerative hierarchical https://youtu.be/YH0r47m0kFM?
algorithm si=FSJ5cVY_pTrzL-2a
4
5 Db scan algorithm example https://youtu.be/-p354tQsKrs?si=-
2ZKY0ucsqN9oEp4
6 dB scan algorithm example in https://youtu.be/PZcssHN5PYQ?
telugu si=6BdlMkP55lwwG96p
7 Clustering https://youtu.be/dUm3ptTQr0Q?
si=BuvANO2oGeJtNu4z
8 All mining techniques in simple https://youtu.be/dUm3ptTQr0Q?
form si=BuvANO2oGeJtNu4z
9
10
11
12
13
14
15
16
