{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:28:52Z","timestamp":1744903732597,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T00:00:00Z","timestamp":1465257600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003407","name":"MIUR","doi-asserted-by":"crossref","award":["PON03PE_00032_2"],"award-info":[{"award-number":["PON03PE_00032_2"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00521-016-2374-9","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T23:20:47Z","timestamp":1465255247000},"page":"699-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Malicious URL detection via spherical classification"],"prefix":"10.1007","volume":"28","author":[{"given":"A.","family":"Astorino","sequence":"first","affiliation":[]},{"given":"A.","family":"Chiarello","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7041","authenticated-orcid":false,"given":"M.","family":"Gaudioso","sequence":"additional","affiliation":[]},{"given":"A.","family":"Piccolo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,7]]},"reference":[{"issue":"2\u20133","key":"2374_CR1","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":"2374_CR2","doi-asserted-by":"crossref","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":"4","key":"2374_CR3","doi-asserted-by":"crossref","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 Glob Optim 48(4):657\u2013669","journal-title":"J Glob Optim"},{"issue":"2","key":"2374_CR4","doi-asserted-by":"crossref","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"},{"key":"2374_CR5","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. Optim Methods Softw 1:23\u201334","journal-title":"Optim Methods Softw"},{"key":"2374_CR6","doi-asserted-by":"crossref","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"},{"key":"2374_CR7","unstructured":"http:\/\/opendirectory.org\/"},{"key":"2374_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi HA, Pham Dihn T (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133:23\u201346","journal-title":"Ann Oper Res"},{"key":"2374_CR9","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1007\/s10898-012-9859-6","volume":"56","author":"HA Thi Le","year":"2013","unstructured":"Le Thi HA, Le HM, Pham Dinh T, Van Huynh N (2013) Binary classification via spherical separator by DC programming and DCA. J Glob Optim 56:1393\u20131407","journal-title":"J Glob Optim"},{"key":"2374_CR10","doi-asserted-by":"crossref","unstructured":"Ma J, Saul LK, Savage S, Voelker GM (2009) Beyond blacklists: learning to detect malicious web sites from suspicious URLs. KDD\u201909, June 28\u2013July 1, 2009. France, Paris, pp 1245\u20131253","DOI":"10.1145\/1557019.1557153"},{"key":"2374_CR11","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.13.3.444","volume":"13","author":"OL Mangasarian","year":"1965","unstructured":"Mangasarian OL (1965) Linear and nonlinear separation of patterns by linear programming. Oper Res 13:444\u2013452","journal-title":"Oper Res"},{"issue":"2\u20133","key":"2374_CR12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/10556780512331318209","volume":"20","author":"L Palagi","year":"2005","unstructured":"Palagi L, Sciandrone M (2005) On the convergence of a modified version of \n                        $$SVM^{light}$$\n                        \n                            \n                                            \n                                \n                                    S\n                                    V\n                                    \n                                        M\n                                        \n                                            l\n                                            i\n                                            g\n                                            h\n                                            t\n                                        \n                                    \n                                \n                            \n                        \n                     algorithm. Optim Methods Softw 20(2\u20133):317\u2013334","journal-title":"Optim Methods Softw"},{"key":"2374_CR13","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh T, Le Thi HA (1998) A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J Con Opt 8:476\u2013505","journal-title":"SIAM J Con Opt"},{"key":"2374_CR14","unstructured":"PhishTank: \n                        http:\/\/www.phishtank.com\/"},{"key":"2374_CR15","doi-asserted-by":"crossref","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":"2374_CR16","doi-asserted-by":"crossref","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"},{"key":"2374_CR17","unstructured":"Zhang J, Porras P, Ullrich J (2008) Highly predictive blacklisting. USENIX Security Symposium 2008\u2014usenix.org"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2374-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2374-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2374-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2374-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T08:01:13Z","timestamp":1511337673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2374-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,7]]},"references-count":17,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2374"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2374-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,6,7]]}}}