Flexible non-greedy discriminant subspace feature extraction
DOI10.1016/j.neunet.2019.04.006zbMath1434.68489OpenAlexW2938445917WikidataQ91825139 ScholiaQ91825139MaRDI QIDQ2183679
Xubing Yang, Henghao Zhao, Qiaolin Ye, Liyong Fu, Zhangjing Yang, Zhi-Gang Gao
Publication date: 27 May 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2019.04.006
\(L_1\)-norm-based non-greedy discriminant analysis\(L_p\)-norm inter-class dispersionintra-class dispersionrobust distance measurement
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
- Robust L1-norm two-dimensional linear discriminant analysis
- $\ell _{2,p}$ -Norm Based PCA for Image Recognition
- A Non-Greedy Algorithm for L1-Norm LDA
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Linear Discriminant Analysis Based on L1-Norm Maximization
This page was built for publication: Flexible non-greedy discriminant subspace feature extraction