Unsupervised feature selection by regularized matrix factorization

doi:10.1016/j.neucom.2017.08.047

Unsupervised feature selection by regularized matrix factorization

2018-01-01

49

PRE

AI

DOI：10.1016/j.neucom.2017.08.047

Original

Original request for help

Save

Abstract

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.

Keywords:

Dimensionality reduction

Feature selection

Matrix factorization

Sparsity and redundancy

Unsupervised feature selection by regularized matrix factorization

Abstract

AI Summary

Journal

Organization