Difference between revisions of "Class meeting for 10-605 SGD for MF 2 and Randomized Algorithms"
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 Data...") |
(→Slides) |
||
| Line 4: | Line 4: | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/2014/matrix-factors-2.pptx Matrix Factors, Continued - Slides] | * [http://www.cs.cmu.edu/~wcohen/10-605/2014/matrix-factors-2.pptx Matrix Factors, Continued - Slides] | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-605/2014/randomized-algs.pptx Randomized Algorithms] | + | * [http://www.cs.cmu.edu/~wcohen/10-605/2014/randomized-algs.pptx Randomized Algorithms - Slides] |
| − | |||
=== 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 | ||
Revision as of 17:10, 21 February 2014
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2014.
Slides
Readings
- Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering Deepak Ravichandran, Patrick Pantel, and Eduard Hovy
