title: Network-constrained group lasso for high-dimensional multinomial classification with application to cancer subtype prediction.
abstract: Classic multinomial logit model, commonly used in multiclass regression problem, is restricted to few predictors and does not take into account the relationship among variables. It has limited use for genomic data, where the number of genomic features far exceeds the sample size. Genomic features such as gene expressions are usually related by an underlying biological network. Efficient use of the network information is important to improve classification performance as well as the biological interpretability. We proposed a multinomial logit model that is capable of addressing both the high dimensionality of predictors and the underlying network information. Group lasso was used to induce model sparsity, and a network-constraint was imposed to induce the smoothness of the coefficients with respect to the underlying network structure. To deal with the non-smoothness of the objective function in optimization, we developed a proximal gradient algorithm for efficient computation. The proposed model was compared to models with no prior structure information in both simulations and a problem of cancer subtype prediction with real TCGA (the cancer genome atlas) gene expression data. The network-constrained mode outperformed the traditional ones in both cases.
authors: Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA.
authors: Xinyu
authors: X
authors: Tian
authors: Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA. ; Department of Preventive Medicine, Stony Brook University, Stony Brook, NY, USA.
authors: Xuefeng
authors: X
authors: Wang
authors: Division of Biomedical Statistics and Informatics, Mayo Clinic, Rochester, MN, USA.
authors: Jun
authors: J
authors: Chen
keywords: cancer subtype prediction; group lasso; multinomial logit model; network-constraint; proximal gradient algorithm
references: Biostatistics. 2013 Apr;14(2):244-58
references: 23074263
references: Bioinformatics. 2002 Sep;18(9):1216-26
references: 12217913
references: Bioinformatics. 2008 May 1;24(9):1175-82
references: 18310618
references: BMC Bioinformatics. 2013 Jun 19;14:198
references: 23777239
references: BMC Bioinformatics. 2012 May 01;13:69
references: 22548963
references: Ann Appl Stat. 2013 Mar 1;7(1):null
references: 24312162
references: Bioinformatics. 2000 Oct;16(10):906-14
references: 11120680
references: Biostatistics. 2004 Jul;5(3):427-43
references: 15208204
references: Nat Genet. 2000 May;25(1):55-7
references: 10802656
references: BMC Bioinformatics. 2006 Jan 06;7:3
references: 16398926
references: Syst Biol (Stevenage). 2006 Mar;153(2):70-8
references: 16986255
references: Mol Syst Biol. 2007;3:140
references: 17940530
references: BMC Bioinformatics. 2014 Feb 04;15:37
references: 24491042
references: EMBO Mol Med. 2012 Mar;4(3):143-59
references: 22351564
references: IEEE Trans Image Process. 2009 Nov;18(11):2419-34
references: 19635705
references: BMC Bioinformatics. 2009 Jan 30;10 Suppl 1:S21
references: 19208121
references: Ann Stat. 2011;39(4):2021-2046
references: 22102764
references: Nature. 2008 Apr 3;452(7187):564-70
references: 18385730
references: J Comput Biol. 2011 Mar;18(3):263-81
references: 21385033
references: Stat Comput. 2015 Mar;25(2):173-187
references: 25750488
references: BMC Bioinformatics. 2007 Feb 22;8:60
references: 17316436
references: Bioinformatics. 2012 Aug 15;28(16):2106-13
references: 22711789
references: Stat Appl Genet Mol Biol. 2005;4:Article17
references: 16646834
references: BMC Bioinformatics. 2012 Jun 07;13:126
references: 22676414
references: Bioinformatics. 2003 Jun 12;19(9):1132-9
references: 12801874