Difference between revisions of "Class meeting for 10-605 Unsupervised Learning On Graphs"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
Line 10: | Line 10: | ||
* There's no quiz today. | * There's no quiz today. | ||
− | === Readings === | + | === Optional Readings === |
− | * | + | * Frank Lin and William W. Cohen (2010): Power Iteration Clustering in ICML-2010. |
+ | * Frank Lin and William W. Cohen (2010): A Very Fast Method for Clustering Big Text Datasets in ECAI-2010. | ||
+ | * Frank Lin and William W. Cohen (2011): Adaptation of Graph-Based Semi-Supervised Methods to Large-Scale Text Data in MLG-2011. | ||
+ | * Ramnath Balasubramanyan, Frank Lin, and William W. Cohen (2010): Node Clustering in Graphs: An Empirical Study in NIPS-2010 Workshop on Networks Across Disciplines. |
Revision as of 12:43, 17 November 2016
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
- There's no quiz today.
Optional Readings
- Frank Lin and William W. Cohen (2010): Power Iteration Clustering in ICML-2010.
- Frank Lin and William W. Cohen (2010): A Very Fast Method for Clustering Big Text Datasets in ECAI-2010.
- Frank Lin and William W. Cohen (2011): Adaptation of Graph-Based Semi-Supervised Methods to Large-Scale Text Data in MLG-2011.
- Ramnath Balasubramanyan, Frank Lin, and William W. Cohen (2010): Node Clustering in Graphs: An Empirical Study in NIPS-2010 Workshop on Networks Across Disciplines.