.png){kind=icon}
Return
Efficient and Robust Sparse Linear Discriminant Analysis for Data Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TETCI.2024.3403912.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse linear discriminant analysis (LDA) is a popular machine learning method that improves the accuracy of data classification by introducing sparsity. However, its performance often degrades seriously when encountering noise. To address this issue, this paper proposes a new method called efficient and robust sparse linear discriminant analysis (ERSLDA). The core idea is to characterize the local pixel corruptions by integrating L-p-norm (0< p< 1), and to describe the global structured sparsity by enforcing L-2,L-p-norm (0< p< 1), thereby improving the ability of feature selection. Compared with existing L-1-norm and L-2,L-1-norm, the involved L-p-norm and L-2,L-p-norm can bring higher robustness and better accuracy. Moreover, an additional matrix with Frobenius norm is embedded to represent Gaussian noise, which further enhances the robustness in different scenarios. In algorithms, an iterative optimization scheme is developed based on the alternating direction method of multipliers (ADMM) to solve the proposed ERSLDA, and the resulting subproblems can be calculated efficiently. Extensive numerical comparisons are performed with nine state-of-the-art LDA-based methods on seven benchmark image datasets. The experimental results validate that the proposed method is efficient for data classification and robust to noise.
Keywords:
Data classification
linear discriminant analysis (LDA)
L-p-norm
optimization algorithm
Journal
I
IF:
6.5
Papers:
1.4K
Citations:
4.5K
Organization
Cited Papers
ShareSaveShareSaveShareSaveLinear discriminant analysis with generalized kernel constraint for robust image classification.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSaveShareSave
View more