.png){kind=icon}
.png){kind=icon}
Return
Sparse Uncorrelated Linear Discriminant Analysis for Undersampled Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2015.2448637.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linear discriminant analysis (LDA) as a well-known supervised dimensionality reduction method has been widely applied in many fields. However, the lack of sparsity in the LDA solution makes interpretation of the results challenging. In this paper, we propose a new model for sparse uncorrelated LDA (ULDA). Our model is based on the characterization of all solutions of the generalized ULDA. We incorporate sparsity into the ULDA transformation by seeking the solution with minimum l(1)-norm from all minimum dimension solutions of the generalized ULDA. The problem is then formulated as an l(1)-minimization problem with orthogonality constraint. To solve this problem, we devise two algorithms: 1) by applying the linearized alternating direction method of multipliers and 2) by applying the accelerated linearized Bregman method. Simulation studies and high-dimensional real data examples demonstrate that our algorithms not only compute extremely sparse solutions but also perform well in classification.
Keywords:
Alternating direction method of multipliers (ADMM)
dimensionality reduction
linear discriminant analysis (LDA)
linearized Bregman iterative method
sparse learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W