• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

Regularization and variable selection via the Elastic Net (2004)

Cached

  • Download as a PDF

Download Links

  • [web.stanford.edu]
  • [www.stat.purdue.edu]
  • [www.math.mtu.edu]
  • [www-stat.stanford.edu]
  • [www.ece.duke.edu]
  • [people.ee.duke.edu]
  • [www.cc.gatech.edu]
  • [www.cc.gatech.edu]
  • [users.stat.umn.edu]
  • [www.cc.gatech.edu]
  • [www.stanford.edu]
  • [users.stat.umn.edu]
  • [people.ee.duke.edu]
  • [www.cc.gatech.edu]
  • [www.cc.gatech.edu]
  • [www.stanford.edu]
  • [web.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Hui Zou , Trevor Hastie
Citations:969 - 12 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Zou04regularizationand,
    author = {Hui Zou and Trevor Hastie},
    title = {Regularization and variable selection via the Elastic Net },
    year = {2004}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, where strongly correlated predictors tend to be in (out) the model together. The elastic net is particularly useful when the number of predictors (p) is much bigger than the number of observations (n). By contrast, the lasso is not a very satisfactory variable selection method in the p n case. An efficient algorithm called LARS-EN is proposed for computing elastic net regularization paths efficiently, much like the LARS algorithm does for the lasso.

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University