Dual graph regularized compact feature representation for unsupervised feature selection

Shaoyong Li; Chang Tang; Xinwang Liu; Yaping Liu; Jiajia Chen

doi:10.1016/j.neucom.2018.11.060

ScienceGate Book Chapters

JOURNAL ARTICLE

Dual graph regularized compact feature representation for unsupervised feature selection

Shaoyong Li Chang Tang Xinwang Liu Yaping Liu Jiajia Chen

Year: 2018 Journal: Neurocomputing Vol: 331 Pages: 77-96 Publisher: Elsevier BV

DOI: 10.1016/j.neucom.2018.11.060

Get Full-Text PDF Get Analytical Report

Keywords:

Pattern recognition (psychology) Feature learning Feature selection Artificial intelligence Computer science Dimensionality reduction Subspace topology Feature (linguistics) Graph Regularization (linguistics) Representation (politics) Curse of dimensionality Laplacian matrix Sparse approximation Machine learning Theoretical computer science

Metrics

Cited By

1.88

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Face and Expression Recognition

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Advanced Computing and Algorithms

Social Sciences → Social Sciences → Urban Studies

Machine Learning and ELM

Physical Sciences → Computer Science → Artificial Intelligence

Dual graph regularized compact feature representation for unsupervised feature selection

Metrics

Citation History

Topics

Related Documents

Unsupervised Feature Selection with Graph Regularized Nonnegative Self-representation

Robust graph regularized unsupervised feature selection

Self-representation based dual-graph regularized feature selection clustering

Graph Regularized Autoencoder-Based Unsupervised Feature Selection

Unsupervised feature selection by regularized self-representation