Difference between revisions of "Class meeting for 10-605 2013 02 18"
From Cohen Courses
Jump to navigationJump to search| Line 12: | Line 12: | ||
* [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/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 | * [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] | ||
Revision as of 18:00, 18 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
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
