A New Spectral Clustering Algorithm

by   W. R. Casper, et al.
Los Alamos National Laboratory
Louisiana State University

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, spectral-KMEANS, and an agglomerative method) in the context of the Lancichinetti-Fortunato-Radicchi (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.


page 8

page 10


Spectral clustering algorithm for the allometric extension model

The spectral clustering algorithm is often used as a binary clustering m...

Spectral Convergence Rate of Graph Laplacian

Laplacian Eigenvectors of the graph constructed from a data set are used...

Spectral Clustering and Block Models: A Review And A New Algorithm

We focus on spectral clustering of unlabeled graphs and review some resu...

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs

We propose a novel robust decentralized graph clustering algorithm that ...

Covariate-assisted Spectral Clustering in Dynamic Networks

In this paper, we study the community detection problem in the dynamic s...

A Topological Approach to Spectral Clustering

We propose a clustering algorithm which, for input, takes data assumed t...

EasiCS: the objective and fine-grained classification method of cervical spondylosis dysfunction

The precise diagnosis is of great significance in developing precise tre...

Please sign up or login with your details

Forgot password? Click here to reset