Graph-regularized feature selection based on spectral learning and subspace learning

Licheng Jiao; Ronghua Shang; Fang Liu; Weitong Zhang

doi:10.1016/b978-0-12-819795-0.00010-4

ScienceGate Book Chapters

BOOK-CHAPTER

Graph-regularized feature selection based on spectral learning and subspace learning

Licheng Jiao Ronghua Shang Fang Liu Weitong Zhang

Year: 2020 Elsevier eBooks Pages: 351-385 Publisher: Elsevier BV

DOI: 10.1016/b978-0-12-819795-0.00010-4

Get Full-Text PDF Get Analytical Report

Keywords:

Feature selection Subspace topology Feature learning Artificial intelligence Exploit Pattern recognition (psychology) Graph Graph embedding Computer science Embedding Feature (linguistics) Minimum redundancy feature selection Dimensionality reduction Feature vector Machine learning Theoretical computer science

Metrics

Cited By

0.37

FWCI (Field Weighted Citation Impact)

Refs

0.68

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

Gene expression and cancer classification

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Graph-regularized feature selection based on spectral learning and subspace learning

Metrics

Citation History

Topics

Related Documents

Subspace learning-based graph regularized feature selection

Dual-graph regularized subspace learning based feature selection

Sparse and low-redundant subspace learning-based dual-graph regularized robust feature selection

Non-Negative Spectral Learning and Sparse Regression-Based Dual-Graph Regularized Feature Selection

Dynamic subspace dual-graph regularized multi-label feature selection