Spectral Clustering with Smooth Tiny Clusters

by   Hengrui Wang, et al.

Spectral clustering is one of the most prominent clustering approaches. The distance-based similarity is the most widely used method for spectral clustering. However, people have already noticed that this is not suitable for multi-scale data, as the distance varies a lot for clusters with different densities. State of the art(ROSC and CAST ) addresses this limitation by taking the reachability similarity of objects into account. However, we observe that in real-world scenarios, data in the same cluster tend to present in a smooth manner, and previous algorithms never take this into account. Based on this observation, we propose a novel clustering algorithm, which con-siders the smoothness of data for the first time. We first divide objects into a great many tiny clusters. Our key idea is to cluster tiny clusters, whose centers constitute smooth graphs. Theoretical analysis and experimental results show that our clustering algorithm significantly outperforms state of the art. Although in this paper, we singly focus on multi-scale situations, the idea of data smoothness can certainly be extended to any clustering algorithms



There are no comments yet.


page 1

page 2

page 3

page 4


KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

Clustering analysis has been widely used in trust evaluation on various ...

Spectral clustering based on local linear approximations

In the context of clustering, we assume a generative model where each cl...

An Automated Spectral Clustering for Multi-scale Data

Spectral clustering algorithms typically require a priori selection of i...

Clustering evolving data using kernel-based methods

In this thesis, we propose several modelling strategies to tackle evolvi...

Non-parametric Power-law Data Clustering

It has always been a great challenge for clustering algorithms to automa...

Differential Performance Debugging with Discriminant Regression Trees

Differential performance debugging is a technique to find performance pr...

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

The precise diagnosis is of great significance in developing precise tre...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.