10-601 DR

From Cohen Courses
Revision as of 09:08, 12 August 2014 by Zivbj (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014


Slides in PDF


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