Algorithms Seminar/Spring09
From ResearchWiki
(Difference between revisions)
(→Schedule) |
|||
| Line 57: | Line 57: | ||
| colspan="3" bgcolor="#dddddd" style = "text-align:center" | '''Clustering as model building''' | | colspan="3" bgcolor="#dddddd" style = "text-align:center" | '''Clustering as model building''' | ||
|- | |- | ||
| - | | Feb 27 || [http:// | + | | Feb 27 || [http://www.cise.ufl.edu/class/cap6610sp07/mix_gauss.pdf Gaussian Mixture Models and EM], [http://www.cse.ucsd.edu/~dasgupta/papers/em.ps a two-round variant for Gaussians] || Piyush |
|- | |- | ||
| Mar 6 || Information-theoretic clustering: [http://en.wikipedia.org/wiki/Information_bottleneck_method IB], [http://www.cs.cmu.edu/~jypan/publications/kdd06RIC.pdf RIC]|| Arvind | | Mar 6 || Information-theoretic clustering: [http://en.wikipedia.org/wiki/Information_bottleneck_method IB], [http://www.cs.cmu.edu/~jypan/publications/kdd06RIC.pdf RIC]|| Arvind | ||
Revision as of 06:10, 1 March 2009
Spring 2009: CS 7936: Clustering
Fri 10:45 - 12:05 | WEB 1460
Contents |
Course Materials
Seminar format and grading
- Student presentations on material selected by me. Please read, reflect upon, and follow these presentation guidelines
- One week before presentation is scheduled: student meets with me to discuss content of the presentation
- Day before presentation: student submits summary (either notes, or slides for presentation)
- Day before presentation: non-presenters submit questions on the material
- Day after presentation: questions are addressed by presenter or questioner (on the wiki talk page)
Participants
- Suresh Venkatasubramanian, Assistant Professor, School of Computing
- Parasaran Raman, PhD Student, School of Computing
- John Moeller, PhD Student, School of Computing
- Nathan Gilbert, PhD Student, School of Computing
- Raj Varma Kommaraju, MS Student, School of Computing
- Ruihong Huang, PhD Student, School of Computing
- Hal Daumé III, Assistant Professor, School of Computing
- Arvind Agarwal, PhD Student, School of Computing
- Adam R. Teichert, MS Student, School of Computing
- Piyush Rai, PhD Student, School of Computing
- Jagadeesh Jagarlamudi, PhD Student, School of Computing
- Seth Juarez, PhD Student, School of Computing
- Jiarong Jiang, PhD Student, School of Computing
- Scott Alfeld, MS Student, School of Computing
- Thanh Nguyen, PhD Student, School of Computing
- John Meier, BS/MS Student, School of Computing
- Amit Goyal, PhD Student, School of Computing
- Pravin Chandrasekaran, MS Student, School of Computing
- Avishek Saha, PhD Student, School of Computing
Schedule
Topics Not Covered
- Clustering with differently shaped clusters (subspace/projective clustering)
- methods for soft clustering
- high and low dimensional approximation schemes for clustering problems.
- manifold clustering
- "reclustering": given a clustering, find a new one that has some relationship to it.
- biclustering (or co-clustering): cluster the rows and columns of a matrix.
- Clustering with Outliers
Useful Links
NIPS 2005 workshop on Theoretical Foundations of Clustering
Paper Summaries
Past Semesters
- Fall 2007: Approximate High Dimensional Geometry
- Spring 2008: The Geometry of Information Spaces
- Fall 2008: Randomization