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

From Cohen Courses
Jump to navigationJump to search
Line 51: Line 51:
  
 
* Mon Apr 1. [[Class meeting for 10-605 2013 04 01|LDA-like models for text and graphs]]
 
* Mon Apr 1. [[Class meeting for 10-605 2013 04 01|LDA-like models for text and graphs]]
* Wed Apr 3. [[Class meeting for 10-605 2013 04 08|Speeding up LDA-like models: sampling and parallelization]]
+
* Wed Apr 3. [[Class meeting for 10-605 2013 04 03|Speeding up LDA-like models: sampling and parallelization]]
 
** '''Assignment due: Subsampling and visualizing a graph.'''
 
** '''Assignment due: Subsampling and visualizing a graph.'''
 
** ''New Assignment: K-Means on MapReduce.'' [http://www.cs.cmu.edu/~wcohen/10-605/assignments/kmeans.pdf PDF writeup]
 
** ''New Assignment: K-Means on MapReduce.'' [http://www.cs.cmu.edu/~wcohen/10-605/assignments/kmeans.pdf PDF writeup]
* Mon Apr 8. [[Class meeting for 10-605 2013 04 10|Fast KNN and similarity joins 1.]]
+
* Mon Apr 8. [[Class meeting for 10-605 2013 04 08|Fast KNN and similarity joins 1.]]
 
* Wed Apr 10. [[Class meeting for 10-605 2013 04 15|Fast KNN and similarity joins 2.]]
 
* Wed Apr 10. [[Class meeting for 10-605 2013 04 15|Fast KNN and similarity joins 2.]]
 
* Mon Apr 15. [[Class meeting for 10-605 2013 04 17|Scaling up decision tree learning]]
 
* Mon Apr 15. [[Class meeting for 10-605 2013 04 17|Scaling up decision tree learning]]

Revision as of 16:35, 21 March 2013

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

January

February

March

April and May

May

  • Fri May 3.
    • Project writeups due at 5:00pm. Submit a paper to Blackbook in PDF in the ICML 2013 format (minimum 5 pp, up to 8pp double column), except, of course, do not submit it anonymously.