A New Spectral Clustering Algorithm
This topic contains 0 replies, has 1 voice, and was last updated by arXiv 1 year, 1 month ago.

A New Spectral Clustering Algorithm
We present a new clustering algorithm that is based on searching for natural gaps in the components of the lowest energy eigenvectors of the Laplacian of a graph. In comparing the performance of the proposed method with a set of other popular methods (KMEANS, spectralKMEANS, and an agglomerative method) in the context of the LancichinettiFortunatoRadicchi (LFR) Benchmark for undirected weighted overlapping networks, we find that the new method outperforms the other spectral methods considered in certain parameter regimes. Finally, in an application to climate data involving one of the most important modes of interannual climate variability, the El Nino Southern Oscillation phenomenon, we demonstrate the ability of the new algorithm to readily identify different flavors of the phenomenon.
A New Spectral Clustering Algorithm
by W. R. Casper, Balu Nadiga
https://arxiv.org/pdf/1710.02756v1.pdf
You must be logged in to reply to this topic.