{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T13:31:08Z","timestamp":1763904668792},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T00:00:00Z","timestamp":1459555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100013785","name":"FOSTECT","doi-asserted-by":"crossref","award":["FOSTECT.2015.BR.15."],"award-info":[{"award-number":["FOSTECT.2015.BR.15."]}],"id":[{"id":"10.13039\/501100013785","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10489-016-0778-y","type":"journal-article","created":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T05:02:17Z","timestamp":1459573337000},"page":"549-565","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient approaches for \u2113 2-\u2113 0 regularization and applications to feature selection in SVM"],"prefix":"10.1007","volume":"45","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]},{"given":"Mamadou","family":"Thiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"issue":"1","key":"778_CR1","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 Imag Sci 2(1):183\u2013202","journal-title":"SIAM J Imag Sci"},{"key":"778_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"KP Bennett","year":"1992","unstructured":"Bennett KP, Mangasarian OL (1992) Robust linear programming discrimination of two linearly inseparable. sets Opt Meth Soft 1:23\u201334","journal-title":"sets Opt Meth Soft"},{"key":"778_CR3","unstructured":"Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In ICML 1998:82\u201390"},{"key":"778_CR4","doi-asserted-by":"crossref","unstructured":"Candes E, Wakin M, Boyd S (2008) Enhancing sparsity by reweighted l1 minimization. J Four Anal Appli","DOI":"10.21236\/ADA528514"},{"issue":"2","key":"778_CR5","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1214\/11-AOAS514","volume":"6","author":"X Chen","year":"2012","unstructured":"Chen X, Lin Q, Kim S, Carbonel JC, Xing EP (2012) Smoothing proximal gradient method for general structured sparse regression. Ann Appl Stat 6(2):719\u2013752","journal-title":"Ann Appl Stat"},{"issue":"5","key":"778_CR6","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen X, Xu FM, Ye Y (2010) Lower bound theory of nonzero entries in solutions of l2-lp minimization. SIAM J Sci Comp 32(5):2832\u20132852","journal-title":"SIAM J Sci Comp"},{"key":"778_CR7","doi-asserted-by":"crossref","unstructured":"Collober R, Sinz F, Weston J, Bottou L (2006) Trading convexity for scalability. In: Proceedings of the 23th International Conference on Machine Learning (ICML 2006). Pittsburgh, PA","DOI":"10.1145\/1143844.1143870"},{"key":"778_CR8","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support vector networks. Mach Learn 20:273\u2013297","journal-title":"Mach Learn"},{"key":"778_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM (1977) Maximum likelihood from incomplete data via the em algorithm. J Roy Stat Soc B 39:1\u201338","journal-title":"J Roy Stat Soc B"},{"issue":"456","key":"778_CR10","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J Amer Stat Ass 96(456):1348\u20131360","journal-title":"J Amer Stat Ass"},{"key":"778_CR11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu WJ (1998) Penalized regression: the bridge versus the lasso. J Comp Graph Stat 7:397\u2013416","journal-title":"J Comp Graph Stat"},{"key":"778_CR12","doi-asserted-by":"crossref","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso G, Rakotomamonjy A, Canu S (2009) Recovering sparse signals with a certain family of nonconvex penalties and dc programming. IEEE Trans Sign Proc 57:4686\u20134698","journal-title":"IEEE Trans Sign Proc"},{"key":"778_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1126\/science.286.5439.531","volume":"286","author":"TR Golub","year":"1999","unstructured":"Golub TR., Slonim DK., Tamayo P, Huard C, Gaasenbeek M, Mesirov JP., Coller H, Loh ML., Downing JR., Caligiuri MA., Bloomfield CD., Lander ES. (1999) Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Sci 286:531\u2013537","journal-title":"Sci"},{"key":"778_CR14","first-page":"4963","volume":"62","author":"GJ Gordon","year":"2002","unstructured":"Gordon GJ, Jensen RV, Hsiao L, Gullans SR, Blumenstock FE, Ramaswamy R, Richard WG, Sugarbaker DJ, Bueno R (2002) Translation of microarray data into clinically relevant cancer diagnostic tests using gene expression ratios in lung cancer and mesothelioma. Cancer Res 62:4963\u20134967","journal-title":"Cancer Res"},{"key":"778_CR15","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.csda.2013.01.020","volume":"67","author":"A Guan","year":"2013","unstructured":"Guan A, Gray W (2013) Sparse high-dimensional fractional-norm support vector machine via dc programming. Comput Stat Data Anal 67:136\u2013148","journal-title":"Comput Stat Data Anal"},{"key":"778_CR16","doi-asserted-by":"crossref","unstructured":"Guyon I, Gunn S, Nikravesh M, Zadeh L (2006) Feature Extractions and Applications","DOI":"10.1007\/978-3-540-35488-8"},{"key":"778_CR17","doi-asserted-by":"crossref","unstructured":"Hastie T, Tibshirani R, Friedman J (2009) The elements of statistical learning. springer, Heidelberg 2th edition","DOI":"10.1007\/978-0-387-84858-7"},{"key":"778_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"AE Hoerl","year":"1970","unstructured":"Hoerl AE, Kennard R (1970) Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12:55\u2013 67","journal-title":"Technometrics"},{"key":"778_CR19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.neucom.2014.11.051","volume":"153","author":"HM Le","year":"2015","unstructured":"Le HM, Le Thi HA, Nguyen MC (2015) Sparse semi-supervised support vector machines by DC programming and DCA. Neurocomputing 153:62\u201376","journal-title":"Neurocomputing"},{"key":"778_CR20","unstructured":"Le Thi HA DC programming and DCA. http:\/\/www.lita.univ-lorraine.fr\/~lethi\/index.php\/dca.html"},{"key":"778_CR21","doi-asserted-by":"publisher","unstructured":"Le Thi HA, Le HM, Pham Dinh T Feature selection in machine learning: an exact penalty approach using a difference of convex functions algorithm. Mach learn. doi: 10.1007\/s10994-014-5455-y . Online July 2014","DOI":"10.1007\/s10994-014-5455-y"},{"key":"778_CR22","doi-asserted-by":"crossref","unstructured":"Le Thi HA, Nguyen VV, Ouchani S (2008) Gene selection for cancer classification using DCA. Adv Dat Min Appl LNCS 5139:62\u201372","DOI":"10.1007\/978-3-540-88192-6_8"},{"key":"778_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi HA, Pham Dinh T (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world non convex optimization problems. Ann Oper Res 133:23\u201346","journal-title":"Ann Oper Res"},{"issue":"1","key":"778_CR24","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"44","author":"HA Le Thi","year":"2015","unstructured":"Le Thi HA, Pham Dinh T, Le HM., Vo Xuan T (2015) DC Approximation approaches for sparse optimization. EJOR 44(1):26\u201346","journal-title":"EJOR"},{"key":"778_CR25","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.neunet.2014.06.011","volume":"59","author":"HA Le Thi","year":"2014","unstructured":"Le Thi HA, Vo Xuan T, Pham Dinh T (2014) Feature selection for linear svms under uncertain data: robust optimization based on difference of convex functions algorithms. Neural Netw 59:36\u201350","journal-title":"Neural Netw"},{"key":"778_CR26","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-642-36543-0_40","volume":"7803","author":"H Le Thi","year":"2013","unstructured":"Le Thi H, Nguyen B, Le HM (2013) Sparse signal recovery by difference of convex functions algorithms. In in Intelligent Information and Database Systems. Lect Notes Comput Sci 7803:387\u2013 397","journal-title":"Lect Notes Comput Sci"},{"key":"778_CR27","first-page":"1","volume":"2","author":"HA Le Thi","year":"2007","unstructured":"Le Thi HA, Le HM, Pham Dinh T (2007) Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. Journal of Advances in Data Analysis and Classification 2:1\u201320","journal-title":"Journal of Advances in Data Analysis and Classification"},{"issue":"1","key":"778_CR28","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"H Le Thi","year":"2014","unstructured":"Le Thi H, Le HM, Pham Dinh T (2014) New and efficient dca based algorithms for minimum sum-of-squares clustering. Pattern Recogn 47(1):388\u2013401","journal-title":"Pattern Recogn"},{"issue":"10","key":"778_CR29","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1162\/NECO_a_00490","volume":"25","author":"H Le Thi","year":"2013","unstructured":"Le Thi H, Le HM, Pham Dinh T, Huynh VN (2013) Block clustering based on DC programming and DCA. Neural Comput 25(10):2776\u20132807","journal-title":"Neural Comput"},{"key":"778_CR30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Le Thi","year":"2008","unstructured":"Le Thi HA, Le Hoai M, Nguyen VV (2008) A DC programming approach for feature selection in support vector machines learning. J Adv Dat Anal Class 2:259\u2013278","journal-title":"J Adv Dat Anal Class"},{"key":"778_CR31","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10994-005-1505-9","volume":"61","author":"J Neumann","year":"2005","unstructured":"Neumann J, Schn\u00f6rr C, Steidl G (2005) Combined svm-based feature selection and classification. Mach Learn 61:129\u2013 150","journal-title":"Mach Learn"},{"key":"778_CR32","doi-asserted-by":"publisher","unstructured":"Ong CS, Le Thi HA Learning with sparsity by difference of convex functions algorithm. J Optimization Methods Software. doi: 10.1080\/10556788.2011.652630:14 . Press 27 February 2012","DOI":"10.1080\/10556788.2011.652630:14"},{"issue":"2","key":"778_CR33","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.sigpro.2007.08.015","volume":"8","author":"D Peleg","year":"2008","unstructured":"Peleg D, Meir R (2008) A bilinear formulation for vector sparsity optimization. Signal Processing 8 (2):375\u2013389","journal-title":"Signal Processing"},{"issue":"1","key":"778_CR34","first-page":"287","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh T, Le Thi HA (1997) Convex analysis approaches to dc programming: Theory, algorithms and applications. Acta Mathematica Vietnamica 22(1):287\u2013367","journal-title":"Acta Mathematica Vietnamica"},{"key":"778_CR35","unstructured":"Pham Dinh T, Le Thi HA (1998) D.c. optimization algorithms for solving the trust region subproblem. SIAM J Optim:476\u2013505"},{"issue":"3","key":"778_CR36","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/TSP.2002.808076","volume":"51","author":"BD Rao","year":"2003","unstructured":"Rao BD, Engan K, Cotter SF, Palmer J, Kreutz-Delgado K (2003) Subset selection in noise based on diversity measure minimization. IEEE Trans Signal Process 51(3):760\u2013770","journal-title":"IEEE Trans Signal Process"},{"key":"778_CR37","first-page":"87","volume":"47","author":"BD Rao","year":"1999","unstructured":"Rao BD, Kreutz-Delgado K (1999) An affine scaling methodology for best basis selection. IEEE Trans Signal Process 47:87\u2013200","journal-title":"IEEE Trans Signal Process"},{"key":"778_CR38","doi-asserted-by":"crossref","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press","DOI":"10.1515\/9781400873173"},{"key":"778_CR39","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S1535-6108(02)00030-2","volume":"1","author":"D Singh","year":"2002","unstructured":"Singh D, Febbo PG, Ross K, Jackson DG, Manola J, Ladd C, Tamayo P, Renshaw AA, D\u2019Amico AV, Richie JP, Lander ES, Loda M, Kantoff PW, Golub TR, Sellers WR (2002) Gene expression correlates of clinical prostate cancer behavior. Cancer Cell 1:203\u2013209","journal-title":"Cancer Cell"},{"key":"778_CR40","unstructured":"Thiao M, Pham Dinh T, Le Thi HA (2008) Dc programming approach for a class of nonconvex programs involving l0 norm. In: Modelling Computation and Optimization in Information Systems and Management Sciences, Communications in Computer and Information Science CCIS, Springer, vol 14, pp 358\u2013367"},{"key":"778_CR41","first-page":"431","volume":"46","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage selection via the lasso. J Roy Stat Regression Soc 46:431\u2013439","journal-title":"J Roy Stat Regression Soc"},{"issue":"1","key":"778_CR42","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. Mathematical Programming 117(1):387\u2013423","journal-title":"Mathematical Programming"},{"key":"778_CR43","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston J, Elisseeff A, Scholkopf B, Tipping M (2003) Use of the zero-norm with linear models and kernel methods. J Mach Learn Res 3:1439\u20131461","journal-title":"J Mach Learn Res"},{"key":"778_CR44","unstructured":"Yuille AL, Rangarajan A (2002) The Convex Concave Procedure (Cccp) Advances in Neural Information Processing System, vol 14. MIT Press, Cambrige MA"},{"key":"778_CR45","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 Statist 37:2109\u20132144","journal-title":"Ann Statist"},{"key":"778_CR46","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou H (2006) The adaptive lasso and its oracle properties. J Amer Stat Ass 101:1418\u20131429","journal-title":"J Amer Stat Ass"},{"issue":"4","key":"778_CR47","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1214\/009053607000000802","volume":"36","author":"H Zou","year":"2008","unstructured":"Zou H, Li R (2008) One-step sparse estimates in nonconcave penalized likelihood models. Ann Statist 36 (4):1509\u2013 1533","journal-title":"Ann Statist"},{"issue":"5-6","key":"778_CR48","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1007\/s10618-014-0369-7","volume":"28","author":"HA Le Thi","year":"2014","unstructured":"Le Thi H A, Nguyen MC (2014) Self-organizing maps by difference of convex functions optimization. Data Min. Knowl. Disc. 28(5-6):1336\u20131365","journal-title":"Data Min. Knowl. Disc."},{"issue":"12","key":"778_CR49","doi-asserted-by":"crossref","first-page":"2827","DOI":"10.1162\/NECO_a_00673","volume":"26","author":"HA Le Thi","year":"2014","unstructured":"Le Thi H A, Nguyen M C , Pham Dinh T (2014) ADCprogramming approach for finding Communities in networks. Neural Comput. 26(12):2827\u20132854","journal-title":"Neural Comput."},{"key":"778_CR50","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1198\/106186005X37238","volume":"14","author":"Y Liu","year":"2005","unstructured":"Liu Y, Shen X, Doss H (2005) Multicategory \u03c8-learning and support vector machine: computational tools. J. Comput. Graph. Stat. 14:219\u2013236","journal-title":"J. Comput. Graph. Stat."},{"key":"778_CR51","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1198\/016214505000000781","volume":"101","author":"Y Liu","year":"2006","unstructured":"Liu Y, Shen X (2006) Multicategory \u03c8-Learning. J. Am. Stat. Assoc. 101:500\u2013509","journal-title":"J. Am. Stat. Assoc."},{"key":"778_CR52","doi-asserted-by":"crossref","unstructured":"Weber S, Nagy A, Sch\u00fcle T, Schn\u00f6rr C, Kuba A (2006) A benchmark evaluation of large-scale optimization approaches to binary tomography. Proceedings of the Conference on Discrete Geometry on Computer Imagery (DGCI 2006), vol 4245","DOI":"10.1007\/11907350_13"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0778-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-016-0778-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0778-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T12:31:26Z","timestamp":1718454686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-016-0778-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,2]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s10489-016-0778-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,2]]}}}