Please use this identifier to cite or link to this item:
|Title:||Sparse uncorrelated linear discriminant analysis|
|Authors:||Chu, D. |
|Abstract:||In this paper, we develop a novel approach for sparse uncorrelated linear discriminant analysis (ULDA). Our proposal is based on characterization of all solutions of the generalized ULDA. We incorporate sparsity into the ULDA transformation by seeking the solution with minimum ℓ1-norm from all minimum dimension solutions of the generalized ULDA. The problem is then formulated as a ℓ1-minimization problem and is solved by accelerated linearized Bregman method. Experiments on high-dimensional gene expression data demonstrate that our approach not only computes extremely sparse solutions but also performs well in classification. Experimental results also show that our approach can help for data visualization in low-dimensional space. Copyright 2013 by the author(s).|
|Source Title:||30th International Conference on Machine Learning, ICML 2013|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.