Log In Sign Up

A Model-Based Approach to Rounding in Spectral Clustering

by   Leonard K. M. Poon, et al.

In spectral clustering, one defines a similarity matrix for a collection of data points, transforms the matrix to get the Laplacian matrix, finds the eigenvectors of the Laplacian matrix, and obtains a partition of the data using the leading eigenvectors. The last step is sometimes referred to as rounding, where one needs to decide how many leading eigenvectors to use, to determine the number of clusters, and to partition the data points. In this paper, we propose a novel method for rounding. The method differs from previous methods in three ways. First, we relax the assumption that the number of clusters equals the number of eigenvectors used. Second, when deciding the number of leading eigenvectors to use, we not only rely on information contained in the leading eigenvectors themselves, but also use subsequent eigenvectors. Third, our method is model-based and solves all the three subproblems of rounding using a class of graphical models called latent tree models. We evaluate our method on both synthetic and real-world data. The results show that our method works correctly in the ideal case where between-clusters similarity is 0, and degrades gracefully as one moves away from the ideal case.


Dual regularized Laplacian spectral clustering methods on community detection

Spectral clustering methods are widely used for detecting clusters in ne...

Incremental Method for Spectral Clustering of Increasing Orders

The smallest eigenvalues and the associated eigenvectors (i.e., eigenpai...

Fast Spectral Clustering Using Autoencoders and Landmarks

In this paper, we introduce an algorithm for performing spectral cluster...

Construction of the similarity matrix for the spectral clustering method: numerical experiments

Spectral clustering is a powerful method for finding structure in a data...

Regularized Non-negative Spectral Embedding for Clustering

Spectral Clustering is a popular technique to split data points into gro...

Separating populations with wide data: A spectral analysis

In this paper, we consider the problem of partitioning a small data samp...

Spectral Clustering, Spanning Forest, and Bayesian Forest Process

Spectral clustering algorithms are very popular. Starting from a pairwis...