Luan, Xin-ZeXin-ZeLuanLiang, YongYongLiangLiu, ChengChengLiuXu, Zong-BenZong-BenXuZhang, HaiHaiZhangProf. LEUNG Kwong SakChan, Tak-MingTak-MingChan2023-03-172023-03-172012Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7332 LNCS(PART 2), pp. 414-421978-364231019-516113349http://hdl.handle.net/20.500.11861/7514We 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 1/2 ≤ r ≤ 1. In the simulation we will demonstrate that the net regularization is more efficient and more accurate for variable selection than Lasso. © 2012 Springer-Verlag.enLassoNet RegularizationVariable SelectionConference Paper10.1007/978-3-642-31020-1_49