Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11861/7514| Title: | Regularization path for linear model via net method |
| Authors: | Luan, Xin-Ze Liang, Yong Liu, Cheng Xu, Zong-Ben Zhang, Hai Prof. LEUNG Kwong Sak Chan, Tak-Ming |
| Issue Date: | 2012 |
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7332 LNCS(PART 2), pp. 414-421 |
| Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 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 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. |
| Type: | Conference Paper |
| URI: | http://hdl.handle.net/20.500.11861/7514 |
| ISBN: | 978-364231019-5 |
| ISSN: | 16113349 |
| DOI: | 10.1007/978-3-642-31020-1_49 |
| Appears in Collections: | Publication |
Find@HKSYU Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.