Computer Science ›› 2014, Vol. 41 ›› Issue (2): 240-244.

Previous Articles     Next Articles

Multiple Local Adaptive Soft Subspace Clustering Ensemble Based on Multimodal Perturbation

WANG Li-juan,HAO Zhi-feng,CAI Rui-chu and WEN Wen   

  • Online:2018-11-14 Published:2018-11-14

Abstract: This paper proposed multiple local adaptive soft subspace clustering (LAC) ensemble (MLACE) based on multimodal perturbation.There are three merits in the proposed MLACE.Firstly,MLACE combines diversity and complement decisions generated by random initialization,parameter perturbation and feature subspace projection,so as to improve the accuracy of clustering.Secondly,the clustering ensemble information is refined.The probability of each instance belonging to all clusters is defined according to the subspace weight matrix from LAC.Thirdly,because the clustering ensemble information is refined from 0/1binary value into [0,1]real value,the consensus function in clustering ensemble can adopt real valued clustering ensemble method Fast global K means,which can further improve the accuracy of clustering ensemble.Two synthetic datasets and five UCI datasets were chosen to evaluate the accuracy of MLACE.The experiment results show that MLACE is more accurate than K-means,LAC,Multiple LAC clustering ensemble based on parameter perturbation (P-MLACE).

Key words: Clustering ensemble,Soft subspace clustering,Local adaptive soft subspace clustering,Multimodal perturbation

[1] Kriegel H P,Kroger P,Zimek A.Clustering High-Dimensional Data:A Survey on Subspace Clustering,Pattern-Based Clustering,and Correlation Clustering [J].ACM Transactions on Knowledge Discovery from Data,2009,3(1):1-58
[2] Parsons L,Haque E,Liu H.Subspace Clustering for High Dimensional Data:A Review [J].ACM SIGKDD Explorations New-sletter-Special issue on learning from imbalanaced datasets,2004,6(1):90-105
[3] Huang J Z.Automated variable weighting in K-means type clustering [J].IEEE Trans.on Pattern Analysis and Machine Intelligence,2005,27(5):657-668
[4] Gan G,Wu J.A convergence theorem for the fuzzy subspaceclustering (FSC) algorithm [J].Pattern Recognition,2008,41(6):1939-1947
[5] Domeniconi C.Locally adaptive metrics fore clustering high dimensional data [J].Data mining knowledge discovery,2007,14:63-97
[6] Jing L P.An entropy weighting K-means algorithm for subspace clustering of high dimensional sparse data [J].IEEE Trans.on Knowledge and Data Engineering,2007,19(8):1026-1041

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!