.png){kind=icon}
返回
Co-regularized unsupervised feature selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2017.11.061.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Unsupervised feature selection (UFS) is very challenging due to the lack of label information. Most UFS methods generate pseudo labels by spectral clustering, matrix factorization or dictionary learning, and convert UFS into a supervised feature selection problem. Generally, the features that can preserve the data distribution (i.e., cluster indicator matrix) should be selected. Under the matrix factorization framework, when the cluster indicator matrix is orthogonal, the cluster base (center) matrix can be used to select features that well reconstruct the data. However, almost all the UFS algorithms only select features that can either well preserve the cluster structure or reconstruct the data. In this paper, we propose a novel co-regularized unsupervised feature selection (CUFS) algorithm. Joint l(2,1)-norm co-regularization is imposed on multiple feature selection matrices to ensure that the selected features can both preserve data distribution and data reconstruction. Extensive experiments on benchmark datasets show that CUFS is superior to the state-of-the-art UFS algorithms. (c) 2017 Elsevier B.V. All rights reserved.
Keyword:
Feature selection
Co-regularized learning
Data distribution
Data reconstruction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏Cluster structure preserving unsupervised feature selection for multi-view tasks.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容