Difference between revisions of "Class meeting for 10-605 Scalable PageRank"
From Cohen Courses
Jump to navigationJump to searchm (Wcohen moved page Class meeting for 10-605 Subsample A Graph to Class meeting for 10-605 Scalable PageRank) |
(→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] | ||
− | |||
− | |||
=== Readings === | === Readings === |
Revision as of 14:57, 17 March 2014
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2014.
Slides
Readings
- Design patterns for efficient graph algorithms in MapReduce, Lin and Schatz, MLG 2010
- Samping from Large Graphs, Jure Leskovec and Christos Faloutsos, KDD 2006.
- Local Graph Partitioning using PageRank Vectors, Andersen, Chung, Lang, FOCS 2006