PPT-Lecture 21: Spectral Clustering

April 22 2010 Last Time GMM Model Adaptation MAP Maximum A Posteriori MLLR Maximum Likelihood Linear Regression UMB MAP for speaker recognition Today Graph Based Clustering Minimum Cut. Gregory Moore, Rutgers University. Caltech, March, 2012. Davide. . Gaiotto. , G.M. , Andy . Neitzke. Spectral Networks and Snakes, . Spectral Networks, . Wall-crossing in Coupled 2d-4d Systems: 1103.2598. Jeffrey W. . Mirick. , PhD. .. SPIE – Defense, Security, and Sensing Conference - 2010. 8. April 2010. Gas-Phase Databases for Quantitative Infrared Spectroscopy. STEVEN W. SHARPE,* TIMOTHY J. JOHNSON, ROBERT L. SAMS,. The First Step in Quantitative Spectral Analysis. Richard Gray. Appalachian State University. MK Spectral Classification: 1943 – 2013. 70 years of contributions to stellar astronomy. Discovery of the spiral structure of the Galaxy (Morgan, . K. -means. David Kauchak. CS 451 – Fall 2013. Administrative. Final project. Presentations on Friday. 3 minute max. 1-2 PowerPoint slides. E-mail me by 9am on Friday. What problem you tackled and results. E. Tognoli, . october. 9. th. , 2008, HBBL meeting. Peaks~floor. floor. peak. Interim question 1: why are there more peaks . in structured behavioral tasks? . Steady-State paradigms and structured behavioral tasks. Frank Lin. 10-710 Structured Prediction. School of Computer Science. Carnegie Mellon . University. 2011-11-28. Talk Outline. Clustering. Spectral Clustering. Power Iteration Clustering (PIC). PIC with Path Folding. biotissues. D.A. Loginova. 1,2. , E.A. Sergeeva. 1. , P.D. Agrba. 2. , . and M. Yu. Kirillin. 1. 1 . Institute of Applied Physics RAS, Nizhny Novgorod, Russia. 2 . Lobachevsky. State University of Nizhny Novgorod, Nizhny Novgorod, Russia. Sushmita Roy. sroy@biostat.wisc.edu. Computational Network Biology. Biostatistics & Medical Informatics 826. Computer Sciences 838. https://compnetbiocourse.discovery.wisc.edu. Nov 3. rd. , Nov 10. biotissues. D.A. Loginova. 1,2. , E.A. Sergeeva. 1. , P.D. Agrba. 2. , . and M. Yu. Kirillin. 1. 1 . Institute of Applied Physics RAS, Nizhny Novgorod, Russia. 2 . Lobachevsky. State University of Nizhny Novgorod, Nizhny Novgorod, Russia. What is clustering?. Why would we want to cluster?. How would you determine clusters?. How can you do this efficiently?. K-means Clustering. Strengths. Simple iterative method. User provides “K”. 1. Mark Stamp. K-Means for Malware Classification. Clustering Applications. 2. Chinmayee. . Annachhatre. Mark Stamp. Quest for the Holy . Grail. Holy Grail of malware research is to detect previously unseen malware. Produces a set of . nested clusters . organized as a hierarchical tree. Can be visualized as a . dendrogram. A . tree-like . diagram that records the sequences of merges or splits. Strengths of Hierarchical Clustering. Log. 2. transformation. Row centering and normalization. Filtering. Log. 2. Transformation. Log. 2. -transformation makes sure that the noise is independent of the mean and similar differences have the same meaning along the dynamic range of the values.. Randomization tests. Cluster Validity . All clustering algorithms provided with a set of points output a clustering. How . to evaluate the “goodness” of the resulting clusters?. Tricky because .