Difference between revisions of "Class meeting for 10-605 SSL on Graphs"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 4: | Line 4: | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/ssl-mrw-hf.pptx Semi-Supervised Learning On Graphs],[http://www.cs.cmu.edu/~wcohen/10-605/ssl-mrw-hf.pdf In PDF] | * [http://www.cs.cmu.edu/~wcohen/10-605/ssl-mrw-hf.pptx Semi-Supervised Learning On Graphs],[http://www.cs.cmu.edu/~wcohen/10-605/ssl-mrw-hf.pdf In PDF] | ||
| + | * [http://www.cs.cmu.edu/~wcohen/10-605/pic.pptx Unsupervised Learning On Graphs],[http://www.cs.cmu.edu/~wcohen/10-605/pic.pdf In PDF] | ||
=== Optional Readings === | === Optional Readings === | ||
Revision as of 19:12, 10 November 2015
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Fall 2015.
Slides
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.
