Lp- and Ls-norm distance based robust linear discriminant analysis

DOI10.1016/j.neunet.2018.05.020zbMath1440.62401OpenAlexW2808340291WikidataQ89236506 ScholiaQ89236506MaRDI QIDQ2181096

Qiaolin Ye, Meem Naiem, Zhao Zhang, Henghao Zhao, Liyong Fu

Publication date: 18 May 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2018.05.020

zbMATH Keywords

robustnesslinear discriminant analysisLp-normLs-norm

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07)

Related Items (3)

Robust dimensionality reduction via feature space to feature space distance metric learning ⋮ Generalized two-dimensional linear discriminant analysis with regularization ⋮ Flexible capped principal component analysis with applications in image recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Regularized linear discriminant analysis and its application in microarrays
• Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
• Generalized transfer subspace learning through low-rank constraint
• Locally linear discriminant embedding: An efficient method for face recognition
• Robust L1-norm two-dimensional linear discriminant analysis
• The central role of the propensity score in observational studies for causal effects
• Discriminative Transfer Subspace Learning via Low-Rank and Sparse Representation
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Linear Discriminant Analysis Based on L1-Norm Maximization

This page was built for publication: Lp- and Ls-norm distance based robust linear discriminant analysis