Difference between revisions of "Class meeting for 10-605 Scalable PageRank"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 6: | Line 6: | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/debugging-tips.pptx Tips on Debugging for the SGD Assignment] | * [http://www.cs.cmu.edu/~wcohen/10-605/debugging-tips.pptx Tips on Debugging for the SGD Assignment] | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/pagerank.pptx PageRank and Scalability] | * [http://www.cs.cmu.edu/~wcohen/10-605/pagerank.pptx PageRank and Scalability] | ||
| + | * [http://www.cs.cmu.edu/~wcohen/10-605/rwr-sampling.pptx Sampling from a Graph] | ||
=== Readings === | === Readings === | ||
Revision as of 16:21, 16 March 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
Readings
- Samping from Large Graphs, Jure Leskovec and Christos Faloutsos, KDD 2006.
- Local Graph Partitioning using PageRank Vectors, Andersen, Chung, Lang, FOCS 2006
