Difference between revisions of "Class meeting for 10-605 Randomized"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 3: | Line 3: | ||
=== Slides === | === Slides === | ||
| + | |||
| + | Comment: I'm going to start off with a few slides I didn't get to on Tuesday, which are filed under Tuesday's lecture. | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Slides in Powerpoint] | * [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Slides in Powerpoint] | ||
Revision as of 17:50, 18 February 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
Comment: I'm going to start off with a few slides I didn't get to on Tuesday, which are filed under Tuesday's lecture.
Supplement:
Optional Readings
- Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering Deepak Ravichandran, Patrick Pantel, and Eduard Hovy
- Online Generation of Locality Sensitive Hash Signatures. Benjamin Van Durme and Ashwin Lall. ACL Short. 2010
- Sketch Algorithms for Estimating Point Queries in NLP. Amit Goyal, Hal Daume III, and Graham Cormode, EMNLP 2012]
