arrow
返回

Self-representation based dual-graph regularized feature selection clustering

delete2016-01-01
delete70
PRE
AI
R
Ronghua Shang *
Z
Zhu Zhang
L
Licheng Jiao
C
Chiyang Liu
Y
Yangyang Li
DOI:10.1016/j.neucom.2015.07.068delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Dual-graph
Self-representation
Feature selection
Clustering
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

X
Xidian University
学者数:
2.4W
论文数: 1.9W
被引数: 9.7K
引用论文

引用论文

Evolution of structural and optical properties of photocatalytic Fe doped TiO2 thin films prepared by RF magnetron sputtering
err2014-01-01
err0
PREAI
errPrabitha B. Nair; L. V. Maneeshya; V. B. Justinvictor; Georgi P. Daniel; K. Joy; P. V. Thomas
err分享
err收藏
A convenient stereoselective route to novel tetrahydroxyindolizidines
err2002-11-01
err0
PREAI
errAna T. Carmona; José Fuentes; Inmaculada Robina
err分享
err收藏
Ultrasonic instrument for measuring bolt stress
err1984-11-01
err0
PREAI
errS.G. Joshi; R.G. Pathare
err分享
err收藏
学者 查看更多内容