University of Cambridge > Talks.cam > Machine Learning @ CUED > Spectral Clustering

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Spectral Clustering

Download to your calendar using vCal

If you have a question about this talk, please contact Shaomian Deng .

Machine Learning Tutorial Lecture

Spectral clustering is a technique for finding group structure in data. It is based on viewing the data points as nodes of a connected graph and clusters are found by partitioning this graph, based on its spectral decomposition, into subgraphs that posses some desirable properties. My plan for this talk is to give a review of the main spectral clustering algorithms, demonstrate their abilities and limitations and offer some insight into when the method can be expected to be successful. No previous knowledge is assumed, and anyone who is interested in clustering (or fun applications of linear algebra) might find this talk interesting.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hardy Building rm101, Downing Site Keynes Hall, Kings College, Cambridge The Smuts Memorial Fund Lecture

Other talks

The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck title abstract tbc Scientific Steering Committee meeting Tea and Coffee Break Title tbc TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity