Subspace clustering based on differential evolution

被引：0

作者：

Bi, Zhi-Sheng ^{[1
]}

Wang, Jia-Hai ^{[1
]}

Yin, Jian ^{[1
]}

机构：

[1] School of Internation Science and Technology, Sun Yat-Sen University

来源：

Jisuanji Xuebao/Chinese Journal of Computers | 2012年 / 35卷 / 10期

关键词：

Differential evolution; Fuzzy clustering; High-dimensional data; Subspace clustering; Text categorization;

D O I：

10.3724/SP.J.1016.2012.02116

中图分类号：

学科分类号：

摘要：

The performance of soft subspace clustering largely depends on the objective function and the search strategy. This paper presents a differential evolution (DE) based algorithm for subspace clustering. In the proposed algorithm, a novel objective function is firstly designed by considering the fuzzy weighting within-cluster compactness and loosening the constraints of dimension weight matrix. Then, a novel membership between a data point and a cluster is proposed. At last, an efficient global search strategy, composite DE, is introduced to optimize the proposed objective function to search subspace clusters. The simulation results show that both the proposed objective function and the introduced DE search strategy contribute to the performance enhancement of soft subspace clustering, and thus the proposed algorithm is significantly better than existing algorithms.

引用

页码：2116 / 2128

页数：12

共 24 条

[1]

Kriegel H.-P., Kroger P., Zimek A., Clustering high dimensional data: A survey on subspace clustering, pattern based clustering, and correlation clustering, ACM Transactions on Knowledge Discovery from Data, 3, 1, pp. 1-58, (2009)

[2]

Moise G., Zimek A., Kroger P., Kriegel H.-P., Sander J., Subspace and projected clustering: Experimental evaluation and analysis, Knowledge and Information Systems, 21, 3, pp. 299-326, (2009)

[3]

Huang J.Z., Ng M.K., Rong H., Li Z., Automated variable weighting in k -means type clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27, 5, pp. 657-668, (2005)

[4]

Chen L.-F., Guo G.-D., Jiang Q.-S., Adaptive algorithm for soft subspace clustering, Journal of Software, 21, 10, pp. 2513-2523, (2010)

[5]

Jing L., Ng M.K., Huang J.Z., An entropy weighting k -means algorithm for subspace clustering of high-dimensional sparse data, IEEE Transactions on Knowledge and Data Engineering, 19, 8, pp. 1026-1041, (2007)

[6]

Deng Z., Choi K.-S., Chung F.-L., Wang S., Enhanced soft subspace clustering integrating within-cluster and between-cluster information, Pattern Recognition, 43, 3, pp. 767-781, (2010)

[7]

Boongoen T., Shang C., Iam-On N., Shen Q., Extending data reliability measure to a filter approach for soft subspace clustering, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41, 6, pp. 1705-1714, (2011)

[8]

Gan G., Wu J., Yang Z., A fuzzy subspace algorithm for clustering high dimensional data, Advanced Data Mining and Applications, Series Lecture Notes in Computer Science, 4093, pp. 271-278, (2006)

[9]

Friedman J.H., Meulman J.J., Clustering objects on subsets of attributes, Journal of the Royal Statistical Society, 66, pp. 815-849, (2004)

[10]

Jing L., Ng M., Xu J., Huang J., Subspace clustering of text documents with feature weighting k -means algorithm, Advances in Knowledge Discovery and Data Mining, Series, 3518, pp. 802-812, (2005)

← 1 2 3 →