DOI | Resolve DOI: https://doi.org/10.1007/978-3-540-27868-9_77 |
---|
Author | Search for: Pranckeviciene, Erinija1; Search for: Baumgartner, Richard1; Search for: Somorjai, Ray1; Search for: Bowman, Christopher1 |
---|
Affiliation | - National Research Council of Canada. NRC Institute for Biodiagnostics
|
---|
Format | Text, Book Chapter |
---|
Conference | Joint IAPR International Workshops on Structural and Syntactical Pattern Recognition (SSPR 2004) and Statistical Pattern Recognition (SPR 2004), August 18-20, 2004, Lisbon, Portugal |
---|
Abstract | In linear discriminant (LD) analysis high sample size/feature ratio is desirable. The linear programming procedure (LP) for LD identification handles the curse of dimensionality through simultaneous minimization of the L1 norm of the classification errors and the LD weights. The sparseness of the solution – the fraction of features retained – can be controlled by a parameter in the objective function. By qualitatively analyzing the objective function and the constraints of the problem, we show why sparseness arises. In a sparse solution, large values of the LD weight vector reveal those individual features most important for the decision boundary. |
---|
Publication date | 2004 |
---|
Publisher | Springer Berlin Heidelberg |
---|
In | |
---|
Series | |
---|
Language | English |
---|
Peer reviewed | Yes |
---|
NRC number | NRC-IBD-2139 |
---|
NPARC number | 9147559 |
---|
Export citation | Export as RIS |
---|
Report a correction | Report a correction (opens in a new tab) |
---|
Record identifier | cbdae675-bf2f-48f7-8a3a-9f4c94013e2d |
---|
Record created | 2009-06-25 |
---|
Record modified | 2020-06-12 |
---|