Multicategory vertex discriminant analysis for high-dimensional data

Statistics – Applications

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.1214/10-AOAS345 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Ins

Scientific paper

10.1214/10-AOAS345

In response to the challenges of data mining, discriminant analysis continues to evolve as a vital branch of statistics. Our recently introduced method of vertex discriminant analysis (VDA) is ideally suited to handle multiple categories and an excess of predictors over training cases. The current paper explores an elaboration of VDA that conducts classification and variable selection simultaneously. Adding lasso ($\ell_1$-norm) and Euclidean penalties to the VDA loss function eliminates unnecessary predictors. Lasso penalties apply to each predictor coefficient separately; Euclidean penalties group the collective coefficients of a single predictor. With these penalties in place, cyclic coordinate descent accelerates estimation of all coefficients. Our tests on simulated and benchmark real data demonstrate the virtues of penalized VDA in model building and prediction in high-dimensional settings.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Multicategory vertex discriminant analysis for high-dimensional data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multicategory vertex discriminant analysis for high-dimensional data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicategory vertex discriminant analysis for high-dimensional data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-266900

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.