Self-representation based dual-graph regularized feature selection clustering

详细信息    查看全文

• 作者：Ronghua Shang ; ^{rhshang@mail.xidian.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Zhu ZhangAuthor Vitae ; Licheng JiaoAuthor Vitae ; Chiyang Liu ; Yangyang Li
• 关键词：Dual-graph ; Self-representation ; Feature selection ; Clustering
• 刊名：Neurocomputing
• 出版年：2016
• 出版时间：1 January 2016
• 年：2016
• 卷：171
• 期：Complete
• 页码：1242-1253
• 全文大小：1575 K

文摘

Feature selection algorithms eliminate irrelevant and redundant features, even the noise, while preserving the most representative features. They can reduce the dimension of the dataset, extract essential features in high dimensional data and improve learning quality. Existing feature selection algorithms are all carried out in data space. However, the information of feature space cannot be fully exploited. To compensate for this drawback, this paper proposes a novel feature selection algorithm for clustering, named self-representation based dual-graph regularized feature selection clustering (DFSC). It adopts the self-representation property that data can be represented by itself. Meanwhile, the local geometrical information of both data space and feature space are preserved simultaneously. By imposing the l_2,1-norm constraint on the self-representation coefficients matrix in data space, DFSC can effectively select the most representative features for clustering. We give the objective function, develop iterative updating rules and provide the convergence proof. Two kinds of extensive experiments on some datasets demonstrate the effectiveness of DFSC. Extensive comparisons over several state-of-the-art feature selection algorithms illustrate that additionally considering the information of feature space based on self-representation property improves clustering quality. Meanwhile, because the additional feature selection process can select the most important features to preserve the intrinsic structure of dataset, the proposed algorithm achieves better clustering results compared with some co-clustering algorithms.