Difference between revisions of "Class meeting for 10-605 Scalable PageRank"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
(→Quiz) |
||
| Line 12: | Line 12: | ||
=== Quiz === | === Quiz === | ||
| − | * | + | * [https://qna-app.appspot.com/view.html?aglzfnFuYS1hcHByGQsSDFF1ZXN0aW9uTGlzdBiAgICgjtDJCAw [https://qna-app.appspot.com/view.html?aglzfnFuYS1hcHByGQsSDFF1ZXN0aW9uTGlzdBiAgICgjtDJCAw]] |
=== Readings === | === Readings === | ||
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: [1]
Quiz
Readings
- Samping from Large Graphs, Jure Leskovec and Christos Faloutsos, KDD 2006.
- Local Graph Partitioning using PageRank Vectors, Andersen, Chung, Lang, FOCS 2006
