General sparse multi-class linear discriminant analysis

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 208
  • Download : 0
Discrimination with high dimensional data is often more effectively done with sparse methods that use a fraction of predictors rather than using all the available ones. In recent years, some effective sparse discrimination methods based on Fisher's linear discriminant analysis (LDA) have been proposed for binary class problems. Extensions to multi-class problems are suggested in those works; however, they have some drawbacks such as the heavy computational cost for a large number of classes. We propose an approach to generalize a binary LDA solution into a multi-class solution while avoiding the limitations of the existing methods. Simulation studies with various settings, as well as real data examples including next generation sequencing data, confirm the effectiveness of the proposed approach. (C) 2016 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER
Issue Date
2016-07
Language
English
Article Type
Article
Citation

COMPUTATIONAL STATISTICS & DATA ANALYSIS, v.99, pp.81 - 90

ISSN
0167-9473
DOI
10.1016/j.csda.2016.01.011
URI
http://hdl.handle.net/10203/285426
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0