Difference between revisions of "Class meeting for 10-605 SSL on Graphs"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 5: | Line 5: | ||
* [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.pptx Semi-Supervised Learning On Graphs] | ||
| − | === Readings === | + | === Optional Readings === |
| − | * [http://www.cs.cmu.edu/~wcohen/postscript/ | + | * [http://www.cs.cmu.edu/~wcohen/postscript/asonam2010-final.pdf Frank Lin and William W. Cohen (2010)]: Semi-Supervised Classification of Network Data Using Very Few Labels in ASONAM-2010. |
| − | * [http://www.cs.cmu.edu/~wcohen/postscript/ | + | * [https://server1.tepper.cmu.edu/seminars/docs/BinderPartha.pdf PP Talukdar, K Crammer (2009):] New regularized algorithms for transductive learning Machine Learning and Knowledge Discovery in Databases, 442-457 |
| + | * [http://www.cs.cmu.edu/~wcohen/postscript/ai-stats-2014.pdf 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. | ||
Revision as of 11:25, 10 April 2015
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_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.
