10-601 Hierarchical clustering
From Cohen Courses
Revision as of 02:04, 13 August 2014 by Zivbj (talk | contribs) (Created page with "This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014 === Slides === [http://curtis.ml.cmu.edu/w/courses/images/a/a7/Lecture14-clustering.pdf Sli...")
This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014
Slides
Readings
Bishop's Chapter 9
Mitchell 6.12 also has a nice description of EM and k-means.
What You Should Know Afterward
- Linkage methods
- Bottom up vs. top down clustering
- Run time of different clustering methods
- Assumptions, advntages and disadvantages of each method
- (optional) Optimal leaf ordering
- (optional) Spectral clustering
- (optional) Self organizing maps
