Variable Selection

Explore this paper's citation graph

Summary

It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lasso.

Published
2019-07-31
Cited by
9,705
References
565

References

Cited by

Related papers

No related papers recorded.