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...") |
|||
| (6 intermediate revisions by the same user not shown) | |||
| Line 3: | Line 3: | ||
=== Slides === | === Slides === | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-605 | + | * [http://www.cs.cmu.edu/~wcohen/10-605/matrix-factors-2.pptx Matrix Factors, Continued - Slides] |
| − | * [http://www.cs.cmu.edu/~wcohen/10-605 | + | * [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Randomized Algorithms - Slides] |
| + | === Other Stuff === | ||
| + | |||
| + | * [http://www.cs.cmu.edu/~wcohen/10-605/bloomfilter.py Python demo code for a simple Bloom filter] | ||
=== Readings === | === Readings === | ||
| − | * [http:// | + | |
| + | * [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 | ||
Latest revision as of 11:22, 26 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
Other Stuff
Readings
- 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
