Class meeting for 10-605 Scalable PageRank
From Cohen Courses
Jump to navigationJump to searchThis is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2014.
Slides
- Tips on Debugging for the SGD Assignment
- PageRank and Scalability
- Subsampling a Graph - 1
- Subsampling a Graph - 2
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
