{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T15:04:37Z","timestamp":1793977477363,"version":"4.8.0"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T00:00:00Z","timestamp":1199404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,2,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>The group lasso is an extension of the lasso to do variable selection on (predefined) groups of variables in linear regression models. The estimates have the attractive property of being invariant under groupwise orthogonal reparameterizations. We extend the group lasso to logistic regression models and present an efficient algorithm, that is especially suitable for high dimensional problems, which can also be applied to generalized linear models to solve the corresponding convex optimization problem. The group lasso estimator for logistic regression is shown to be statistically consistent even if the number of predictors is much larger than sample size but with sparse true underlying structure. We further use a two-stage procedure which aims for sparser models than the group lasso, leading to improved prediction performance for some cases. Moreover, owing to the two-stage nature, the estimates can be constructed to be hierarchical. The methods are used on simulated and real data sets about splice site detection in DNA sequences.<\/jats:p>","DOI":"10.1111\/j.1467-9868.2007.00627.x","type":"journal-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T12:34:34Z","timestamp":1282221274000},"page":"53-71","source":"Crossref","is-referenced-by-count":1245,"title":["The Group Lasso for Logistic Regression"],"prefix":"10.1093","volume":"70","author":[{"given":"Lukas","family":"Meier","sequence":"first","affiliation":[{"name":"Eidgen\u00f6ssische Technische Hochschule , Z\u00fcrich , Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sara","family":"Van De Geer","sequence":"additional","affiliation":[{"name":"Eidgen\u00f6ssische Technische Hochschule , Z\u00fcrich , Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"B\u00fchlmann","sequence":"additional","affiliation":[{"name":"Eidgen\u00f6ssische Technische Hochschule , Z\u00fcrich , Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2008,1,4]]},"reference":[{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1198\/016214501753208942","article-title":"Regularization of wavelet approximations (with discussion)","volume":"96","author":"Antoniadis","year":"2001","journal-title":"J. Am. Statist. Ass."},{"key":"2023040708300963300_","volume-title":"Adaptive regression and model selection in data mining problems","author":"Bakin","year":"1999"},{"key":"2023040708300963300_","volume-title":"Algorithms for sparse linear classifiers in the massive data setting","author":"Balakrishnan","year":"2006"},{"key":"2023040708300963300_","volume-title":"Nonlinear Programming","author":"Bertsekas","year":"2003"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-7306(08)60465-2","volume-title":"Computational Methods in Molecular Biology","author":"Burge","year":"1998"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/jmbi.1997.0951","article-title":"Prediction of complete gene structures in human genomic DNA","volume":"268","author":"Burge","year":"1997","journal-title":"J. Molec. Biol."},{"key":"2023040708300963300_","first-page":"960","article-title":"Discussion of \u2018\u2018Regularization of wavelet approximations\u2019\u2019 (by A. Antoniadis and J. Fan)","volume":"96","author":"Cai","year":"2001","journal-title":"J. Am. Statist. Ass."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","article-title":"Least angle regression","volume":"32","author":"Efron","year":"2004","journal-title":"Ann. Statist."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/B978-044451378-6\/50016-8","volume-title":"Recent Advances and Trends in Nonparametric Statistics","author":"Van De Geer","year":"2003"},{"key":"2023040708300963300_","article-title":"High-dimensional generalized linear models and the lasso","author":"Van De Geer","year":"2007","journal-title":"Ann. Statist."},{"key":"2023040708300963300_","first-page":"291","volume-title":"Large-scale bayesian logistic regression for text categorization","author":"Genkin","year":"2007"},{"key":"2023040708300963300_","first-page":"375","article-title":"Blockwise sparse regression","volume":"16","author":"Kim","year":"2006","journal-title":"Statist. Sin."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/oxfordjournals.pan.a004868","article-title":"Logistic regression in rare events data","volume":"9","author":"King","year":"2001","journal-title":"Polit. Anal."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/TPAMI.2005.127","article-title":"Sparse multinomial logistic regression: fast algorithms and generalization bounds","volume":"27","author":"Krishnapuram","year":"2005","journal-title":"IEEE Trans. Pattn Anal. Mach. Intell."},{"key":"2023040708300963300_","volume-title":"The lasso and generalised linear models","author":"Lokhorst","year":"1999"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.csda.2006.12.019","article-title":"Lasso with relaxation","volume":"52","author":"Meinshausen","year":"2007","journal-title":"Computnl Statist. Data Anal."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","article-title":"A new approach to variable selection in least squares problems","volume":"20","author":"Osborne","year":"2000","journal-title":"IMA J. Numer. Anal."},{"key":"2023040708300963300_","volume-title":"Regularization path algorithms for detecting gene interactions","author":"Park","year":"2006"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/j.1467-9868.2007.00607.x","article-title":"L1-regularization path algorithm for generalized linear models","volume":"69","author":"Park","year":"2007","journal-title":"J. R. Statist. Soc. B"},{"key":"2023040708300963300_","first-page":"1153","volume-title":"Advances in Neural Information Processing Systems","author":"Rosset","year":"2005"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TNN.2003.809398","article-title":"The generalized lasso","volume":"15","author":"Roth","year":"2004","journal-title":"IEEE Trans. Neur. Netwrks"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1093\/bioinformatics\/btg308","article-title":"A simple and efficient algorithm for gene selection using sparse logistic regression","volume":"19","author":"Shevade","year":"2003","journal-title":"Bioinformatics"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.3150\/bj\/1165269150","article-title":"Classifiers of support vector machine type with l1 complexity regularization","volume":"12","author":"Tarigan","year":"2006","journal-title":"Bernoulli"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Statist. Soc. B"},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/(SICI)1097-0258(19970228)16:4<385::AID-SIM380>3.0.CO;2-3","article-title":"The lasso method for variable selection in the cox model","volume":"16","author":"Tibshirani","year":"1997","journal-title":"Statist. Med."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","article-title":"Convergence of a block coordinate descent method for nondifferentiable minimization","volume":"109","author":"Tseng","year":"2001","journal-title":"J. Optimizn Theory Appl."},{"key":"2023040708300963300_","volume-title":"A coordinate gradient descent method for nonsmooth separable minimization","author":"Tseng","year":"2007"},{"key":"2023040708300963300_","first-page":"475","article-title":"Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals","volume":"11","author":"Yeo","year":"2004","journal-title":"J. Computnl Biol."},{"key":"2023040708300963300_","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","article-title":"Model selection and estimation in regression with grouped variables","volume":"68","author":"Yuan","year":"2006","journal-title":"J. R. Statist. Soc. B"},{"key":"2023040708300963300_","volume-title":"Stagewise lasso","author":"Zhao","year":"2007"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fj.1467-9868.2007.00627.x","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/70\/1\/53\/49796502\/jrsssb_70_1_53.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/70\/1\/53\/49796502\/jrsssb_70_1_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T15:29:55Z","timestamp":1740410995000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/70\/1\/53\/7109381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,4]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2008,1,4]]},"published-print":{"date-parts":[[2008,2,1]]}},"URL":"https:\/\/doi.org\/10.1111\/j.1467-9868.2007.00627.x","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2008,2]]},"published":{"date-parts":[[2008,1,4]]}}}