Difference between revisions of "Class meeting for 10-605 2013 02 18"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
=== Slides === | === Slides === | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-605/2013-02-18- | + | * [http://www.cs.cmu.edu/~wcohen/10-605/2013/2013-02-18-randomized.pptx Slides in Powerpoint] |
| + | |||
| + | === Optional 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://www.cs.jhu.edu/~vandurme/papers/VanDurmeLallACL10.pdf Online Generation of Locality Sensitive Hash Signatures]. Benjamin Van Durme and Ashwin Lall. ACL Short. 2010 | ||
| + | * [http://www.cs.jhu.edu/~vandurme/papers/VanDurmeLallIJCAI09.pdf Counting with Randomized Storage]. Benjamin Van Durme and Ashwin Lall. IJCAI. 2009 | ||
| + | |||
| + | === Other stuff === | ||
| + | |||
| + | * [http://www.cs.cmu.edu/~wcohen/10-605/code/bloomfilter.py A simple python implementation of a Bloom filter] | ||
Latest revision as of 17:13, 8 January 2014
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2013.
Slides
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
- Counting with Randomized Storage. Benjamin Van Durme and Ashwin Lall. IJCAI. 2009
