{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:21:20Z","timestamp":1763810480636,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100013003","name":"Universit\u00e0 degli Studi di Cagliari","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100013003","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider polyhedral separation of sets as a possible tool in supervised classification. In particular, we focus on the optimization model introduced by Astorino and Gaudioso (J Optim Theory Appl 112(2):265\u2013293, 2002) and adopt its reformulation in difference of convex (DC) form. We tackle the problem by adapting the algorithm for DC programming known as DCA. We present the results of the implementation of DCA on a number of benchmark classification datasets.<\/jats:p>","DOI":"10.1007\/s00500-021-05758-6","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T11:02:59Z","timestamp":1617793379000},"page":"12605-12613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Polyhedral separation via difference of convex (DC) programming"],"prefix":"10.1007","volume":"25","author":[{"given":"Annabella","family":"Astorino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3861-9664","authenticated-orcid":false,"given":"Massimo Di","family":"Francesco","sequence":"additional","affiliation":[]},{"given":"Manlio","family":"Gaudioso","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Gorgone","sequence":"additional","affiliation":[]},{"given":"Benedetto","family":"Manca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,7]]},"reference":[{"key":"5758_CR1","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s00521-016-2374-9","volume":"28","author":"A Astorino","year":"2017","unstructured":"Astorino A, Chiarello A, Gaudioso M, Piccolo A (2017) Malicious URL detection via spherical classification. Neural Comput Appl 28:699\u2013705","journal-title":"Neural Comput Appl"},{"issue":"3","key":"5758_CR2","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10957-013-0458-6","volume":"164","author":"A Astorino","year":"2015","unstructured":"Astorino A, Fuduli A (2015) Support vector machine polyhedral separability in semisupervised learning. J Optim Theory Appl 164(3):1039\u20131050","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"5758_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10898-010-9558-0","volume":"48","author":"A Astorino","year":"2010","unstructured":"Astorino A, Fuduli A, Gaudioso M (2010) DC models for spherical separation. J Global Optim 48(4):657\u2013669","journal-title":"J Global Optim"},{"issue":"2","key":"5758_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10589-012-9486-7","volume":"53","author":"A Astorino","year":"2012","unstructured":"Astorino A, Fuduli A, Gaudioso M (2012) Margin maximization in spherical separation. Comput Optim Appl 53(2):301\u2013322","journal-title":"Comput Optim Appl"},{"issue":"2","key":"5758_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1013649822153","volume":"112","author":"A Astorino","year":"2002","unstructured":"Astorino A, Gaudioso M (2002) Polyhedral separability through successive LP. J Optim Theory Appl 112(2):265\u2013293","journal-title":"J Optim Theory Appl"},{"issue":"2\u20133","key":"5758_CR6","first-page":"261","volume":"20","author":"A Astorino","year":"2005","unstructured":"Astorino A, Gaudioso M (2005) Ellipsoidal separation for classification problems. Optim Methods Softw 20(2\u20133):261\u2013270","journal-title":"Optim Methods Softw"},{"issue":"3","key":"5758_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10287-007-0051-2","volume":"6","author":"A Astorino","year":"2009","unstructured":"Astorino A, Gaudioso M (2009) A fixed-center spherical separation algorithm with kernel transformations for classification problems. CMS 6(3):357\u2013372","journal-title":"CMS"},{"issue":"1","key":"5758_CR8","first-page":"1","volume":"21","author":"A Astorino","year":"2014","unstructured":"Astorino A, Gaudioso M, Seeger A (2014) Conic separation of finite sets I. The homogeneous case. J Convex Anal 21(1):1\u201328","journal-title":"J Convex Anal"},{"issue":"3","key":"5758_CR9","first-page":"819","volume":"21","author":"A Astorino","year":"2014","unstructured":"Astorino A, Gaudioso M, Seeger A (2014) Conic separation of finite sets. II. The nonhomogeneous case. J Convex Anal 21(3):819\u2013831","journal-title":"J Convex Anal"},{"issue":"1","key":"5758_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"K Bennett","year":"1992","unstructured":"Bennett K, Mangasarian O (1992) Robust linear programming discrimination of two linearly inseparable sets. Optim Methods Softw 1(1):23\u201334","journal-title":"Optim Methods Softw"},{"key":"5758_CR11","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang CC, Lin CJ (2011) LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol 2:27:1\u201327:27","journal-title":"ACM Trans Intell Syst Technol"},{"key":"5758_CR12","doi-asserted-by":"crossref","unstructured":"Chapelle O, Zien A (2005) Semi-supervised classification by low density separation. In: Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pp 57\u201364","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"key":"5758_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389","volume-title":"An introduction to support vector machines and other kernel-based learning methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge"},{"issue":"1","key":"5758_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10898-017-0568-z","volume":"71","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso M, Giallombardo G, Miglionico G, Bagirov A (2018) Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. J Global Optim 71(1):37\u201355","journal-title":"J Global Optim"},{"key":"5758_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2017.06.001","volume":"87","author":"M Gaudioso","year":"2017","unstructured":"Gaudioso M, Gorgone E, Labbe M, Rodriguez-Chia A (2017) Lagrangian relaxation for svm feature selection. Comput Oper Res 87:137\u2013145","journal-title":"Comput Oper Res"},{"key":"5758_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-45610-7_3","volume":"256","author":"JB Hiriart-Urruty","year":"1986","unstructured":"Hiriart-Urruty JB (1986) Generalized differentiability duality and optimization for problems dealing with differences of convex functions. Lecture Notes Econ Math Syst 256:37\u201370","journal-title":"Lecture Notes Econ Math Syst"},{"issue":"3","key":"5758_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki K, Bagirov A, Karmitsa N, Makela M (2017) A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J Global Optim 68(3):501\u2013535","journal-title":"J Global Optim"},{"issue":"4755","key":"5758_CR18","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1126\/science.3704647","volume":"232","author":"P Jurs","year":"1986","unstructured":"Jurs P (1986) Pattern recognition used to investigate multivariate data in analytical chemistry. Science 232(4755):1219\u20131224","journal-title":"Science"},{"issue":"3","key":"5758_CR19","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s11590-016-1031-7","volume":"11","author":"W Khalaf","year":"2017","unstructured":"Khalaf W, Astorino A, D\u2019Alessandro P, Gaudioso M (2017) A DC optimization-based clustering technique for edge detection. Optim Lett 11(3):627\u2013640","journal-title":"Optim Lett"},{"issue":"1\u20132","key":"5758_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(98)00049-2","volume":"24","author":"O Mangasarian","year":"1999","unstructured":"Mangasarian O (1999) Arbitrary-norm separating plane. Oper Res Lett 24(1\u20132):15\u201323","journal-title":"Oper Res Lett"},{"issue":"4","key":"5758_CR21","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.43.4.570","volume":"43","author":"O Mangasarian","year":"1995","unstructured":"Mangasarian O, Street W, Wolberg W (1995) Breast cancer diagnosis and prognosis via linear programming. Oper Res 43(4):570\u2013577","journal-title":"Oper Res"},{"issue":"4","key":"5758_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02187916","volume":"3","author":"N Megiddo","year":"1988","unstructured":"Megiddo N (1988) On the complexity of polyhedral separability. Discrete Comput Geom 3(4):325\u2013337","journal-title":"Discrete Comput Geom"},{"key":"5758_CR23","first-page":"1","volume":"8","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh T, Le Thi Hoai A (2014) Recent advances in DC programming and DCA. Trans Comput Intell 8:1\u201337","journal-title":"Trans Comput Intell"},{"issue":"1\u20134","key":"5758_CR24","first-page":"23","volume":"133","author":"T Pham Dinh","year":"2005","unstructured":"Pham Dinh T et al (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133(1\u20134):23\u201346","journal-title":"Ann Oper Res"},{"key":"5758_CR25","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.cor.2013.05.009","volume":"52","author":"F Plastria","year":"2014","unstructured":"Plastria F, Carrizosa E, Gordillo J (2014) Multi-instance classification through spherical separation and VNS. Comput Oper Res 52:326\u2013333","journal-title":"Comput Oper Res"},{"key":"5758_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-247X(65)90150-2","volume":"10","author":"JB Rosen","year":"1965","unstructured":"Rosen JB (1965) Pattern separation by convex programming. J Math Anal Appl 10:123\u2013134","journal-title":"J Math Anal Appl"},{"key":"5758_CR27","volume-title":"Advances in kernel methods. Support vector learning","author":"B Sch\u00f6lkopf","year":"1999","unstructured":"Sch\u00f6lkopf B, Burges C, Smola A (1999) Advances in kernel methods. Support vector learning. MIT Press, Cambridge"},{"key":"5758_CR28","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/8996.001.0001","volume-title":"Optimization for machine learning","author":"S Sra","year":"2011","unstructured":"Sra S, Nowozin S, Wright S (2011) Optimization for machine learning. The MIT Press, Cambridge"},{"issue":"10","key":"5758_CR29","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1134\/S0005117915100082","volume":"76","author":"A Strekalovsky","year":"2015","unstructured":"Strekalovsky A, Gruzdeva T, Orlov A (2015) On the problem polyhedral separability: a numerical solution. Autom Remote Control 76(10):1803\u20131816","journal-title":"Autom Remote Control"},{"key":"5758_CR30","doi-asserted-by":"crossref","unstructured":"Thongsuwan S, Jaiyen S, Padcharoen A, Agarwal P (2020) Convxgb: a new deep learning model for classification problems based on cnn and xgboost. Nuclear Eng Technol (2020)","DOI":"10.1016\/j.net.2020.04.008"},{"key":"5758_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of the statistical learning theory","author":"V Vapnik","year":"1995","unstructured":"Vapnik V (1995) The nature of the statistical learning theory. Springer, New York"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05758-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T12:33:57Z","timestamp":1631536437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05758-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,7]]},"references-count":31,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["5758"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05758-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,4,7]]},"assertion":[{"value":"16 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}