Bagging-based spectral clustering ensemble selection

被引:79
作者
Jia, Jianhua [1 ]
Xiao, Xuan [1 ]
Liu, Bingxiang [1 ]
Jiao, Licheng [2 ,3 ]
机构
[1] Jingdezhen Ceram Inst, Sch Informat Engn, Jingdezhen 333002, Jiangxi, Peoples R China
[2] Xidian Univ, Key Lab Intelligent Percept & Image Understanding, Minist Educ China, Xian 710071, Peoples R China
[3] Xidian Univ, Inst Intelligent Informat Proc, Xian 710071, Peoples R China
关键词
Spectral clustering; Selective clustering ensembles; Bagging; Normalized mutual information (NMI); Adjusted rand index (ARI);
D O I
10.1016/j.patrec.2011.04.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional clustering ensemble methods combine all obtained clustering results at hand. However, we can often achieve a better clustering solution if only parts of the clustering results available are combined. In this paper, we generalize the selective clustering ensemble algorithm proposed by Azimi and Fern and a novel clustering ensemble method, SELective Spectral Clustering Ensemble (SELSCE), is proposed. The component clusterings of the ensemble system are generated by spectral clustering (SC) capable of engendering diverse committees. The random scaling parameter, Nystrom approximation are used to perturb SC for producing the components of the ensemble system. After the generation of component clusterings, the bagging technique, usually applied in supervised learning, is used to assess the component clustering. We randomly pick part of the available clusterings to get a consensus result and then compute normalized mutual information (NMI) or adjusted rand index (ARI) between the consensus result and the component clusterings. Finally, the components are ranked by aggregating multiple NMI or ARI values. The experimental results on UCI dataset and images demonstrate that the proposed algorithm can achieve a better result than the traditional clustering ensemble methods. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:1456 / 1467
页数:12
相关论文
共 42 条
[1]  
ALPERT CJ, 1995, DES AUT CON, P195
[2]  
[Anonymous], P 20 INT C MACH LEAR
[3]  
[Anonymous], 2000, Pattern Classification
[4]  
Azimi J, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P992
[5]  
Bach F., 2005, NIPS, P65
[6]  
Banfield R. E., 2005, Information Fusion, V6, P49, DOI 10.1016/j.inffus.2004.04.005
[7]  
Blake C. L., 1998, Uci repository of machine learning databases
[8]  
Breiman L, 1996, MACH LEARN, V24, P123, DOI 10.1023/A:1018054314350
[9]  
Dietterich TG, 1997, AI MAG, V18, P97
[10]   A min-max cut algorithm for graph partitioning and data clustering [J].
Ding, CHQ ;
He, XF ;
Zha, HY ;
Gu, M ;
Simon, HD .
2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, :107-114