DocumentCode
518513
Title
Research on Spectral Clustering algorithms and prospects
Author
Ding, Shifei ; Zhang, Liwen ; Zhang, Yu
Author_Institution
Sch. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China
Volume
6
fYear
2010
fDate
16-18 April 2010
Abstract
Along with the expansion and in-depth of the application domain of cluster analysis, one kind of new cluster algorithm called Spectral Clustering algorithm has been aroused great concern by scholars, Spectral Clustering algorithm is newly developing technique in the field of machine learning in recent years. Unlike the traditional clustering algorithms, this can solve the clustering of non-convex sphere of sample spaces and has globally optimal solution. This paper introduces the principle, the induction summary to the current research situation of Spectral Clustering algorithm as well as in various application domains. Firstly, the analysis and induction of some Spectral Clustering algorithms have been made from several aspects, such as the ideas of algorithm, key technology, advantage and disadvantage. On the other hand, some typical Spectral Clustering algorithms have been selected to analyze and compare. Finally, it points out the key problems and future directions.
Keywords
graph theory; learning (artificial intelligence); pattern clustering; cluster analysis; graph partition; machine learning; nonconvex sphere clustering; spectral clustering algorithm; Algorithm design and analysis; Clustering algorithms; Computer science; Data analysis; Electronic mail; Information analysis; Laplace equations; Machine learning; Machine learning algorithms; Partitioning algorithms; Laplacian Matri; cluster analysis; eigenvalue; graph partition; spectral clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6347-3
Type
conf
DOI
10.1109/ICCET.2010.5486345
Filename
5486345
Link To Document