Discriminative and Uncorrelated Feature Selection With Constrained Spectral Analysis in Unsupervised Learning

Research output: Contribution to journalArticlepeer-review

64 Scopus citations

Abstract

The existing unsupervised feature extraction methods frequently explore low-redundant features by an uncorrelated constraint. However, the constrained models might incur trivial solutions, due to the singularity of scatter matrix triggered by high-dimensional data. In this paper, we propose a regularized regression model with a generalized uncorrelated constraint for feature selection, which leads to three merits: 1) exploring the low-redundant and discriminative features; 2) avoiding the trivial solutions and 3) simplifying the optimization. Besides that, the local cluster structure is achieved via a novel constrained spectral analysis for the unsupervised learning, where Must-Links and Cannot-Links are transformed into a intrinsic graph and a penalty graph respectively, rather than incorporated into a mixed affinity graph. Accordingly, a discriminative and uncorrelated feature selection with constrained spectral analysis (DUCFS) is proposed with adopting σ-norm regularization for interpolating between F-norm and ℓ2,1-norm. Due to the flexible gradient and global differentiability, our model converges fast. Extensive experiments on benchmark datasets among several state-of-the-art approaches verify the effectiveness of the proposed method.

Original languageEnglish
Article number8884662
Pages (from-to)2139-2149
Number of pages11
JournalIEEE Transactions on Image Processing
Volume29
Issue number1
DOIs
StatePublished - 2020

Keywords

  • Discriminative and uncorrelated feature selection
  • constrained spectral analysis
  • generalized uncorrelated constraint
  • relaxed regularization term
  • unsupervised learning

Fingerprint

Dive into the research topics of 'Discriminative and Uncorrelated Feature Selection With Constrained Spectral Analysis in Unsupervised Learning'. Together they form a unique fingerprint.

Cite this