{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:31:24Z","timestamp":1771702284359,"version":"3.50.1"},"reference-count":169,"publisher":"Zhejiang University Press","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Frontiers Inf Technol Electronic Eng"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1631\/fitee.1601489","type":"journal-article","created":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T23:48:05Z","timestamp":1492472885000},"page":"445-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A systematic review of structured sparse learning"],"prefix":"10.1631","volume":"18","author":[{"given":"Lin-bo","family":"Qiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-shu","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi-cheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"635","published-online":{"date-parts":[[2017,4,19]]},"reference":[{"key":"148_CR1","first-page":"4600","volume-title":"Proc. ICASSP","author":"A. Asaei","year":"2011","unstructured":"Asaei, A., Bourlard, H., Cevher, V., 2011a. Modelbased compressive sensing for multi-party distant speech recognition. Proc. ICASSP, p.4600\u20134603. http:\/\/dx.doi.org\/10.1109\/ICASSP.2011.5947379"},{"key":"148_CR2","first-page":"192","volume-title":"Proc. Conf. on Int. Speech Communication Association","author":"A. Asaei","year":"2011","unstructured":"Asaei, A., Taghizadeh, M.J., Bourlard, H., et al., 2011b. Multi-party speech recovery exploiting structured sparsity models. Proc. Conf. on Int. Speech Communication Association, p.192\u2013195."},{"key":"148_CR3","first-page":"1439","volume-title":"Proc. ICASSP","author":"A. Asaei","year":"2014","unstructured":"Asaei, A., Bourlard, H., Taghizadeh, M.J., et al., 2014a. Model-based sparse component analysis for reverberant speech localization. Proc. ICASSP, p.1439\u20131443 http:\/\/dx.doi.org\/10.1109\/ICASSP.2014.6853835"},{"issue":"3","key":"148_CR4","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TASLP.2013.2297012","volume":"22","author":"A. Asaei","year":"2014","unstructured":"Asaei, A., Golbabaee, M., Bourlard, H., et al., 2014b. Structured sparsity models for reverberant speech separation. IEEE\/ACM Trans. Audio Speech Lang. Process., 22(3): 620\u2013633. http:\/\/dx.doi.org\/10.1109\/TASLP.2013.2297012","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process"},{"key":"148_CR5","first-page":"1019","volume":"9","author":"F. Bach","year":"2008","unstructured":"Bach, F., 2008a. Consistency of trace norm minimization. J. Mach. Learn. Res., 9: 1019\u20131048.","journal-title":"J. Mach. Learn. Res."},{"key":"148_CR6","first-page":"1179","volume":"9","author":"F. Bach","year":"2008","unstructured":"Bach, F., 2008b. Consistency of the group Lasso and multiple kernel learning. J. Mach. Learn. Res., 9: 1179\u20131225.","journal-title":"J. Mach. Learn. Res."},{"key":"148_CR7","first-page":"1","volume-title":"Optimization for Machine Learning","author":"F. Bach","year":"2011","unstructured":"Bach, F., Jenatton, R., Mairal, J., et al., 2011. Convex optimization with sparsity-inducing norms. In: Sra, S., Nowozin, S., Wright, S.J. (Eds.), Optimization for Machine Learning. MIT Press, Cambridge, p.1\u201335."},{"issue":"1","key":"148_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F. Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., et al., 2012a. Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn., 4(1): 1\u2013106. http:\/\/dx.doi.org\/10.1561\/2200000015","journal-title":"Found. Trends Mach. Learn."},{"issue":"4","key":"148_CR9","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1214\/12-STS394","volume":"27","author":"F. Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., et al., 2012b. Structured sparsity through convex optimization. Stat. Sci., 27(4): 450\u2013468. http:\/\/dx.doi.org\/10.1214\/12-STS394","journal-title":"Stat. Sci."},{"key":"148_CR10","first-page":"1963","volume":"7","author":"F. Bach","year":"2006","unstructured":"Bach, F., Jordan, M.I., 2006. Learning spectral clustering, with application to speech separation. J. Mach. Learn. Res., 7: 1963\u20132001.","journal-title":"J. Mach. Learn. Res."},{"key":"148_CR11","first-page":"485","volume":"9","author":"O. Banerjee","year":"2008","unstructured":"Banerjee, O., El Ghaoui, L., d\u2019Aspremont, A., 2008. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. J. Mach. Learn. Res., 9: 485\u2013516.","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"148_CR12","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/TIT.2010.2040894","volume":"56","author":"R.G. Baraniuk","year":"2010","unstructured":"Baraniuk, R.G., Cevher, V., Duarte, M.F., et al., 2010. Model-based compressive sensing. IEEE Trans. Inform. Theory, 56(4): 1982\u20132001. http:\/\/dx.doi.org\/10.1109\/Tit.2010.2040894","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"148_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A. Beck","year":"2003","unstructured":"Beck, A., Teboulle, M., 2003. Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett., 31(3): 167\u2013175. http:\/\/dx.doi.org\/10.1016\/S0167-6377(02)00231-6","journal-title":"Oper. Res. Lett."},{"key":"148_CR14","doi-asserted-by":"crossref","unstructured":"Beck, A., Teboulle, M., 2009. A fast iterative shrinkagethresholding algorithm for linear inverse problems.","DOI":"10.1137\/080716542"},{"key":"148_CR15","doi-asserted-by":"crossref","unstructured":"SIAM J. Imag. Sci., 2(1): 183\u2013202. http:\/\/dx.doi.org\/10.1137\/080716542","DOI":"10.1137\/080716542"},{"key":"148_CR16","unstructured":"Bengio, S., Pereira, F., Singer, Y., et al., 2009. Group sparse coding. Proc. NIPS, p.82\u201389."},{"issue":"2","key":"148_CR17","first-page":"7","volume":"57","author":"D.M. Blei","year":"2010","unstructured":"Blei, D.M., Griffiths, T.L., Jordan, M.I., 2010. The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies. J. ACM, 57(2):7. http:\/\/doi.acm.org\/10.1145\/1667053.1667056","journal-title":"J. ACM"},{"key":"148_CR18","doi-asserted-by":"crossref","unstructured":"Borne, K., 2009. Scientific data mining in astronomy. arXiv:0911.0505.","DOI":"10.1201\/9781420085877.ch5"},{"issue":"1","key":"148_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S. Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., et al., 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn., 3(1): 1\u2013122. http:\/\/dx.doi.org\/10.1561\/2200000016","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"148_CR20","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"A.M. Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M., 2009. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev., 51(1): 34\u201381. http:\/\/dx.doi.org\/10.1137\/060657704","journal-title":"SIAM Rev."},{"issue":"6","key":"148_CR21","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E. Cand\u00e8s","year":"2007","unstructured":"Cand\u00e8s, E., Tao, T., 2007. The Dantzig selector: statistical estimation when p is much larger than n. Ann. Stat., 35(6): 2313\u20132351. http:\/\/dx.doi.org\/10.1214\/009053606000001523","journal-title":"Ann. Stat."},{"issue":"9-10","key":"148_CR22","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"E.J. Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., 2008. The restricted isometry property and its implications for compressed sensing. Comput. Rend. Math., 346(9-10):589\u2013592. http:\/\/dx.doi.org\/10.1016\/j.crma.2008.03.014","journal-title":"Comput. Rend. Math."},{"issue":"6","key":"148_CR23","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B., 2009. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6): 717\u2013772. http:\/\/dx.doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found. Comput. Math."},{"issue":"8","key":"148_CR24","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T., 2006. Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math., 59(8): 1207\u20131223. http:\/\/dx.doi.org\/10.1002\/Cpa.20124","journal-title":"Commun. Pure Appl. Math."},{"issue":"5","key":"148_CR25","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"E.J. Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P., 2008. Enhancing sparsity by reweighted 1 minimization. J. Four. Anal. Appl., 14(5): 877\u2013905. http:\/\/dx.doi.org\/10.1007\/s00041-008-9045-x","journal-title":"J. Four. Anal. Appl."},{"issue":"4","key":"148_CR26","doi-asserted-by":"crossref","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V. Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parrilo, P.A., Willsky, A.S., 2012. Latent variable graphical model selection via convex optimization. Ann. Stat., 40(4): 1935\u20131967. http:\/\/dx.doi.org\/10.1214\/11-AOS949","journal-title":"Ann. Stat."},{"key":"148_CR27","first-page":"3869","volume-title":"Proc. ICASSP","author":"R. Chartrand","year":"2008","unstructured":"Chartrand, R., Yin, W.T., 2008. Iteratively reweighted algorithms for compressive sensing. Proc. ICASSP, p.3869\u20133872. http:\/\/dx.doi.org\/10.1109\/Icassp.2008.4518498"},{"issue":"10","key":"148_CR28","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/j.mri.2014.07.016","volume":"32","author":"C. Chen","year":"2014","unstructured":"Chen, C., Huang, J.Z., 2014. Exploiting the wavelet structure in compressed sensing MRI. Magn. Reson. Imag., 32(10): 1377\u20131389. http:\/\/dx.doi.org\/10.1016\/j.mri.2014.07.016","journal-title":"Magn. Reson. Imag."},{"issue":"11","key":"148_CR29","doi-asserted-by":"crossref","first-page":"2803","DOI":"10.1109\/TSP.2014.2313528","volume":"62","author":"C. Chen","year":"2014","unstructured":"Chen, C., Li, Y.Q., Huang, J.Z., 2014. Forest sparsity for multi-channel compressive sensing. IEEE Trans. Signal Process., 62(11): 2803\u20132813. http:\/\/dx.doi.org\/10.1109\/TSP.2014.2318138","journal-title":"IEEE Trans. Signal Process"},{"issue":"1","key":"148_CR30","first-page":"1","volume":"59","author":"H.Y. Chen","year":"2016","unstructured":"Chen, H.Y., Sun, Z.G., Yi, F., et al., 2016. BufferBank storage: an economic, scalable and universally usable innetwork storage model for streaming data applications. Sci. China Inform. Sci., 59(1): 1\u201315. http:\/\/dx.doi.org\/10.1007\/s11432-015-5299-5","journal-title":"Sci. China Inform. Sci."},{"key":"148_CR31","unstructured":"Chen, S., Donoho, D., 1994. Basis pursuit. Proc. Asilomar Conf. on Signals, Systems and Computers, p.41\u201344."},{"issue":"2","key":"148_CR32","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1214\/11-AOAS514","volume":"6","author":"X. Chen","year":"2012","unstructured":"Chen, X., Lin, Q.H., Kim, S., et al., 2012. Smoothing proximal gradient method for general structured sparse regression. Ann. Appl. Stat., 6(2): 719\u2013752. http:\/\/dx.doi.org\/10.1214\/11-AOAS514","journal-title":"Ann. Appl. Stat."},{"key":"148_CR33","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"P.L. Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.C., 2011. Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., et al. (Eds.), Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer, Berlin, p.185\u2013212. http:\/\/dx.doi.org\/10.1007\/978-1-4419-9569-8_10"},{"key":"148_CR34","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2307\/2528966","volume":"28","author":"A.P. Dempster","year":"1972","unstructured":"Dempster, A.P., 1972. Covariance selection. Biometrics, 28: 157\u2013175.","journal-title":"Biometrics"},{"issue":"7","key":"148_CR35","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"D.L. Donoho","year":"2001","unstructured":"Donoho, D.L., Huo, X., 2001. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory, 47(7): 2845\u20132862. http:\/\/dx.doi.org\/10.1109\/18.959265","journal-title":"IEEE Trans. Inform. Theory"},{"key":"148_CR36","unstructured":"Donoho, D.L, Drori, I., Stodden, V.C, et al., 2007. Sparse-Lab. http:\/\/sparselab.stanford.edu\/"},{"issue":"9","key":"148_CR37","doi-asserted-by":"crossref","first-page":"4053","DOI":"10.1109\/TSP.2011.2161982","volume":"59","author":"M.F. Duarte","year":"2011","unstructured":"Duarte, M.F., Eldar, Y.C., 2011. Structured compressed sensing: from theory to applications. IEEE Trans. Signal Process., 59(9): 4053\u20134085. http:\/\/dx.doi.org\/10.1109\/TSP.2011.2161982","journal-title":"IEEE Trans. Signal Process"},{"key":"148_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and Redundant Representations: from Theory to Applications in Signal and Image Processing","author":"M. Elad","year":"2010","unstructured":"Elad, M., 2010. Sparse and Redundant Representations: from Theory to Applications in Signal and Image Processing. Springer, Berlin. http:\/\/dx.doi.org\/10.1007\/978-1-4419-7011-4"},{"issue":"456","key":"148_CR39","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J.Q. Fan","year":"2011","unstructured":"Fan, J.Q., Li, R.Z., 2011. Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc., 96(456): 1348\u20131360. http:\/\/dx.doi.org\/10.1198\/016214501753382273","journal-title":"J. Am. Stat. Assoc."},{"key":"148_CR40","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1146\/annurev-economics-061109-080451","volume":"3","author":"J.Q. Fan","year":"2011","unstructured":"Fan, J.Q., Lv, J.C., Qi, L., 2011. Sparse high-dimensional models in economics. Ann. Rev. Econ., 3: 291\u2013317. http:\/\/dx.doi.org\/10.1146\/annurev-economics-061109-080451","journal-title":"Ann. Rev. Econ."},{"issue":"3","key":"148_CR41","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S. Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.J., 2009. Sparsest solutions of underdetermined linear systems via lq-minimization for 0 < q = 1. Appl. Comput. Harmon. Anal., 26(3): 395\u2013407. http:\/\/dx.doi.org\/10.1016\/j.acha.2008.09.001","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"148_CR42","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\u00f6fling, H., et al., 2007. Pathwise coordinate optimization. Ann. Appl. Stat., 1(2): 302\u2013332. http:\/\/dx.doi.org\/10.1214\/07-Aoas131","journal-title":"Ann. Appl. Stat."},{"issue":"3","key":"148_CR43","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J. Friedman","year":"2008","unstructured":"Friedman, J., Hastie, T., Tibshirani, R., 2008. Sparse inverse covariance estimation with the graphical Lasso. Biostatistics, 9(3): 432\u2013441. http:\/\/dx.doi.org\/10.1093\/biostatistics\/kxm045","journal-title":"Biostatistics"},{"key":"148_CR44","unstructured":"Garber, D., Hazan, E., 2015. Faster rates for the Frank-Wolfe method over strongly-convex sets. Proc. ICML, p.541\u2013549."},{"key":"148_CR45","volume-title":"User\u2019s Guide for SQOPT Version 7: Software for Large-Scale Linear and Quadratic Programming","author":"P.E. Gill","year":"2008","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., 2008. User\u2019s Guide for SQOPT Version 7: Software for Large-Scale Linear and Quadratic Programming. http:\/\/www-leland.stanford.edu\/group\/SOL\/guides\/sqdoc7.pdf"},{"key":"148_CR46","unstructured":"Gong, P.H., Zhang, C.S., Lu, Z.S., et al., 2013. A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. Proc. ICML, p.37\u201345."},{"key":"148_CR47","unstructured":"Grant, M., Boyd, S., 2013. CVX: Matlab Software for Disciplined Convex Programming. Version 2.0 Beta. http:\/\/cvxr.com\/cvx\/"},{"issue":"2","key":"148_CR48","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E. Hazan","year":"2007","unstructured":"Hazan, E., Agarwal, A., Kale, S., 2007. Logarithmic regret algorithms for online convex optimization. Mach. Learn., 69(2): 169\u2013192. http:\/\/dx.doi.org\/10.1007\/s10994-007-5016-8","journal-title":"Mach. Learn."},{"issue":"4","key":"148_CR49","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1198\/jcgs.2010.09208","volume":"19","author":"H. Hoefling","year":"2010","unstructured":"Hoefling, H., 2010. A path algorithm for the fused Lasso signal approximator. J. Comput. Graph. Stat., 19(4): 984\u20131006. http:\/\/dx.doi.org\/10.1198\/jcgs.2010.09208","journal-title":"J. Comput. Graph. Stat."},{"key":"148_CR50","unstructured":"Hong, M.Y., Razaviyayn, M., Luo, Z.Q., et al., 2015. A unified algorithmic framework for block-structured optimization involving big data. arXiv:1511.02746."},{"issue":"10","key":"148_CR51","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1631\/FITEE.1601078","volume":"17","author":"T.C. Hu","year":"2016","unstructured":"Hu, T.C., Yu, J.H., 2016. Max-margin based Bayesian classifier. Front. Inform. Technol. Electron. Eng., 17(10): 973\u2013981. http:\/\/dx.doi.org\/10.1631\/FITEE.1601078","journal-title":"Front. Inform. Technol. Electron. Eng."},{"key":"148_CR52","first-page":"3371","volume":"12","author":"J.Z. Huang","year":"2011","unstructured":"Huang, J.Z., Zhang, T., Metaxas, D., 2011. Learning with structured sparsity. J. Mach. Learn. Res., 12: 3371\u20133412.","journal-title":"J. Mach. Learn. Res."},{"issue":"20","key":"148_CR53","doi-asserted-by":"crossref","first-page":"3811","DOI":"10.1093\/bioinformatics\/bti646","volume":"21","author":"T. Huang","year":"2005","unstructured":"Huang, T., Wu, B.L., Lizardi, P., et al., 2005. Detection of DNA copy number alterations using penalized least squares regression. Bioinformatics, 21(20): 3811\u20133817. https:\/\/doi.org\/10.1093\/bioinformatics\/bti646","journal-title":"Bioinformatics"},{"key":"148_CR54","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.P., 2009. Group Lasso with overlap and graph Lasso. Proc. ICML, p.433\u2013440. http:\/\/dx.doi.org\/10.1145\/1553374.1553431","DOI":"10.1145\/1553374.1553431"},{"key":"148_CR55","first-page":"427","volume-title":"Proc. ICML","author":"M. Jaggi","year":"2013","unstructured":"Jaggi, M., 2013. Revisiting Frank-Wolfe: projection-free sparse convex optimization. Proc. ICML, p.427\u2013435."},{"key":"148_CR56","volume-title":"Structured Sparsity-Inducing Norms: Statistical and Algorithmic Properties with Applications to Neuroimaging","author":"R. Jenatton","year":"2011","unstructured":"Jenatton, R., 2011. Structured Sparsity-Inducing Norms: Statistical and Algorithmic Properties with Applications to Neuroimaging. PhD Thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan, Cachan, France."},{"key":"148_CR57","first-page":"366","volume-title":"Proc. AISTATS","author":"R. Jenatton","year":"2009","unstructured":"Jenatton, R., Obozinski, G., Bach, F., 2009. Structured sparse principal component analysis. Proc. AISTATS, p.366\u2013373."},{"key":"148_CR58","first-page":"487","volume-title":"Proc. ICML","author":"R. Jenatton","year":"2010","unstructured":"Jenatton, R., Mairal, J., Bach, F.R., et al., 2010. Proximal methods for sparse hierarchical dictionary learning. Proc. ICML, p.487\u2013494."},{"key":"148_CR59","first-page":"2297","volume":"12","author":"R. Jenatton","year":"2011","unstructured":"Jenatton, R., Mairal, J., Obozinski, G., et al., 2011. Proximal methods for hierarchical sparse coding. J. Mach. Learn. Res., 12: 2297\u20132334.","journal-title":"J. Mach. Learn. Res."},{"key":"148_CR60","doi-asserted-by":"crossref","unstructured":"Jenatton, R., Gramfort, A., Michel, V., et al., 2012. Multiscale mining of fMRI data with hierarchical structured sparsity.","DOI":"10.1109\/PRNI.2011.15"},{"key":"148_CR61","doi-asserted-by":"crossref","unstructured":"SIAM J. Imag. Sci., 5(3): 835\u2013856. http:\/\/dx.doi.org\/10.1137\/110832380","DOI":"10.1137\/110832380"},{"issue":"3","key":"148_CR62","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1111\/j.1467-985X.2010.00646_6.x","volume":"173","author":"Z.Q. John Lu","year":"2010","unstructured":"John Lu, Z.Q., 2010. The elements of statistical learning: data mining, inference, and prediction. J. R. Stat. Soc. A, 173(3): 693\u2013694. http:\/\/dx.doi.org\/10.1111\/j.1467-985X.2010.00646_6.x","journal-title":"J. R. Stat. Soc. A"},{"issue":"4","key":"148_CR63","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1093\/biomet\/92.4.779","volume":"92","author":"B. Jones","year":"2005","unstructured":"Jones, B., West, M., 2005. Covariance decomposition in undirected Gaussian graphical models. Biometrika, 92(4): 779\u2013786. https:\/\/doi.org\/10.1093\/biomet\/92.4.779","journal-title":"Biometrika"},{"key":"148_CR64","first-page":"3533","volume-title":"Proc. ICASSP","author":"S. Karygianni","year":"2014","unstructured":"Karygianni, S., Frossard, P., 2014. Structured sparse coding for image denoising or pattern detection. Proc. ICASSP, p.3533\u20133537. http:\/\/dx.doi.org\/10.1109\/ICASSP.2014.6854258"},{"issue":"12","key":"148_CR65","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1016\/j.imavis.2013.10.005","volume":"31","author":"B.S. Kim","year":"2013","unstructured":"Kim, B.S., Park, J.Y., Gilbert, A.C., et al., 2013. Hierarchical classification of images by sparse approximation. Image Vis. Comput., 31(12): 982\u2013991. http:\/\/dx.doi.org\/10.1016\/j.imavis.2013.10.005","journal-title":"Image Vis. Comput."},{"key":"148_CR66","first-page":"543","volume-title":"Proc. ICML","author":"S. Kim","year":"2010","unstructured":"Kim, S., Xing, E.P., 2010. Tree-guided group Lasso for multi-task regression with structured sparsity. Proc. ICML, p.543\u2013550."},{"issue":"3","key":"148_CR67","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1214\/12-AOAS549","volume":"6","author":"S. Kim","year":"2012","unstructured":"Kim, S., Xing, E.P., 2012. Tree-guided group Lasso for multi-response regression with structured sparsity, with an application to eQTL mapping. Ann. Appl. Stat., 6(3): 1095\u20131117. http:\/\/dx.doi.org\/10.1214\/12-Aoas549","journal-title":"Ann. Appl. Stat."},{"issue":"4","key":"148_CR68","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/cmb.2009.0224","volume":"21","author":"S. Kim","year":"2014","unstructured":"Kim, S., Xing, E.P., 2014. Exploiting genome structure in association analysis. J. Comput. Biol., 21(4): 345\u2013360. http:\/\/dx.doi.org\/10.1089\/cmb.2009.0224","journal-title":"J. Comput. Biol."},{"key":"148_CR69","first-page":"407","volume-title":"Proc. AISTATS","author":"M. Kolar","year":"2011","unstructured":"Kolar, M., Xing, E.P., 2011. On time varying undirected graphs. Proc. AISTATS, p.407\u2013415."},{"issue":"8","key":"148_CR70","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y. Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C., 2009. Matrix factorization techniques for recommender systems. Computer, 42(8): 30\u201337. http:\/\/dx.doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"148_CR71","unstructured":"Lacoste-Julien, S., Schmidt, M., Bach, F., 2012. A simpler approach to obtaining an O(1\/t) convergence rate for the projected stochastic subgradient method. arXiv:1212.2002."},{"issue":"2","key":"148_CR72","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M.J. Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y.Y., Yin, W.T., 2013. Improved iteratively reweighted least squares for unconstrained smoothed lq minimization. SIAM J. Numer. Anal., 51(2): 927\u2013957. http:\/\/dx.doi.org\/10.1137\/110840364","journal-title":"SIAM J. Numer. Anal."},{"issue":"7","key":"148_CR73","doi-asserted-by":"crossref","first-page":"2720","DOI":"10.1007\/s11227-015-1415-y","volume":"71","author":"Z.Q. Lai","year":"2015","unstructured":"Lai, Z.Q., Lam, K.T., Wang, C.L., et al., 2015. Latencyaware DVFS for efficient power state transitions on many-core architectures. J. Supercomput., 71(7): 2720\u20132747. http:\/\/dx.doi.org\/10.1007\/s11227-015-1415-y","journal-title":"J. Supercomput."},{"key":"148_CR74","doi-asserted-by":"crossref","unstructured":"Lai, Z.Q., Lam, K.T., Wang, C.L., et al., 2016. PoweRock: power modeling and flexible dynamic power management for many-core architectures. IEEE Syst. J., in press. http:\/\/dx.doi.org\/10.1109\/JSYST.2015.2499307","DOI":"10.1109\/JSYST.2015.2499307"},{"issue":"499","key":"148_CR75","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1080\/01621459.2012.706133","volume":"107","author":"C.L. Leng","year":"2012","unstructured":"Leng, C.L., Tang, C.Y., 2012. Sparse matrix graphical models. J. Am. Stat. Assoc., 107(499): 1187\u20131200. http:\/\/dx.doi.org\/10.1080\/01621459.2012.706133","journal-title":"J. Am. Stat. Assoc."},{"key":"148_CR76","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.csda.2014.05.017","volume":"79","author":"X.X. Li","year":"2014","unstructured":"Li, X.X., Mo, L.L., Yuan, X.M., et al., 2014. Linearized alternating direction method of multipliers for sparse group and fused Lasso models. Comput. Stat. Data Anal., 79: 203\u2013221. http:\/\/dx.doi.org\/10.1016\/j.csda.2014.05.017","journal-title":"Comput. Stat. Data Anal."},{"key":"148_CR77","first-page":"3384","volume-title":"Proc. NIPS","author":"H.Z. Lin","year":"2015","unstructured":"Lin, H.Z., Mairal, J.L., Harchaoui, Z., 2015. A universal catalyst for first-order optimization. Proc. NIPS, p.3384\u20133392."},{"key":"148_CR78","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/1553374.1553458","volume-title":"Proc. ICML","author":"H. Liu","year":"2009","unstructured":"Liu, H., Palatucci, M., Zhang, J., 2009. Blockwise coordinate descent procedures for the multi-task Lasso, with applications to neural semantic basis discovery. Proc. ICML, p.649\u2013656. http:\/\/dx.doi.org\/10.1145\/1553374.1553458"},{"key":"148_CR79","unstructured":"Liu, J., Ji, S., Ye, J., 2009. SLEP: Sparse Learning with Efficient Projections. http:\/\/www.public.asu.edu\/~jye02\/Software\/SLEP"},{"issue":"8","key":"148_CR80","doi-asserted-by":"crossref","first-page":"2172","DOI":"10.1162\/NECO_a_00379","volume":"25","author":"S.Q. Ma","year":"2013","unstructured":"Ma, S.Q., Xue, L.Z., Zou, H., 2013. Alternating direction methods for latent variable Gaussian graphical model selection. Neur. Comput., 25(8): 2172\u20132198. http:\/\/dx.doi.org\/10.1162\/NECO_a_00379","journal-title":"Neur. Comput."},{"key":"148_CR81","unstructured":"Mairal, J., 2013. Optimization with first-order surrogate functions. Proc. ICML, p.783\u2013791."},{"key":"148_CR82","unstructured":"Mairal, J., Bach, F., Ponce, J., et al., 2011. SPAMS: SPArse Modeling Software. http:\/\/spams-devel.gforge.inria.fr\/"},{"issue":"2-3","key":"148_CR83","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1561\/0600000058","volume":"8","author":"J. Mairal","year":"2014","unstructured":"Mairal, J., Bach, F., Ponce, J., 2014. Sparse modeling for image and vision processing. Found. Trends Comput. Graph. Vis., 8(2-3):85\u2013283. http:\/\/dx.doi.org\/10.1561\/0600000058","journal-title":"Found. Trends Comput. Graph. Vis."},{"key":"148_CR84","volume-title":"A Wavelet Tour of Signal Processing: the Sparse Way","author":"S. Mallat","year":"2008","unstructured":"Mallat, S., 2008. A Wavelet Tour of Signal Processing: the Sparse Way (3rd Ed.). Elsevier\/Academic Press, Amsterdam."},{"issue":"5","key":"148_CR85","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1109\/TSA.2005.851952","volume":"13","author":"J. McAuley","year":"2005","unstructured":"McAuley, J., Ming, J., Stewart, D., et al., 2005. Subband correlation and robust speech recognition. IEEE Trans. Speech Audio Process., 13(5): 956\u2013964. http:\/\/dx.doi.org\/10.1109\/TSA.2005.851952","journal-title":"IEEE Trans. Speech Audio Process"},{"issue":"1","key":"148_CR86","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L. Meier","year":"2008","unstructured":"Meier, L., van de Geer, S., B\u00fchlmann, P., 2008. The group Lasso for logistic regression. J. R. Stat. Soc. B, 70(1): 53\u201371. http:\/\/dx.doi.org\/10.1111\/j.1467-9868.2007.00627.x","journal-title":"J. R. Stat. Soc. B"},{"issue":"3","key":"148_CR87","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1214\/009053606000000281","volume":"34","author":"N. Meinshausen","year":"2006","unstructured":"Meinshausen, N., B\u00fchlmann, P., 2006. High-dimensional graphs and variable selection with the Lasso. Ann. Stat., 34(3): 1436\u20131462. http:\/\/dx.doi.org\/10.1214\/009053606000000281","journal-title":"Ann. Stat."},{"issue":"1","key":"148_CR88","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1214\/07-AOS582","volume":"37","author":"N. Meinshausen","year":"2008","unstructured":"Meinshausen, N., Yu, B., 2008. Lasso-type recovery of sparse representations for high-dimensional data. Ann. Stat., 37(1): 246\u2013270. http:\/\/dx.doi.org\/10.1214\/07-AOS582","journal-title":"Ann. Stat."},{"issue":"3","key":"148_CR89","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10444-011-9245-9","volume":"38","author":"C.A. Micchelli","year":"2013","unstructured":"Micchelli, C.A., Morales, J.M., Pontil, M., 2013. Regularizers for structured sparsity. Adv. Comput. Math., 38(3): 455\u2013489. http:\/\/dx.doi.org\/10.1007\/s10444-011-9245-9","journal-title":"Adv. Comput. Math."},{"key":"148_CR90","first-page":"418","volume":"6322","author":"S. Mosci","year":"2010","unstructured":"Mosci, S., Rosasco, L., Santoro, M., et al., 2010. Solving structured sparsity regularization with proximal methods. LNCS, 6322: 418\u2013433. http:\/\/dx.doi.org\/10.1007\/978-3-642-15883-4_27","journal-title":"LNCS"},{"issue":"9","key":"148_CR91","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/j.jspi.2013.03.001","volume":"143","author":"M. Mougeot","year":"2013","unstructured":"Mougeot, M., Picard, D., Tribouley, K., 2013. Grouping strategies and thresholding for high dimensional linear models. J. Stat. Plan. Infer., 143(9): 1417\u20131438. http:\/\/dx.doi.org\/10.1016\/j.jspi.2013.03.001","journal-title":"J. Stat. Plan. Infer."},{"key":"148_CR92","volume-title":"Acoustic Model Selection for Recognition of Regional Accented Speech","author":"M. Najafian","year":"2016","unstructured":"Najafian, M., 2016. Acoustic Model Selection for Recognition of Regional Accented Speech. PhD Thesis, University of Birmingham, Birmingham, UK."},{"issue":"4","key":"148_CR93","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"S.N. Negahban","year":"2012","unstructured":"Negahban, S.N., Ravikumar, P., Wainwright, M.J., et al., 2012. A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. Stat. Sci., 27(4): 538\u2013557. http:\/\/dx.doi.org\/10.1214\/12-Sts400","journal-title":"Stat. Sci."},{"key":"148_CR94","doi-asserted-by":"crossref","unstructured":"Nemirovski, A., 2004. Prox-method with rate of convergence O(1\/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems.","DOI":"10.1137\/S1052623403425629"},{"key":"148_CR95","doi-asserted-by":"crossref","unstructured":"SIAM J. Optim., 15(1): 229\u2013251. http:\/\/dx.doi.org\/10.1137\/S1052623403425629","DOI":"10.1137\/S1052623403425629"},{"key":"148_CR96","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: a Basic Course","author":"Y. Nesterov","year":"2004","unstructured":"Nesterov, Y., 2004. Introductory Lectures on Convex Optimization: a Basic Course. Springer Science & Business Media. http:\/\/dx.doi.org\/10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"148_CR97","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2009","unstructured":"Nesterov, Y., 2009. Primal-dual subgradient methods for convex problems. Math. Program., 120(1): 221\u2013259. http:\/\/dx.doi.org\/10.1007\/s10107-007-0149-x","journal-title":"Math. Program."},{"issue":"3","key":"148_CR98","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N. Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S., 2014. Proximal algorithms. Found. Trends Optim., 1(3): 127\u2013239. http:\/\/dx.doi.org\/10.1561\/2400000003","journal-title":"Found. Trends Optim."},{"issue":"1","key":"148_CR99","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4310\/AMSA.2016.v1.n1.a2","volume":"1","author":"Zhimin Peng","year":"2016","unstructured":"Peng, Z.M., Wu, T.Y., Xu, Y.Y., et al., 2016. Coordinate friendly structures, algorithms and applications. arXiv:1601.00863.","journal-title":"Annals of Mathematical Sciences and Applications"},{"key":"148_CR100","doi-asserted-by":"crossref","unstructured":"Qiao, L.B., Lin, T.Y., Jiang, Y.G., et al., 2016a. On stochastic primal-dual hybrid gradient approach for compositely regularized minimization. Proc. European Conf. on Artificial Intelligence, p.167\u2013174. http:\/\/dx.doi.org\/10.3233\/978-1-61499-672-9-167","DOI":"10.3233\/978-1-61499-672-9-167"},{"key":"148_CR101","first-page":"97","volume-title":"Proc. Asian Conf. on Machine Learning","author":"L.B. Qiao","year":"2016","unstructured":"Qiao, L.B., Zhang, B.F., Su, J.S., et al., 2016b. Linearized alternating direction method of multipliers for constrained nonconvex regularized optimization. Proc. Asian Conf. on Machine Learning, p.97\u2013109."},{"key":"148_CR102","first-page":"283","volume-title":"Proc. Int. Conf. on Advanced Cloud and Big Data","author":"L.B. Qiao","year":"2016","unstructured":"Qiao, L.B., Zhang, B.F., Zhuang, L., et al., 2016c. An efficient algorithm for tensor principal component analysis via proximal linearized alternating direction method of multipliers. Proc. Int. Conf. on Advanced Cloud and Big Data, p.283\u2013288. http:\/\/dx.doi.org\/10.1109\/CBD.2016.056"},{"issue":"7","key":"148_CR103","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.sigpro.2011.01.012","volume":"91","author":"A. Rakotomamonjy","year":"2011","unstructured":"Rakotomamonjy, A., 2011. Surveying and comparing simultaneous sparse approximation (or group-Lasso) algorithms. Signal Process., 91(7): 1505\u20131526. http:\/\/dx.doi.org\/10.1016\/j.sigpro.2011.01.012","journal-title":"Signal Process"},{"key":"148_CR104","unstructured":"Rasmussen, C.E., Ghahramani, Z., 2001. Occam\u2019s razor. Proc. NIPS, p.294\u2013300."},{"key":"148_CR105","first-page":"81","volume-title":"Proc. 3rd ACM Int. Conf. on Web Wearch and Data Mining","author":"S. Rendle","year":"2010","unstructured":"Rendle, S., Schmidt-Thieme, L., 2010. Pairwise interaction tensor factorization for personalized tag recommendation. Proc. 3rd ACM Int. Conf. on Web Wearch and Data Mining, p.81\u201390. http:\/\/dx.doi.org\/10.1145\/1718487.1718498"},{"key":"148_CR106","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/1390156.1390263","volume-title":"Proc. ICML","author":"V. Roth","year":"2008","unstructured":"Roth, V., Fischer, B., 2008. The group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms. Proc. ICML, p.848\u2013855. http:\/\/dx.doi.org\/10.1145\/1390156.1390263"},{"issue":"1-4","key":"148_CR107","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"L.I. Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E., 1992. Nonlinear total variation based noise removal algorithms. Phys. D, 60(1-4):259\u2013268. http:\/\/dx.doi.org\/10.1016\/0167-2789(92)90242-F","journal-title":"Phys. D"},{"key":"148_CR108","first-page":"2101","volume-title":"Proc. NIPS","author":"K. Scheinberg","year":"2010","unstructured":"Scheinberg, K., Ma, S., Goldfarb, D., 2010. Sparse inverse covariance selection via alternating linearization methods. Proc. NIPS, p.2101\u20132109."},{"issue":"5","key":"148_CR109","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1109\/TSP.2014.2298839","volume":"62","author":"I.W. Selesnick","year":"2014","unstructured":"Selesnick, I.W., Bayram, I., 2014. Sparse signal estimation by maximally sparse convex optimization. IEEE Trans. Signal Process., 62(5): 1078\u20131092. http:\/\/dx.doi.org\/10.1109\/TSP.2014.2298839","journal-title":"IEEE Trans. Signal Process"},{"issue":"2","key":"148_CR110","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N. Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., et al., 2013. A sparsegroup Lasso. J. Comput. Graph. Stat., 22(2): 231\u2013245. http:\/\/dx.doi.org\/10.1080\/10618600.2012.681250","journal-title":"J. Comput. Graph. Stat."},{"key":"148_CR111","unstructured":"Su, W.J., Boyd, S., Cand\u00e8s, E., 2014. A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. Proc. NIPS, p.2510\u20132518."},{"key":"148_CR112","first-page":"467","volume":"9204","author":"Y.P. Sun","year":"2015","unstructured":"Sun, Y.P., Chen, S.H., Han, B., et al., 2015a. A novel location privacy mining threat in vehicular Internet access service. LNCS, 9204: 467\u2013476. http:\/\/dx.doi.org\/10.1007\/978-3-319-21837-3_46","journal-title":"LNCS"},{"issue":"6","key":"148_CR113","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1007\/s12083-014-0269-z","volume":"8","author":"Y.P. Sun","year":"2015","unstructured":"Sun, Y.P., Zhang, B.F., Zhao, B.K., et al., 2015b. Mix-zones optimal deployment for protecting location privacy in VANET. Peer-to-Peer Netw. Appl., 8(6): 1108\u20131121. http:\/\/dx.doi.org\/10.1007\/s12083-014-0269-z","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"148_CR114","unstructured":"Suzuki, T.J., 2013. Dual averaging and proximal gradient descent for online alternating direction multiplier method. Proc. ICML, p.392\u2013400."},{"key":"148_CR115","first-page":"623","volume":"10","author":"G. Takacs","year":"2009","unstructured":"Takacs, G., Pilaszy, I., Nemeth, B., et al., 2009. Scalable collaborative filtering approaches for large recommender systems. J. Mach. Learn. Res., 10: 623\u2013656.","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"148_CR116","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(1): 267\u2013288.","journal-title":"J. R. Stat. Soc. B"},{"issue":"1","key":"148_CR117","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1093\/biostatistics\/kxm013","volume":"9","author":"R. Tibshirani","year":"2008","unstructured":"Tibshirani, R., Wang, P., 2008. Spatial smoothing and hot spot detection for CGH data using the fused Lasso. Biostatistics, 9(1): 18\u201329. http:\/\/dx.doi.org\/10.1093\/biostatistics\/kxm013","journal-title":"Biostatistics"},{"issue":"1","key":"148_CR118","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R. Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., et al., 2005. Sparsity and smoothness via the fused Lasso. J. R. Stat. Soc. B, 67(1): 91\u2013108. http:\/\/dx.doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. R. Stat. Soc. B"},{"key":"148_CR119","unstructured":"Toh, K., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H., 2006. SDPT3 Version 4.0: a Matlab Software for Semidefinite-Quadratic-Linear Programming. http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html"},{"issue":"10","key":"148_CR120","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J.A. Tropp","year":"2004","unstructured":"Tropp, J.A., 2004. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10): 2231\u20132242. http:\/\/dx.doi.org\/10.1109\/Tit.2004.834793","journal-title":"IEEE Trans. Inform. Theory"},{"key":"148_CR121","first-page":"37","volume-title":"Proc. Int. Conf. on Image Processing","author":"J.A. Tropp","year":"2003","unstructured":"Tropp, J.A., Gilbert, A.C., Muthukrishnan, S., et al., 2003. Improved sparse approximation over quasi-incoherent dictionaries. Proc. Int. Conf. on Image Processing, p.37\u201340. http:\/\/dx.doi.org\/10.1109\/ICIP.2003.1246892"},{"key":"148_CR122","unstructured":"Tseng, P., 2008. On Accelerated Proximal Gradient Methods for Convex-Concave Optimization. http:\/\/www.mit.edu\/~dimitrib\/PTseng\/papers\/apgm.pdf"},{"issue":"1","key":"148_CR123","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P. Tseng","year":"2009","unstructured":"Tseng, P., Yun, S., 2009. A coordinate gradient descent method for nonsmooth separable minimization. Math. Program., 117(1): 387\u2013423. http:\/\/dx.doi.org\/10.1007\/s10107-007-0170-0","journal-title":"Math. Program."},{"key":"148_CR124","unstructured":"van den Berg, E., Friedlander, M.P., 2007. SPGL1: a Solver for Large-Scale Sparse Reconstruction. http:\/\/www.cs.ubc.ca\/labs\/scl\/spgl1"},{"issue":"2","key":"148_CR125","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10589-013-9628-6","volume":"58","author":"S. Villa","year":"2014","unstructured":"Villa, S., Rosasco, L., Mosci, S., et al., 2014. Proximal methods for the latent group Lasso penalty. Compt. Optim. Appl., 58(2): 381\u2013407. http:\/\/dx.doi.org\/10.1007\/s10589-013-9628-6","journal-title":"Compt. Optim. Appl."},{"key":"148_CR126","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.csda.2013.06.004","volume":"71","author":"M. Vincent","year":"2014","unstructured":"Vincent, M., Hansen, N.R., 2014. Sparse group Lasso and high dimensional multinomial classification. Comput. Stat. Data Anal., 71: 771\u2013786. http:\/\/dx.doi.org\/10.1016\/j.csda.2013.06.004","journal-title":"Comput. Stat. Data Anal."},{"issue":"1-2","key":"148_CR127","first-page":"1","volume":"1","author":"M.J. Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I., 2008. Graphical models, exponential families, and variational inference. Found. Trend. Mach. Learn., 1(1-2):1\u2013305. http:\/\/dx.doi.org\/10.1561\/2200000001","journal-title":"Found. Trend. Mach. Learn."},{"issue":"12","key":"148_CR128","doi-asserted-by":"crossref","first-page":"5277","DOI":"10.1016\/j.csda.2008.05.006","volume":"52","author":"H.S. Wang","year":"2008","unstructured":"Wang, H.S., Leng, C.L., 2008. A note on adaptive group Lasso. Comput. Stat. Data Anal., 52(12): 5277\u20135286. http:\/\/dx.doi.org\/10.1016\/j.csda.2008.05.006","journal-title":"Comput. Stat. Data Anal."},{"issue":"4","key":"148_CR129","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1007\/s00180-012-0373-6","volume":"28","author":"L.C. Wang","year":"2013","unstructured":"Wang, L.C., You, Y., Lian, H., 2013. A simple and efficient algorithm for fused Lasso signal approximator with convex loss function. Comput. Stat., 28(4): 1699\u20131714. http:\/\/dx.doi.org\/10.1007\/s00180-012-0373-6","journal-title":"Comput. Stat."},{"key":"148_CR130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1687-6180-2013-1","volume":"2013","author":"Y. Wang","year":"2013","unstructured":"Wang, Y., Wang, J.J., Xu, Z.B., 2013. On recovery of blocksparse signals via mixed 2\/q (0 < q = 1) norm minimization. EURASIP J. Adv. Signal Process., 2013:1\u201317. http:\/\/dx.doi.org\/10.1186\/1687-6180-2013-76","journal-title":"EURASIP J. Adv. Signal Process"},{"key":"148_CR131","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-1-4614-0769-0_19","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"Z. Wen","year":"2012","unstructured":"Wen, Z., Goldfarb, D., Scheinberg, K., 2012. Block coordinate descent methods for semidefinite programming. In: Anjos, M.F., Lasserre, J.B. (Eds.), Handbook on Semidefinite, Conic and Polynomial Optimization. Springer US, Boston, p.533\u2013564. http:\/\/dx.doi.org\/10.1007\/978-1-4614-0769-0_19"},{"key":"148_CR132","doi-asserted-by":"crossref","first-page":"95","DOI":"10.2307\/2529341","volume":"32","author":"N. Wermuth","year":"1976","unstructured":"Wermuth, N., 1976. Analogies between multiplicative models for contingency tables and covariance selection. Biometrics, 32: 95\u2013108.","journal-title":"Biometrics"},{"key":"148_CR133","doi-asserted-by":"crossref","unstructured":"Wille, A., B\u00fc hlmann, P., 2006. Low-order conditional independence graphs for inferring genetic networks. Stat. Appl. Genet. Mol. Biol., 5(1). http:\/\/dx.doi.org\/10.2202\/1544-6115.1170","DOI":"10.2202\/1544-6115.1170"},{"issue":"249","key":"148_CR134","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/14786442108633773","volume":"42","author":"D. Wrinch","year":"1921","unstructured":"Wrinch, D., Jeffreys, H., 1921. On certain fundamental principles of scientific inquiry. Phil. Mag., 42(249): 369\u2013390. http:\/\/dx.doi.org\/10.1080\/14786442108633773","journal-title":"Phil. Mag."},{"key":"148_CR135","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/s10916-016-0609-z","volume":"40","author":"Y.L. Wu","year":"2016","unstructured":"Wu, Y.L., Lu, X.C., Su, J.S., et al., 2016. An efficient searchable encryption against keyword guessing attacks for sharable electronic medical records in cloud-based system. J. Med. Syst., 40:258. http:\/\/dx.doi.org\/10.1007\/s10916-016-0609-z","journal-title":"J. Med. Syst."},{"key":"148_CR136","first-page":"121","volume":"9908","author":"J.J. Xiao","year":"2016","unstructured":"Xiao, J.J., Qiao, L.B., Stolkin, R., et al., 2016. Distractorsupported single target tracking in extremely cluttered scenes. LNCS, 9908: 121\u2013136. http:\/\/dx.doi.org\/10.1007\/978-3-319-46493-0_8","journal-title":"LNCS"},{"key":"148_CR137","doi-asserted-by":"crossref","unstructured":"Xiao, L., Zhang, T., 2014. A proximal stochastic gradient method with progressive variance reduction.","DOI":"10.1137\/140961791"},{"key":"148_CR138","doi-asserted-by":"crossref","unstructured":"SIAM J. Optim., 24(4): 2057\u20132075. http:\/\/dx.doi.org\/10.1137\/140961791","DOI":"10.1137\/140961791"},{"issue":"1","key":"148_CR139","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1631\/FITEE.1500171","volume":"17","author":"H. Xie","year":"2016","unstructured":"Xie, H., Tong, R.F., 2016. Image meshing via hierarchical optimization. Front. Inform. Technol. Electron. Eng., 17(1): 32\u201340. http:\/\/dx.doi.org\/10.1631\/FITEE.1500171","journal-title":"Front. Inform. Technol. Electron. Eng."},{"issue":"9","key":"148_CR140","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1631\/FITEE.1601063","volume":"17","author":"Y.C. Xie","year":"2016","unstructured":"Xie, Y.C., Huang, H., Hu, Y., et al., 2016. Applications of advanced control methods in spacecrafts: progress, challenges, and future prospects. Front. Inform. Technol. Electron. Eng., 17(9): 841\u2013861. http:\/\/dx.doi.org\/10.1631\/FITEE.1601063","journal-title":"Front. Inform. Technol. Electron. Eng."},{"issue":"2","key":"148_CR141","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s13042-013-0156-6","volume":"5","author":"Z.X. Xie","year":"2014","unstructured":"Xie, Z.X., Xu, Y., 2014. Sparse group Lasso based uncertain feature selection. Int. J. Mach. Learn. Cybern., 5(2): 201\u2013210. http:\/\/dx.doi.org\/10.1007\/s13042-013-0156-6","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"148_CR142","first-page":"1022","volume":"3619","author":"X. Xu","year":"2005","unstructured":"Xu, X., Zhang, B.F., Zhong, Q.X., 2005. Text categorization using SVMs with Rocchio ensemble for Internet information classification. LNCS, 3619: 1022\u20131031. http:\/\/dx.doi.org\/10.1007\/11534310_107","journal-title":"LNCS"},{"issue":"4","key":"148_CR143","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/TNN.2007.899161","volume":"18","author":"X. Xu","year":"2007","unstructured":"Xu, X., Hu, D.W., Lu, X.C., 2007. Kernel-based least squares policy iteration for reinforcement learning. IEEE Trans. Neur. Netw., 18(4): 973\u2013992. http:\/\/dx.doi.org\/10.1109\/tnn.2007.899161","journal-title":"IEEE Trans. Neur. Netw."},{"issue":"12","key":"148_CR144","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1109\/TNN.2011.2168422","volume":"22","author":"X. Xu","year":"2011","unstructured":"Xu, X., Liu, C.M., Yang, S.X., et al., 2011. Hierarchical approximate policy iteration with binary-tree state space decomposition. IEEE Trans. Neur. Netw., 22(12): 1863\u20131877. http:\/\/dx.doi.org\/10.1109\/tnn.2011.2168422","journal-title":"IEEE Trans. Neur. Netw."},{"issue":"7","key":"148_CR145","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z. Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., et al., 2012. L1\/2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neur. Netw. Learn. Syst., 23(7): 1013\u20131027. http:\/\/dx.doi.org\/10.1109\/TNNLS.2012.2197412","journal-title":"IEEE Trans. Neur. Netw. Learn. Syst."},{"key":"148_CR146","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"J.F. Yang","year":"2013","unstructured":"Yang, J.F., Yuan, X.M., 2013. Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput., 82: 301\u2013329. http:\/\/dx.doi.org\/10.1090\/S0025-5718-2012-02598-1","journal-title":"Math. Comput."},{"issue":"4","key":"148_CR147","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s11704-010-0383-x","volume":"4","author":"X.J. Yang","year":"2010","unstructured":"Yang, X.J., Liao, X.K., Xu, W.X., et al., 2010. Th-1: China\u2019s first petaflop supercomputer. Front. Comput. Sci. China, 4(4): 445\u2013455. http:\/\/dx.doi.org\/10.1007\/s11704-010-0383-x","journal-title":"Front. Comput. Sci. China"},{"issue":"3","key":"148_CR148","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/s02011-011-1137-8","volume":"26","author":"X.J. Yang","year":"2011","unstructured":"Yang, X.J., Liao, X.K., Lu, K., et al., 2011. The TianHe-1A supercomputer: its hardware and software. J. Comput. Sci. Technol., 26(3): 344\u2013351. http:\/\/dx.doi.org\/10.1007\/s11390-011-1137-4","journal-title":"J. Comput. Sci. Technol."},{"issue":"4","key":"148_CR149","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1016\/j.csda.2010.10.021","volume":"55","author":"G.B. Ye","year":"2011","unstructured":"Ye, G.B., Xie, X.H., 2011. Split Bregman method for large scale fused Lasso. Comput. Stat. Data Anal., 55(4): 1552\u20131569. http:\/\/dx.doi.org\/10.1016\/j.csda.2010.10.021","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"148_CR150","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. B, 68(1): 49\u201367. http:\/\/dx.doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"J. R. Stat. Soc. B"},{"issue":"1","key":"148_CR151","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/biomet\/asm018","volume":"94","author":"M. Yuan","year":"2007","unstructured":"Yuan, M., Lin, Y., 2007. Model selection and estimation in the Gaussian graphical model. Biometrika, 94(1): 19\u201335. http:\/\/dx.doi.org\/10.1093\/biomet\/asm018","journal-title":"Biometrika"},{"issue":"12","key":"148_CR152","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1631\/FITEE.1400423","volume":"16","author":"M. Yuan","year":"2015","unstructured":"Yuan, M., Yang, B.X., Ma, Y.D., et al., 2015. Multi-scale UDCT dictionary learning based highly undersampled MRimage reconstruction using patch-based constraint splitting augmented Lagrangian shrinkage algorithm. Front. Inform. Technol. Electron. Eng., 16(12): 1069\u20131087. http:\/\/dx.doi.org\/10.1631\/FITEE.1400423","journal-title":"Front. Inform. Technol. Electron. Eng."},{"key":"148_CR153","first-page":"2581","volume-title":"Proc. ICMLC","author":"B.F. Zhang","year":"2006","unstructured":"Zhang, B.F., Su, J.S., Xu, X., 2006. A class-incremental learning method for multi-class support vector machines in text classification. Proc. ICMLC, p.2581\u20132585. http:\/\/dx.doi.org\/10.1109\/ICMLC.2006.258853"},{"issue":"2","key":"148_CR154","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C.H. Zhang","year":"2010","unstructured":"Zhang, C.H., 2010. Nearly unbiased variable selection under minimax concave penalty. Ann. Stat., 38(2): 894\u2013942. http:\/\/dx.doi.org\/10.1214\/09-AOS729","journal-title":"Ann. Stat."},{"key":"148_CR155","first-page":"1","volume":"7036","author":"S.Z. Zhang","year":"2011","unstructured":"Zhang, S.Z., Wang, K., Chen, B.L., et al., 2011. A new framework for co-clustering of gene expression data. LNCS, 7036: 1\u201312. http:\/\/dx.doi.org\/10.1007\/978-3-642-24855-9_1","journal-title":"LNCS"},{"issue":"5A","key":"148_CR156","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T. Zhang","year":"2009","unstructured":"Zhang, T., 2009. Some sharp performance bounds for least squares regression with L1 regularization. Ann. Stat., 37(5A):2109\u20132144. http:\/\/dx.doi.org\/10.1214\/08-AOS659","journal-title":"Ann. Stat."},{"key":"148_CR157","first-page":"1081","volume":"11","author":"T. Zhang","year":"2010","unstructured":"Zhang, T., 2010. Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res., 11: 1081\u20131107.","journal-title":"J. Mach. Learn. Res."},{"issue":"5B","key":"148_CR158","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.3150\/12-BEJ452","volume":"19","author":"T. Zhang","year":"2013","unstructured":"Zhang, T., 2013. Multi-stage convex relaxation for feature selection. Bernoulli, 19(5B):2277\u20132293. http:\/\/dx.doi.org\/10.3150\/12-BEJ452","journal-title":"Bernoulli"},{"key":"148_CR159","first-page":"2042","volume-title":"Proc. CVPR","author":"T.Z. Zhang","year":"2012","unstructured":"Zhang, T.Z., Ghanem, B., Liu, S., et al., 2012. Robust visual tracking via multi-task sparse learning. Proc. CVPR, p.2042\u20132049. http:\/\/dx.doi.org\/10.1109\/CVPR.2012.6247908"},{"issue":"2","key":"148_CR160","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s11263-012-0582-z","volume":"101","author":"T.Z. Zhang","year":"2013","unstructured":"Zhang, T.Z., Ghanem, B., Liu, S., et al., 2013. Robust visual tracking via structured multi-task sparse learning. Int. J. Comput. Vis., 101(2): 367\u2013383. http:\/\/dx.doi.org\/10.1007\/s11263-012-0582-z","journal-title":"Int. J. Comput. Vis."},{"key":"148_CR161","first-page":"1258","volume-title":"Proc. CVPR","author":"T.Z. Zhang","year":"2014","unstructured":"Zhang, T.Z., Jia, K., Xu, C.S., et al., 2014. Partial occlusion handling for visual tracking via robust part matching. Proc. CVPR, p.1258\u20131265. http:\/\/dx.doi.org\/10.1109\/CVPR.2014.164"},{"issue":"2","key":"148_CR162","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s11263-014-0738-0","volume":"111","author":"T.Z. Zhang","year":"2015","unstructured":"Zhang, T.Z., Liu, S., Ahuja, N., et al., 2015a. Robust visual tracking via consistent low-rank sparse learning. Int. J. Comput. Vis., 111(2): 171\u2013190. http:\/\/dx.doi.org\/10.1007\/s11263-014-0738-0","journal-title":"Int. J. Comput. Vis."},{"key":"148_CR163","first-page":"150","volume-title":"Proc. CVPR","author":"T.Z. Zhang","year":"2015","unstructured":"Zhang, T.Z., Liu, S., Xu, C.S., et al., 2015b. Structural sparse tracking. Proc. CVPR, p.150\u2013158. http:\/\/dx.doi.org\/10.1109\/CVPR.2015.7298610"},{"key":"148_CR164","unstructured":"Zhang, Y., Yang, J., Yin, W., 2011. YALL1: Your Algorithms for L1. http:\/\/yall1.blogs.rice.edu"},{"key":"148_CR165","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s11390-011-0176-1","volume":"26","author":"Z.K. Zhang","year":"2011","unstructured":"Zhang, Z.K., Zhou, T., Zhang, Y.C., 2011. Tag-aware recommender systems: a state-of-the-art survey. J. Comput. Sci. Technol., 26: 767\u2013777. http:\/\/dx.doi.org\/10.1007\/s11390-011-0176-1","journal-title":"J. Comput. Sci. Technol."},{"key":"148_CR166","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":"148_CR167","first-page":"2701","volume":"8","author":"P. Zhao","year":"2007","unstructured":"Zhao, P., Yu, B., 2007. Stagewise Lasso. J. Mach. Learn. Res., 8: 2701\u20132726.","journal-title":"J. Mach. Learn. Res."},{"issue":"6a","key":"148_CR168","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. The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat., 37(6a):3468\u20133497. http:\/\/dx.doi.org\/10.1214\/07-Aos584","journal-title":"Ann. Stat."},{"issue":"11","key":"148_CR169","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1631\/FITEE.1601112","volume":"17","author":"Y.T. Zhu","year":"2016","unstructured":"Zhu, Y.T., Zhao, Y.B., Liu, J., et al., 2016. Low complexity robust adaptive beamforming for general-rank signal model with positive semidefinite constraint. Front. Inform. Technol. Electron. Eng., 17(11): 1245\u20131252. http:\/\/dx.doi.org\/10.1631\/FITEE.1601112","journal-title":"Front. Inform. Technol. Electron. Eng."}],"container-title":["Frontiers of Information Technology &amp; Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1631\/FITEE.1601489\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1601489.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1601489.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:00Z","timestamp":1750200060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1631\/FITEE.1601489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":169,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1631\/fitee.1601489","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"value":"2095-9184","type":"print"},{"value":"2095-9230","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}