Difference between revisions of "Class meeting for 10-405 SSL on Graphs"
From Cohen Courses
Jump to navigationJump to search| Line 10: | Line 10: | ||
=== Readings === | === Readings === | ||
| + | |||
| + | * William's [http://www.cs.cmu.edu/~wcohen/10-605/notes/graph-ssl.pdf lecture notes on graph-based SSL]. | ||
=== Optional Readings === | === Optional Readings === | ||
Latest revision as of 10:50, 30 March 2018
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-405 in Spring 2018.
Slides
Quiz
Readings
- William's lecture notes on graph-based SSL.
Optional Readings
- Frank Lin and William W. Cohen (2010): Semi-Supervised Classification of Network Data Using Very Few Labels in ASONAM-2010.
- PP Talukdar, K Crammer (2009): New regularized algorithms for transductive learning Machine Learning and Knowledge Discovery in Databases, 442-457
- Partha Pratim Talukdar and William W. Cohen (2014): Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketch in AI-Stats 2014.
- Sujith Ravi and Qiming Diao. "Large Scale Distributed Semi-Supervised Learning Using Streaming Approximation." arXiv preprint arXiv:1512.01752 (2015).
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.
