Difference between revisions of "10-601 CF"
From Cohen Courses
Jump to navigationJump to search (Created page with "=== Slides === * [http://www.cs.cmu.edu/~wcohen/10-601/cf.pptx Slides in PowerPoint]. === Readings === * Nothing is assigned (this is not covered in Mitchell). === Summar...") |
|||
| Line 1: | Line 1: | ||
| + | This a lecture used in the [[Syllabus for Machine Learning 10-601]] | ||
| + | |||
=== Slides === | === Slides === | ||
Latest revision as of 10:45, 31 October 2013
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.
