Class meeting for 10-605 SSL on Graphs

From Cohen Courses
Revision as of 10:54, 15 November 2016 by Wcohen (talk | contribs) (→‎Slides)
Jump to navigationJump to search

This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Fall 2016.

Slides

Quiz

Optional Readings

Key things to remember

  • What SSL is and when it is useful.
  • The harmonic fields and multi-rank walk SSL algorithms, and properties of these algorithms.
  • What is optimized by the MAD algorithm, and what the goal is of the various terms in the optimization.
  • The power iteration clustering algorithm.