Comparison of Spectral Clustering Methods

Deepak Kumar Verma · 2015

We take apart, combine and compare on real and artificial data the features of the four best-known spectral clustering algorithms. We find that the algorithms behave more similarly then expected, especially if the data are near a case called perfect, where three of the algorithms are equivalent.

Read the paper · More papers on PaperTik