Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7502
DC FieldValueLanguage
dc.contributor.authorLiu, Chengen_US
dc.contributor.authorLiang, Yongen_US
dc.contributor.authorLuan, Xin-Zeen_US
dc.contributor.authorProf. LEUNG Kwong Saken_US
dc.contributor.authorChan, Tak-Mingen_US
dc.contributor.authorXu, Zong-Benen_US
dc.contributor.authorZhang, Haien_US
dc.date.accessioned2023-03-16T04:14:39Z-
dc.date.available2023-03-16T04:14:39Z-
dc.date.issued2014-
dc.identifier.citationApplied Soft Computing, January 2014, Vol. 14, Part C, pp. 498-503en_US
dc.identifier.urihttp://hdl.handle.net/20.500.11861/7502-
dc.description.abstractIn this paper, we investigate to use the L1/2 regularization method for variable selection based on the Cox's proportional hazards model. The L1/2 regularization can be taken as a representative of Lq (0 < q < 1) regularizations and has been demonstrated many attractive properties. To solve the L1/2 penalized Cox model, we propose a coordinate descent algorithm with a new univariate half thresholding operator which is applicable to high-dimensional biological data. Simulation results based on standard artificial data show that the L1/2 regularization method can be more accurate for variable selection than Lasso and SCAD methods. The results from real DNA microarray datasets indicate the L1/2 regularization method performs competitively.en_US
dc.language.isoenen_US
dc.relation.ispartofApplied Soft Computingen_US
dc.titleThe L1/2 regularization method for variable selection in the Cox modelen_US
dc.typePeer Reviewed Journal Articleen_US
dc.identifier.doi10.1016/j.asoc.2013.09.006-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Applied Data Science - Publication
Show simple item record

SCOPUSTM   
Citations

22
checked on Dec 15, 2024

Page view(s)

41
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.