Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7515
Title: Iterative L1/2 regularization algorithm for variable selection in the Cox proportional hazards model
Authors: Liu, Cheng 
Liang, Yong 
Luan, Xin-Ze 
Prof. LEUNG Kwong Sak 
Chan, Tak-Ming 
Xu, Zong-Ben 
Zhang, Hai 
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. 11-17
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
Abstract: In this paper, we investigate to use theL1/2 regularization method for variable selection based on the Cox's proportional hazards model. The L1/2 regularization method isa reweighed iterative algorithm with the adaptively weighted L1 penalty on regression coefficients. The algorithm of the L1/2 regularization method can be easily obtained by a series of L1 penalties. Simulation results based on standard artificial data show that the L1/2 regularization method can be more accurate for variable selection than Lasso and adaptive Lasso methods. The results from Primary Biliary Cirrhosis (PBC) dataset indicate the L 1/2 regularization method performs competitively. © 2012 Springer-Verlag.
Type: Conference Paper
URI: http://hdl.handle.net/20.500.11861/7515
ISBN: 978-364231019-5
ISSN: 16113349
DOI: 10.1007/978-3-642-31020-1_2
Appears in Collections:Applied Data Science - Publication

Show full item record

Page view(s)

35
Last Week
0
Last month
checked on Dec 20, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.