Difference between revisions of "Class meeting for 10-605 2013 02 25"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This is one of the class meetings on the schedule for the course [[Machine Learning with Large Dataset…') |
(→Slides) |
||
| Line 3: | Line 3: | ||
=== Slides === | === Slides === | ||
| − | * | + | * Randomizd algoriithms review - map-reduce version of PageRank |
** [http://www.cs.cmu.edu/~wcohen/10-605/2013-02-25-randomized-pagerank.pptx Slides in Powerpoint] | ** [http://www.cs.cmu.edu/~wcohen/10-605/2013-02-25-randomized-pagerank.pptx Slides in Powerpoint] | ||
| + | ** [http://www.cs.cmu.edu/~wcohen/10-605/2013-02-25-randomized-pagerank.pdf Slides in PDF] | ||
=== Readings === | === Readings === | ||
* [http://dl.acm.org/citation.cfm?id=1219840.1219917 Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering] Deepak Ravichandran, Patrick Pantel, and Eduard Hovy | * [http://dl.acm.org/citation.cfm?id=1219840.1219917 Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering] Deepak Ravichandran, Patrick Pantel, and Eduard Hovy | ||
* [http://dl.acm.org/citation.cfm?id=1830263 Design patterns for efficient graph algorithms in MapReduce], Lin and Schatz, MLG 2010 | * [http://dl.acm.org/citation.cfm?id=1830263 Design patterns for efficient graph algorithms in MapReduce], Lin and Schatz, MLG 2010 | ||
Revision as of 15:59, 25 February 2013
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2013.
Slides
- Randomizd algoriithms review - map-reduce version of PageRank
Readings
- Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering Deepak Ravichandran, Patrick Pantel, and Eduard Hovy
- Design patterns for efficient graph algorithms in MapReduce, Lin and Schatz, MLG 2010
