Large margin subspace learning for feature selection

DOI10.1016/j.patcog.2013.02.012zbMath1323.68458OpenAlexW2071906288MaRDI QIDQ888576

Zhenghong Huang, Xin-Wang Liu, Bo Liu, Jie Chen, Bin Fang, Xi-Ping He

Publication date: 2 November 2015

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2013.02.012

zbMATH Keywords

subspace learning\(\ell_{ 21}\)-norm regularizationlarge margin maximization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (4)

Subspace learning for unsupervised feature selection via matrix factorization ⋮ Greedy approaches to semi-supervised subspace learning ⋮ Supervised distance metric learning through maximization of the Jeffrey divergence ⋮ A centroid-based gene selection method for microarray data classification

Uses Software

• LMNN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dimensionality reduction by mixed kernel canonical correlation analysis
• Self-taught dimensionality reduction on the high-dimensional small-sized data
• Graph optimization for dimensionality reduction with sparsity constraints
• Supervised feature selection by clustering using conditional mutual information-based distances
• Wrappers for feature subset selection
• Theoretical and empirical analysis of ReliefF and RReliefF
• Stochastic margin-based structure learning of Bayesian network classifiers
• Optimal feature selection for support vector machines
• Choosing multiple parameters for support vector machines
• Gene selection for cancer classification using support vector machines

This page was built for publication: Large margin subspace learning for feature selection