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

From Cohen Courses
Jump to navigationJump to search
 
(12 intermediate revisions by the same user not shown)
Line 1: Line 1:
This is the syllabus for [[Machine Learning with Large Datasets 10-605 in Spring 2012]].
+
This is the syllabus for [[Machine Learning with Large Datasets 10-605 in Spring 2012]]. '''If you're taking 10-605 now, you're probably looking for the syllabus for  [[Machine Learning with Large Datasets 10-605 in Spring 2013]].'''
  
 
== January ==
 
== January ==
Line 39: Line 39:
 
* Tues Mar 13. ''no class - spring break.''
 
* Tues Mar 13. ''no class - spring break.''
 
* Thus Mar 15. ''no class - spring break.''
 
* Thus Mar 15. ''no class - spring break.''
* Tues Mar 20. Subsampling a graph with RWR
+
* Tues Mar 20. [[Class meeting for 10-605 2012 03 20|Subsampling a graph with RWR]]
 
** '''Assignment due: initial mini-project proposals.'''  
 
** '''Assignment due: initial mini-project proposals.'''  
 
** '''Assignment due: memory-efficient SGD'''
 
** '''Assignment due: memory-efficient SGD'''
 
** ''New Assignment: Subsampling and visualizing a graph.'' [http://www.cs.cmu.edu/~wcohen/10-605/assignments/snowball.pdf PDF writeup]
 
** ''New Assignment: Subsampling and visualizing a graph.'' [http://www.cs.cmu.edu/~wcohen/10-605/assignments/snowball.pdf PDF writeup]
* Thus Mar 22. Semi-supervised learning via label propagation on graphs
+
* Thus Mar 22. [[Class meeting for 10-605 2012 03 22|Semi-supervised learning via label propagation on graphs]]
* Tues Mar 27. Label propagation 2: Unsupervised label propagation, label propagation as optimization, bipartite graphs
+
* Tues Mar 27. [[Class meeting for 10-605 2012 03 27|Label propagation 2: Unsupervised label propagation, label propagation as optimization, bipartite graphs]]
 
** '''Assignment due: Subsampling and visualizing a graph.'''
 
** '''Assignment due: Subsampling and visualizing a graph.'''
 
** ''New Assignment: mini-project proposals (final version)''
 
** ''New Assignment: mini-project proposals (final version)''
* Thus Mar 29. Understanding spectral clustering techniques.
+
* Thus Mar 29. [[Class meeting for 10-605 2012 03 29|Understanding spectral clustering techniques.]]
 
** '''Assignment due: mini-project proposals (final version).'''
 
** '''Assignment due: mini-project proposals (final version).'''
  
 
== April ==
 
== April ==
  
* Tues Apr 3. LDA-like models for text and graphs.
+
* Tues Apr 3. [[Class meeting for 10-605 2012 04 03|LDA-like models for text and graphs]]; guest lecture from Partha Talukdar
 
* Thus Apr 5. Tentative: Guest lecture by U Kang, CMU.
 
* Thus Apr 5. Tentative: Guest lecture by U Kang, CMU.
* Tues Apr 10. Speeding up LDA-like models: sampling and parallelization
+
* Tues Apr 10. [[Class meeting for 10-605 2012 04 10|Speeding up LDA-like models: sampling and parallelization]]
* Thus Apr 12. Fast KNN and similarity joins 1.
+
* Thus Apr 12. [[Class meeting for 10-605 2012 04 12|Fast KNN and similarity joins 1.]]
* Tues Apr 17. Fast KNN and similarity joins 2.
+
* Tues Apr 17. [[Class meeting for 10-605 2012 04 17|Fast KNN and similarity joins 2.]]
 
* Thus Apr 19. ''no class - Carnival''
 
* Thus Apr 19. ''no class - Carnival''
* Tues Apr 24. Online LDA
+
* Tues Apr 24. [[Class meeting for 10-605 2012 04 14|SGD for matrix factorization and online LDA]]
* Thus Apr 26. TBD.
+
* Thus Apr 26. [[Class meeting for 10-605 2012 04 16|Scaling up decision tree learning]]
  
 
== May ==
 
== May ==
Line 65: Line 65:
 
* Tues May 1. Project reports.
 
* Tues May 1. Project reports.
 
* Thus May 3. Project reports.
 
* Thus May 3. Project reports.
 +
* Fri May 4.
 +
** '''Project writeups due at 5:00pm'''.  Submit a paper to Blackbook in PDF in the [http://icml.cc/2012/author-instructions/ ICML 2012 format] (up to 8pp double column), except, of course, do not submit it anonymously.

Latest revision as of 09:48, 28 March 2013

This is the syllabus for Machine Learning with Large Datasets 10-605 in Spring 2012. If you're taking 10-605 now, you're probably looking for the syllabus for Machine Learning with Large Datasets 10-605 in Spring 2013.

January

February

March

April

May

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