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