Co-regularized unsupervised feature selection

Pengfei Zhu

doi:10.1016/j.neucom.2017.11.061

Return

Co-regularized unsupervised feature selection

2018-01-01

PRE

DOI：10.1016/j.neucom.2017.11.061

Original

Original request for help

Save

Abstract

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.

Keywords:

Feature selection

Co-regularized learning

Data distribution

Data reconstruction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.