Difference between revisions of "Syllabus for Machine Learning with Large Datasets 10-605 in Spring 2012"

From Cohen Courses
Jump to navigationJump to search
Line 24: Line 24:
 
* Thus Feb 16. [[Class meeting for 10-605 2012 02 16|Hadoop helpers and Scalable SGD]]
 
* Thus Feb 16. [[Class meeting for 10-605 2012 02 16|Hadoop helpers and Scalable SGD]]
 
* Tues Feb 21. [[Class meeting for 10-605 2012 02 21|Scalable SGD and Hash Kernels]]
 
* Tues Feb 21. [[Class meeting for 10-605 2012 02 21|Scalable SGD and Hash Kernels]]
* Thus Feb 23. ''Guest lecture'': Ron Bekkerman, LinkedIn, Scaling up Machine Learning
+
* Thus Feb 23. ''Guest lecture'': [http://www.cs.umass.edu/~ronb/ Ron Bekkerman], LinkedIn, Scaling up Machine Learning
 
** [http://www.cs.cmu.edu/~wcohen/10-605/2012-02-23-bekkerman.pptx Ron's slides in Powerpoint]
 
** [http://www.cs.cmu.edu/~wcohen/10-605/2012-02-23-bekkerman.pptx Ron's slides in Powerpoint]
 
** [http://www.cs.cmu.edu/~wcohen/10-605/2012-02-23-bekkerman.pdf Ron's slides in PDF]
 
** [http://www.cs.cmu.edu/~wcohen/10-605/2012-02-23-bekkerman.pdf Ron's slides in PDF]
* Tues Feb 28. Bloom Filters and Locality sensitive hashing 1.
+
* Tues Feb 28. [[Class meeting for 10-605 2012 02 28|Background on randomized algorithms; Graph computations 1.]]
  
 
== March ==
 
== March ==

Revision as of 11:57, 27 February 2012

This is the syllabus for Machine Learning with Large Datasets 10-605 in Spring 2012.

January

February

March

  • Thus Mar 1. Guest Lecture: Ben van Durme, JHU, Randomized Algorithms for Large-Scale Learning
  • Tues Mar 6. Learning on graphs. PageRank, Harmonic field, RWR; tools and design patterns for graphs (Pregel, GraphLab, Schimmy, ...)
    • Hadoop assignments due
    • New Assignment: memory-efficient SGD
    • New assignment: mini-project proposals (first draft).
  • Thus Mar 8. Guest Lecture: Joey Gonzales, CMU, GraphLab and Dynamic Asynchronous Computation
  • Tues Mar 13. no class - spring break.
  • Thus Mar 15. no class - spring break.
  • Tues Mar 20. Spectral clustering and PIC.
    • Assignment due: mini-project proposals (first draft).
    • Assignment due: memory-efficient SGD
    • New Assignment: Subsampling and visualizing a graph.
  • Thus Mar 22. Tentative: Guest lecture by U Kang, CMU.
  • Tues Mar 27. Gibbs sampling and LDA.
    • Assignment due: Subsampling and visualizing a graph.
    • New Assignment: mini-project proposals (final version)
  • Thus Mar 29. KNN classification and inverted indices.
    • Assignment due: mini-project proposals (final version).

April

  • Tues Apr 3. Decision trees and random forests 1.
  • Thus Apr 5. Decision trees and random forests 2.
  • Tues Apr 10. Soft joins with KNN and inverted indices 1.
  • Thus Apr 12. Soft joins with KNN and inverted indices 1.
  • Tues Apr 17. Structured prediction 1.
  • Thus Apr 19. no class - Carnival
  • Tues Apr 24. Structured prediction 2.
  • Thus Apr 26. Additional topics.

May

  • Tues May 1. Project reports.
  • Thus May 3. Project reports.