{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T13:40:18Z","timestamp":1714398018384},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T00:00:00Z","timestamp":1347926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10115-012-0545-2","type":"journal-article","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T11:10:01Z","timestamp":1347880201000},"page":"411-438","source":"Crossref","is-referenced-by-count":11,"title":["Toward structural sparsity: an explicit $$\\ell _{2}\/\\ell _0$$ approach"],"prefix":"10.1007","volume":"36","author":[{"given":"Dijun","family":"Luo","sequence":"first","affiliation":[]},{"given":"Chris","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,18]]},"reference":[{"issue":"3","key":"545_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou A, Evgeniou T, Pontil M (2008) Convex multi-task feature learning. Mach Learn 73(3):243\u2013272","journal-title":"Mach Learn"},{"key":"545_CR2","doi-asserted-by":"crossref","unstructured":"Bach FR (2008) Bolasso: model consistent lasso estimation through the bootstrap. In: \u2018ICML\u2019, pp 33\u201340","DOI":"10.1145\/1390156.1390161"},{"key":"545_CR3","doi-asserted-by":"crossref","unstructured":"Bach FR, Lanckriet GRG, Jordan MI (2004) Multiple kernel learning, conic duality, and the smo algorithm. In: ICML","DOI":"10.1145\/1015330.1015424"},{"key":"545_CR4","unstructured":"Bach FR, Thibaux R, Jordan MI (2004) Computing regularization paths for learning multiple kernels. In: NIPS"},{"issue":"1","key":"545_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10115-010-0374-0","volume":"29","author":"E Baralis","year":"2011","unstructured":"Baralis E, Bruno G, Fiori A (2011) Measuring gene similarity by means of the classification distance. Knowl Inform Syst 29(1):81\u2013101","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"545_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"issue":"4","key":"545_CR7","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2008","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"issue":"2","key":"545_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10208-004-0162-x","volume":"6","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s EJ, Romberg JK (2006) Quantitative robust uncertainty principles and optimally sparse decompositions. Found Comput Math 6(2):227\u2013254","journal-title":"Found Comput Math"},{"key":"545_CR9","doi-asserted-by":"crossref","first-page":"2392","DOI":"10.1214\/009053607000000532","volume":"35","author":"E Cand\u00e8s","year":"2004","unstructured":"Cand\u00e8s E, Tao T (2004) Rejoinder: statistical estimation when $$p$$ is much larger than $$n$$ \u2019. Annu Stat 35:2392\u20132404","journal-title":"Annu Stat"},{"key":"545_CR10","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s E, Tao T (2005) Decoding by linear programming. IEEE Trans Inform Theory 51:4203\u20134215","journal-title":"IEEE Trans Inform Theory"},{"issue":"2","key":"545_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"E Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s E, Wakin M (2008) An introduction to compressive sensing\u2019. IEEE Signal Process Mag 25(2): 21\u201330","journal-title":"IEEE Signal Process Mag"},{"key":"545_CR12","unstructured":"Chen X, Lin Q, Kim S, Xing E (2010) An efficient proximal-gradient method for single and multi-task regression with structured sparsity. Technical Report, arXiv:1005.4717"},{"key":"545_CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"G Davis","year":"1997","unstructured":"Davis G, Mallat S, Avellaneda M (1997) Greedy adaptive approximation. J Constr Approx 13:57\u201398","journal-title":"J Constr Approx"},{"key":"545_CR14","doi-asserted-by":"crossref","unstructured":"Ding CHQ, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix t-factorizations for clustering. In: KDD, pp 126\u2013135","DOI":"10.1145\/1150402.1150420"},{"key":"545_CR15","doi-asserted-by":"crossref","unstructured":"Ding C, Zhou D, He X, Zha H (June 2006) R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization. Proceedings of international conference on machine learning (ICML)","DOI":"10.1145\/1143844.1143880"},{"key":"545_CR16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone L, Tibshirani R (2004) Least angle regression. Ann Stat 32:407\u2013499","journal-title":"Ann Stat"},{"issue":"3","key":"545_CR17","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10115-010-0288-x","volume":"26","author":"A Akadi El","year":"2011","unstructured":"El Akadi A, Amine A, El Ouardighi A, Aboutajdine D (2011) A two-stage gene selection scheme utilizing mrmr filter and ga wrapper. Knowl Inform Syst 26(3):487\u2013500","journal-title":"Knowl Inform Syst"},{"issue":"456","key":"545_CR18","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2003","unstructured":"Fan J, Li R (2003) Variable selection via nonconcave penalized likelihood and its oracle properties. J Am Stat Assoc 96(456):1348\u20131360","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"545_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, H\u00f6lfling H, Tibshirani R (2007) Pathwise coordinate optimization. Ann Stat 1(2):302\u2013332","journal-title":"Ann Stat"},{"issue":"3","key":"545_CR20","first-page":"397","volume":"7","author":"WJ Fu","year":"2000","unstructured":"Fu WJ (2000) Penalized regressions: the bridge versus the lasso. J Comput Graph Stat 7(3):397\u2013416","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"545_CR21","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-010-0313-0","volume":"28","author":"K Huang","year":"2011","unstructured":"Huang K, Ying Y, Campbell C (2011) Generalized sparse metric learning with relative comparisons. Knowl Inform Syst 28(1):25\u201345","journal-title":"Knowl Inform Syst"},{"key":"545_CR22","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1016\/j.neuroimage.2009.12.120","volume":"50","author":"S Huang","year":"2010","unstructured":"Huang S, Li J, Sun L, Ye J, Fleisher A, Wu T, Chen K, Reiman E (2010) Learning brain connectivity of alzheimers disease by sparse inverse covariance estimation. NeuroImage 50:935\u2013949","journal-title":"NeuroImage"},{"key":"545_CR23","unstructured":"Jenatton R, Obozinski G, Bach F (2009) Structured sparse principal component analysis\u2019. Arxiv, preprint arXiv: 0909.1440"},{"issue":"12","key":"545_CR24","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","volume":"23","author":"H Kim","year":"2007","unstructured":"Kim H, Park H (2007) Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12):1495\u20131502","journal-title":"Bioinformatics"},{"key":"545_CR25","first-page":"372","volume":"27","author":"DD Lee","year":"1983","unstructured":"Lee DD, Seung HS (1983) A method for solving a convex programming problem with convergence rate $$o(1\/k^2)$$ . Sov Math Dokl 27:372\u2013376","journal-title":"Sov Math Dokl"},{"issue":"6755","key":"545_CR26","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"issue":"2","key":"545_CR27","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/csla.1995.0010","volume":"9","author":"CJ Leggetter","year":"1995","unstructured":"Leggetter CJ, Woodland PC (1995) Maximum likelihood linear regression for speaker adaptation of continuous density hidden markov models. Comput Speech Lang 9(2):171\u2013185","journal-title":"Comput Speech Lang"},{"key":"545_CR28","doi-asserted-by":"crossref","unstructured":"Liu J, Chen J, Ye J (2009) Large-scale sparse logistic regression. In: SIGKDD09, pp 547\u2013556","DOI":"10.1145\/1557019.1557082"},{"key":"545_CR29","unstructured":"Liu J, Ji S, Ye J (2009) Multi-task feature learning via efficient $$l_{2,1}$$ -norm minimization. In: UAI2009"},{"key":"545_CR30","unstructured":"Liu J, Musialski P, Wonka P, Ye J (2009) Tensor completion for estimating missing values in visual data. In: ICCV09, pp 2114\u20132121"},{"key":"545_CR31","unstructured":"Liu J, Ye J (2010) Moreau-yosida regularization for grouped tree structure learning. In: Lafferty J, Williams CKI, Shawe-Taylor J, Zemel R, Culotta A (eds) NIPS vol 23, pp 1459\u20131467"},{"key":"545_CR32","first-page":"10","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal J, Bach F, Ponce J, Sapiro G (2010) Online learning for matrix factorization and sparse coding. J Mach Learn Res 11:10\u201360","journal-title":"J Mach Learn Res"},{"issue":"12","key":"545_CR33","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat S, Zhang Z (1993) Matching pursuit in a time-frequency dictionary. IEEE Trans Signal Process 41(12):3397\u20133415","journal-title":"IEEE Trans Signal Process"},{"key":"545_CR34","volume-title":"Introductory lectures on convex optimization: a basic course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov Y (2003) Introductory lectures on convex optimization: a basic course. Kluwer, Dordrecht"},{"key":"545_CR35","unstructured":"Nesterov Y (2007) Gradient methods for minimizing composite objective function. Technical report CORE"},{"key":"545_CR36","unstructured":"Nie F, Huang H, Cai X, Ding C (2010) Efficient and robust feature selection via joint $$\\ell _{2,1}$$ -norms minimization. In: NIPS"},{"key":"545_CR37","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski G, Taskar B, Jordan MI (2010) Joint covariate selection and joint subspace selection for multiple classification problems. Stat Comput 20:231\u2013252","journal-title":"Stat Comput"},{"issue":"2","key":"545_CR38","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","volume":"9","author":"MR Osborne","year":"2000","unstructured":"Osborne MR, Presnell B, Turlach BA (2000) On the lasso and its dual. J Comput Graph Stat 9(2):319\u2013337","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"545_CR39","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1214\/09-AOAS271","volume":"2","author":"J Peng","year":"2010","unstructured":"Peng J, Zhu J, Bergamaschi A, Han W, Noh D-Y, Pollack JR, Wang P (2010) Regularized multivariate regression for identifying master predictors with application to integrative genomics study of breast cancer. Ann Appl Stat 2(1):53\u201377","journal-title":"Ann Appl Stat"},{"issue":"17","key":"545_CR40","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1093\/bioinformatics\/btg308","volume":"19","author":"SK Shevade","year":"2003","unstructured":"Shevade SK, Keerthi SS (2003) A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics 19(17):2246\u20132253","journal-title":"Bioinformatics"},{"issue":"2","key":"545_CR41","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10115-009-0249-4","volume":"25","author":"S Simmuteit","year":"2010","unstructured":"Simmuteit S, Schleif F, Villmann T, Hammer B (2010) Evolving trees for the retrieval of mass spectrometry-based bacteria fingerprints. Knowl Inform Syst 25(2):327\u2013343","journal-title":"Knowl Inform Syst"},{"key":"545_CR42","doi-asserted-by":"crossref","unstructured":"Smeaton AF, Over P, Kraaij W (2006) Evaluation campaigns and trecvid. In: Proceedings of the 8th ACM international workshop on multimedia information retrieval, pp 321\u2013330","DOI":"10.1145\/1178677.1178722"},{"key":"545_CR43","doi-asserted-by":"crossref","unstructured":"Stojnic M (2009) $$\\ell _2\/\\ell _1$$ -optimization in block-sparse compressed sensing and its strong thresholds. IEEE J Sel Top Signal Process 4(2):350\u2013357","DOI":"10.1109\/JSTSP.2009.2039172"},{"key":"545_CR44","unstructured":"Sun L, Liu J, Chen J, Ye J (2009) Efficient recovery of jointly sparse vectors. Adv Neural Inform Process Syst 22:1812\u20131820"},{"key":"545_CR45","doi-asserted-by":"crossref","unstructured":"Sun L, Patel R, Liu J, Chen K, Wu T, Li J, Reiman E, Ye J (2009) Mining brain region connectivity for alzheimer\u2019s disease study via sparse inverse covariance estimation. In: SIGKDD09, pp 1335\u20131344","DOI":"10.1145\/1557019.1557162"},{"key":"545_CR46","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the LASSO. J R Stat Soc B 58:267\u2013288","journal-title":"J R Stat Soc B"},{"issue":"1","key":"545_CR47","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1093\/biostatistics\/kxm013","volume":"9","author":"R Tibshirani","year":"2008","unstructured":"Tibshirani R (2008) Spatial smoothing and hot spot detection for CGH data using the fused lasso. Biostatistics 9(1):18\u201329","journal-title":"Biostatistics"},{"issue":"1","key":"545_CR48","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2004","unstructured":"Tibshirani R, Saunders M, Rosset S, Zhu J, Knight K (2004) Sparsity and smoothness via the fused lasso. J R Stat Soc Ser B 67(1):91\u2013108","journal-title":"J R Stat Soc Ser B"},{"key":"545_CR49","unstructured":"Trohidis K, Tsoumakas G, Kalliris G, Vlahavas I, (2008) Multilabel classification of music into emotions. In: Proceedings 9th international conference on music information retrieval (ISMIR, 2008) Philadelphia, PA, USA, vol 2008"},{"key":"545_CR50","unstructured":"Tropp J (2004) Just relax: Convex programming methods for subset selection and sparse approximation. ICES report, pp 04\u201304"},{"issue":"12","key":"545_CR51","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp J, Gilbert A (2007) Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inform Theory 53(12):4655\u20134666","journal-title":"IEEE Trans Inform Theory"},{"issue":"2","key":"545_CR52","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Yang A, Ganesh A, Sastry S, Ma Y (2009) Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell 31(2):210\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"545_CR53","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan M, Lin Y (2006) Model selection and estimation in regression with grouped variables. J R Stat Soc Ser B 68(1):49\u201367","journal-title":"J R Stat Soc Ser B"},{"key":"545_CR54","doi-asserted-by":"crossref","unstructured":"Zhao Z et al (2008) Imputation of missing genotypes: an empirical evaluation of impute. BMC Genetics 9:85","DOI":"10.1186\/1471-2156-9-85"},{"issue":"6A","key":"545_CR55","doi-asserted-by":"crossref","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao P, Rocha G, Yu B (2009) Grouped and hierarchical model selection through composite absolute penalties. Ann Stat 37(6A):3468\u20133497","journal-title":"Ann Stat"},{"key":"545_CR56","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao P, Yu B (2006) On model selection consistency of lasso. J Mach Learn Res 7:2541\u20132563","journal-title":"J Mach Learn Res"},{"key":"545_CR57","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou H, Hastie T (2005) Regularization and variable selection via the elastic net. J R Stat Soc Ser B 67:301\u2013320","journal-title":"J R Stat Soc Ser B"},{"key":"545_CR58","unstructured":"Zuo H (2006) The adaptive lasso and its oracle properties. J Am Stat Assoc 110(476):1418\u20131429"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0545-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0545-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0545-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T13:05:45Z","timestamp":1714395945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0545-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,18]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["545"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0545-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,18]]}}}