Optimal feature selection for sparse linear discriminant analysis and its applications in gene expression data
Cheng Wang, Longbing Cao, Baiqi Miao

TL;DR
This paper introduces a new sparse linear discriminant analysis method called TLDA, which uses l1 minimization for feature selection, achieving optimal classification with fewer features and lower misclassification rates.
Contribution
The paper proposes a novel two-stage LDA method (TLDA) utilizing l1 minimization, with proven asymptotic optimality and improved performance over existing methods.
Findings
TLDA achieves the best convergence rate among compared methods.
TLDA uses fewer features to reach higher accuracy.
Experimental results confirm theoretical advantages.
Abstract
This work studies the theoretical rules of feature selection in linear discriminant analysis (LDA), and a new feature selection method is proposed for sparse linear discriminant analysis. An minimization method is used to select the important features from which the LDA will be constructed. The asymptotic results of this proposed two-stage LDA (TLDA) are studied, demonstrating that TLDA is an optimal classification rule whose convergence rate is the best compared to existing methods. The experiments on simulated and real datasets are consistent with the theoretical results and show that TLDA performs favorably in comparison with current methods. Overall, TLDA uses a lower minimum number of features or genes than other approaches to achieve a better result with a reduced misclassification rate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
