10-601 CF

From Cohen Courses
Revision as of 11:45, 31 October 2013 by Wcohen (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

Slides

Readings

  • Nothing is assigned (this is not covered in Mitchell).

Summary

You should know:

  • What collaborative filtering is.
  • How nearest-neighbor methods for CF work.
  • How to formulate CF as a regression or classification problem.
  • How matrix factorization can be used for CF.
  • How PCA, SVD, k-means, and other clustering methods relate to matrix factorization.
  • Why computer scientists tend to get Halloween and Christmas confused.