A spectral clustering algorithm based on self-adaption

Kan Li*, Yu Shu Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

In traditional spectral clustering algorithms, the number of cluster is choosen in advance. A self-adaption spectral clustering algorithm is proposed to decide the cluster number automatically, which eliminates the drawbacks of two kinds of spectral clustering methods. In our algorithm, eigengap is used to discover the clustering stability and decide the cluster number automatically. We prove theoretically the rationality of cluster number using matrix perturbation theory. A kernel based fuzzy c-means is introduced to spectral clustering algorithm to separate clusters. Finally the experiments prove that our algorithm tested in the UCI data sets may get better results than c-means, Ng et.al's algorithm and Francesco et.al's algorithm.

Original languageEnglish
Title of host publicationProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Pages3965-3968
Number of pages4
DOIs
Publication statusPublished - 2007
Event6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 - Hong Kong, China
Duration: 19 Aug 200722 Aug 2007

Publication series

NameProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Volume7

Conference

Conference6th International Conference on Machine Learning and Cybernetics, ICMLC 2007
Country/TerritoryChina
CityHong Kong
Period19/08/0722/08/07

Keywords

  • Eigengap
  • Kernel
  • Spectral clustering

Fingerprint

Dive into the research topics of 'A spectral clustering algorithm based on self-adaption'. Together they form a unique fingerprint.

Cite this