Difference between revisions of "Class meeting for 10-605 Scalable PageRank"
From Cohen Courses
Jump to navigationJump to search (→Quiz) |
(→Slides) |
||
| Line 7: | Line 7: | ||
* [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/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.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.pdf PDF version] | ||
| − | |||
| − | |||
=== Quiz === | === Quiz === | ||
Revision as of 18:29, 3 November 2015
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Fall_2015.
Slides
- Randomized Algorithms wrap-up, Randomized Algorithms PDF version.
- Tips on Debugging for the SGD Assignment,PDF version
- PageRank and Scalability, PDF version
- Sampling from a Graph, PDF version
Quiz
Readings
- Samping from Large Graphs, Jure Leskovec and Christos Faloutsos, KDD 2006.
- Local Graph Partitioning using PageRank Vectors, Andersen, Chung, Lang, FOCS 2006
