Spectral clustering: Difference between revisions

Revision as of 18:53, 3 May 2014

Revision as of 19:09, 3 May 2014

Line 1:

[[File:K-means v.s. Spectral Clustering.png|thumb|A figure showing the relative strengths of K-means and spectral clustering.<ref>{{Citation

| last = Martin

| first = Charles

| url = http://charlesmartin14.wordpress.com/2012/10/09/spectral-clustering/

| title = Spectral Clustering: A quick overview

| date = October 9, 2012}}</ref>]]

In [[multivariate statistics]] and the [[cluster analysis|clustering]] of data, '''spectral clustering''' techniques make use of the [[Spectrum of a matrix|spectrum]] ([[eigenvalues]]) of the [[similarity matrix]] of the data to perform [[dimensionality reduction]] before clustering in fewer dimensions. The similarity matrix is provided as an input and consists of a quantitative assessment of the relative similarity of each pair of points in the dataset.