Title: Regularization Path for Linear Model via Net Method
Abstract: We investigate a net regularization method for variable selection in the linear model, which has convex loss function and concave penalty. Meanwhile, the net regularization based on the use of the Lr penalty with $\frac{1}{2}\leq$ r ≤1. In the simulation we will demonstrate that the net regularization is more efficient and more accurate for variable selection than Lasso.
Publication Year: 2012
Publication Date: 2012-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot