返回
Unsupervised feature selection by regularized matrix factorization
DOI:10.1016/j.neucom.2017.08.047.png)
摘要
En 中文
Feature selection is an interesting and challenging task in data analysis process. In this paper, a novel algorithm named Regularized Matrix Factorization Feature Selection (RMFFS) is proposed for unsupervised feature selection. Compared with other matrix factorization based feature selection methods, a main advantage of our algorithm is that it takes the correlation among features into consideration. Through introducing an inner product regularization into our algorithm, the features selected by RMFFS would not only well represent the original high-dimensional data, but also contain low redundancy. Moreover, a simple yet efficient iteratively updating algorithm is also developed to solve the proposed RMFFS. Extensive experimental results on nine real world databases demonstrate that our proposed method can achieve better performance than some state-of-the-art unsupervised feature selection methods. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Dimensionality reduction
Feature selection
Matrix factorization
Sparsity and redundancy
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Subspace learning for unsupervised feature selection via matrix factorization
PATTERN RECOGNITION
IF7.6
Maximum weight and minimum redundancy: A novel framework for feature subset selection
PATTERN RECOGNITION
IF7.6
Singular value decomposition in additive, multiplicative, and logistic forms加法,乘法和逻辑形式的奇异值分解
PATTERN RECOGNITION
IF7.6
Label propagation based semi-supervised non-negative matrix factorization for feature extraction
NEUROCOMPUTING
IF6.5

