Unified Spectral Clustering with Optimal Graph

11/12/2017
by   Zhao Kang, et al.
0

Spectral clustering has found extensive use in many areas. Most traditional spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretizing the learned labels by k-means clustering. Such common practice has two potential flaws, which may lead to severe information loss and performance degradation. First, predefined similarity graph might not be optimal for subsequent clustering. It is well-accepted that similarity graph highly affects the clustering results. To this end, we propose to automatically learn similarity information from data and simultaneously consider the constraint that the similarity matrix has exact c connected components if there are c clusters. Second, the discrete solution may deviate from the spectral solution since k-means method is well-known as sensitive to the initialization of cluster centers. In this work, we transform the candidate solution into a new one that better approximates the discrete one. Finally, those three subtasks are integrated into a unified framework, with each subtask iteratively boosted by using the results of the others towards an overall optimal solution. It is known that the performance of a kernel method is largely determined by the choice of kernels. To tackle this practical problem of how to select the most suitable kernel for a particular data set, we further extend our model to incorporate multiple kernel learning ability. Extensive experiments demonstrate the superiority of our proposed method as compared to existing clustering approaches.

READ FULL TEXT
research
05/01/2017

Twin Learning for Similarity and Clustering: A Unified Kernel Approach

Many similarity-based clustering methods work in two separate steps incl...
research
04/25/2019

Discrete Optimal Graph Clustering

Graph based clustering is one of the major clustering methods. Most of i...
research
04/30/2022

Understanding the Generalization Performance of Spectral Clustering Algorithms

The theoretical analysis of spectral clustering mainly focuses on consis...
research
10/17/2019

A Unified Framework for Tuning Hyperparameters in Clustering Problems

Selecting hyperparameters for unsupervised learning problems is difficul...
research
09/24/2009

Initialization Free Graph Based Clustering

This paper proposes an original approach to cluster multi-component data...
research
07/23/2008

Data spectroscopy: Eigenspaces of convolution operators and clustering

This paper focuses on obtaining clustering information about a distribut...
research
03/14/2019

Low-rank Kernel Learning for Graph-based Clustering

Constructing the adjacency graph is fundamental to graph-based clusterin...

Please sign up or login with your details

Forgot password? Click here to reset