JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2013, Vol. 43 ›› Issue (2): 35-41.

• Articles • Previous Articles     Next Articles

Eigenvector selection in spectral clustering based on Bagging

WANG Xing-liang, WANG Li-hong*, LI Hai-jun   

  1. School of Computer Science & Technology, Yantai University, Yantai 264005, China
  • Received:2012-10-12 Online:2013-04-20 Published:2012-10-12

Abstract:

For the spectral clustering algorithm, the largest k eigenvectors of the affinity matrix derived from the dataset were not always able to find the structure of dataset effectively. An eigenvector selection algorithm in spectral clustering based on Bagging was proposed in order to select better eigenvectors. The  eigenvectors were evaluated by pairwise constraints score. First, some eigenvectors were ranked according to their constraint scores, and then the suitable eigenvectors were selected from the ranking list, finally the optimal combination of k eigenvectors was obtained by Baggingbased ensemble algorithm. The better eigenvectors could be achieved. Experimental results on UCI benchmark datasets showed that this algorithm could gain satisfactory prediction results.

Key words: eigenvector selection, spectral clustering, constraint score, Laplacian matrix, Bagging method

CLC Number: 

  • TP301
[1] PANG Renming, WANG Bo, YE Hao, ZHANG Haifeng, LI Mingliang. Clustering of blast furnace historical data based on PCA similarity factor and spectral clustering [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2017, 47(5): 143-149.
[2] FAN Shuyan, DING Shifei. An improved multi-scale Graph cut algorithm [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2016, 46(1): 28-33.
[3] BO De-Yun, ZHANG Dao-Jiang. Adaptive spectral clustering algorithm [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2009, 39(5): 22-26.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!