DocumentCode
523563
Title
Automatic Spectral Clustering and its Application
Author
Kong, Wanzeng ; Sun, Changsihe ; Hu, Sanqing ; Zhang, Jianhai
Author_Institution
Coll. of Comput. Sci., Hangzhou Dianzi Univ., Hangzhou, China
Volume
1
fYear
2010
fDate
11-12 May 2010
Firstpage
841
Lastpage
845
Abstract
An new algorithm called automatic spectral clustering (ASC) is proposed based on eigengap and orthogonal eigenvector in this paper. It mainly focuses on how to automatically determine the suitable class number in clustering and explores some intrinsic characteristics of the spectral clustering method. The proposed method firstly constructs the affinity matrix of data and carries on eigen-decomposition, then determine the class number according to the eigengap. Finally, the data are classified by employing the angle between two eigenvectors. The experiments on the real-world data sets from UCI and applications in face location show the correctness and efficiency of the proposed method.
Keywords
eigenvalues and eigenfunctions; matrix algebra; pattern clustering; ASC; affinity matrix; automatic spectral clustering; eigen decomposition; intrinsic characteristics; orthogonal eigenvector; Algorithm design and analysis; Application software; Automation; Clustering algorithms; Clustering methods; Computer science; Eigenvalues and eigenfunctions; Face detection; Laplace equations; Symmetric matrices; affinity matrix; eigengap; orthogonal; spectral clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4244-7279-6
Electronic_ISBN
978-1-4244-7280-2
Type
conf
DOI
10.1109/ICICTA.2010.164
Filename
5522605
Link To Document