arXiv Analytics

Sign in

arXiv:1206.6472 [cs.LG]AbstractReferencesReviewsResources

An Efficient Approach to Sparse Linear Discriminant Analysis

Luis Francisco Sanchez Merchante, Yves Grandvalet, Gerrad Govaert

Published 2012-06-27Version 1

We present a novel approach to the formulation and the resolution of sparse Linear Discriminant Analysis (LDA). Our proposal, is based on penalized Optimal Scoring. It has an exact equivalence with penalized LDA, contrary to the multi-class approaches based on the regression of class indicator that have been proposed so far. Sparsity is obtained thanks to a group-Lasso penalty that selects the same features in all discriminant directions. Our experiments demonstrate that this approach generates extremely parsimonious models without compromising prediction performances. Besides prediction, the resulting sparse discriminant directions are also amenable to low-dimensional representations of data. Our algorithm is highly efficient for medium to large number of variables, and is thus particularly well suited to the analysis of gene expression data.

Comments: Appears in Proceedings of the 29th International Conference on Machine Learning (ICML 2012)
Categories: cs.LG, stat.ML
Related articles: Most relevant | Search more
arXiv:1306.1323 [cs.LG] (Published 2013-06-06)
Verdict Accuracy of Quick Reduct Algorithm using Clustering and Classification Techniques for Gene Expression Data
arXiv:2301.12222 [cs.LG] (Published 2023-01-28)
Machine Learning Methods for Cancer Classification Using Gene Expression Data: A Review
arXiv:1112.4261 [cs.LG] (Published 2011-12-19)
Performance Analysis of Enhanced Clustering Algorithm for Gene Expression Data