{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T19:56:06Z","timestamp":1762113366731},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,11,24]],"date-time":"2012-11-24T00:00:00Z","timestamp":1353715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00500-012-0954-x","type":"journal-article","created":{"date-parts":[[2012,11,23]],"date-time":"2012-11-23T08:49:12Z","timestamp":1353660552000},"page":"793-804","source":"Crossref","is-referenced-by-count":13,"title":["Large data sets classification using convex\u2013concave hull and support vector machine"],"prefix":"10.1007","volume":"17","author":[{"given":"Asdr\u00fabal L\u00f3pez","family":"Chau","sequence":"first","affiliation":[]},{"given":"Xiaoou","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wen","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,24]]},"reference":[{"key":"954_CR1","unstructured":"Bennett KP, Bredensteiner EJ (2000a) Geometry in learning. In: Gorini C (eds), Geometry at work. Mathematical Association of America, pp 132\u2013145"},{"key":"954_CR2","unstructured":"Bennett K.P., Bredensteiner E.J. (2000b) Duality and geometry in SVM classifiers. 17th International Conference on Machine Learning, San Francisco"},{"key":"954_CR3","unstructured":"Berg M, Cheong O, Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications. Springer, Berlin"},{"key":"954_CR4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.neucom.2007.07.028","volume":"71","author":"J Cervantes","year":"2008","unstructured":"Cervantes J, Li X, Yu W, Li K (2008) Support vector machine classification for large data sets via minimum enclosing ball clustering. Neurocomputing 71:611\u2013619","journal-title":"Neurocomputing"},{"key":"954_CR5","unstructured":"Chang C-C, Lin C-J (2001) LIBSVM: a library for support vector machines. http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"954_CR6","first-page":"143","volume":"1","author":"R Collobert","year":"2001","unstructured":"Collobert R, Bengio S (2001) SVMTorch: support vector machines for large regression problems. J Mach Learn Res 1:143\u2013160","journal-title":"J Mach Learn Res"},{"key":"954_CR7","doi-asserted-by":"crossref","unstructured":"Collobert R, Sinz F, Weston J, Bottou L (2006) Trading convexity for scalability. 23rd international conference on machine learning, Pittsburgh, pp 201\u2013208","DOI":"10.1145\/1143844.1143870"},{"key":"954_CR8","first-page":"244","volume":"12","author":"DJ Crisp","year":"2000","unstructured":"Crisp DJ, Burges CJC (2000) A geometric interpretation of \u03c5-SVM classifiers. NIPS 12:244\u2013250","journal-title":"NIPS"},{"key":"954_CR9","doi-asserted-by":"crossref","unstructured":"Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511801389"},{"issue":"4","key":"954_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/355759.355766","volume":"3","author":"W Eddy","year":"1977","unstructured":"Eddy W (1977) A new convex hull algorithm for planar sets. ACM Trans Math Softw 3(4):398\u2013403","journal-title":"ACM Trans Math Softw"},{"key":"954_CR11","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0031-3203(03)00060-8","volume":"36","author":"V Franc","year":"2003","unstructured":"Franc V, Hlavac V (2003) An iterative algorithm learning the maximal margin classifier. Pattern Recogn Lett 36:1985\u20131996","journal-title":"Pattern Recogn"},{"issue":"1","key":"954_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0304007","volume":"4","author":"EG Gilbert","year":"1966","unstructured":"Gilbert EG (1966) An iterative procedure for computing the minimum of a quadratic form on a convex set. SIAM J Control Optim 4(1):61\u201379","journal-title":"SIAM J Control Optim"},{"key":"954_CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for dutennining the convex hull of a finite pianar set. Inf Process Lett 1:132\u2013133","journal-title":"Inf Process Lett"},{"key":"954_CR14","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1016\/j.patrec.2007.04.017","volume":"28","author":"G Guo","year":"2007","unstructured":"Guo G, Zhang J-S (2007) Reducing examples to accelerate support vector regression. Pattern Recognit Lett 28:2173\u20132183","journal-title":"Pattern Recognit Lett"},{"key":"954_CR15","unstructured":"Ho TK, Kleinberg EM (1996) Checkerboard dataset. http:\/\/www.cs.wisc.edu\/"},{"issue":"1","key":"954_CR16","first-page":"1","volume":"1","author":"C-W Hsu","year":"2010","unstructured":"Hsu C-W, Chang C-C, Lin C-J (2010) A practical guide to support vector classification. Bioinform Biol Insights 1(1):1\u201316","journal-title":"Bioinformatics"},{"key":"954_CR17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"RA Jarvis","year":"1973","unstructured":"Jarvis RA (1973) On the identification of the convex hull of a finite set of points in the plane. Inf Process Lett 2:18\u201321","journal-title":"Inf Process Lett"},{"key":"954_CR18","unstructured":"Jolliffe IT (2002) Principal component analysis, 2nd edn. Springer, Berlin"},{"issue":"4","key":"954_CR19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(84)90084-X","volume":"19","author":"M Kallay","year":"1984","unstructured":"Kallay M (1984) The complexity of incremental convex hull algorithms. Inf Process Lett 19(4):197\u2013212","journal-title":"Inf Process Lett"},{"key":"954_CR20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"SS Keerthi","year":"2002","unstructured":"Keerthi SS, Gilbert EG (2002) Convergence of a generalized SMO algorithm for SVM classifier design. Mach Learn 46:351\u2013360","journal-title":"Mach Learn"},{"issue":"12","key":"954_CR21","first-page":"124","volume":"11","author":"SS Keerthi","year":"2001","unstructured":"Keerthi SS, Shevade SK, Bhattacharyya C, Murthy KRK (2001) A fast iterative nearest point algorithm for support vector machine classifier design. IEEE Trans Neural Netw 11(12):124\u2013137","journal-title":"IEEE Trans Neural Netw"},{"key":"954_CR22","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.1016\/j.patrec.2011.04.013","volume":"32","author":"Y Li","year":"2011","unstructured":"Li Y (2011) Selecting training points for one-class support vector machines. Pattern Recognit Lett 32:1517\u20131522","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"954_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TNN.2006.873281","volume":"17","author":"ME Mavroforakis","year":"2006","unstructured":"Mavroforakis ME, Theodoridis S (2006) A geometric approach to support vector machine (SVM) classification. IEEE Trans Neural Netw 17(3):671\u2013682","journal-title":"IEEE Trans Neural Netw"},{"key":"954_CR24","first-page":"38","volume":"13","author":"BF Mitchell","year":"1971","unstructured":"Mitchell BF, Dem\u2019yanov VF, Malozemov VN (1971) Finding the point of a polyhedron closest to the origin. Vestinik Leningrad Gos Univ 13:38\u201345","journal-title":"Vestinik Leningrad Gos Univ"},{"key":"954_CR25","unstructured":"Moreira A, Santos MY (2007) Concave hull: a K-nearest neighbours approach for the computation of the region occupied by a set of points. GRAPP (GM\/R), pp 61\u201368"},{"issue":"3","key":"954_CR26","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/TKDE.2003.1198395","volume":"15","author":"C Pizzuti","year":"2003","unstructured":"Pizzuti C, Talia D (2003) P-auto class: scalable parallel clustering for mining large data sets. IEEE Trans Knowl Data Eng 15(3):629\u2013641","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"954_CR27","doi-asserted-by":"crossref","unstructured":"Platt J. (1998) Fast training of support vector machine using sequential minimal optimization, advances in kernel methods: support vector machine. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/1130.003.0016"},{"issue":"2","key":"954_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"FP Preparata","year":"1977","unstructured":"Preparata FP, Hong SJ (1977) convex hulls of finite sets of points in two and three dimensions. Commun ACM 20(2):87\u201393","journal-title":"Commun ACM"},{"key":"954_CR29","unstructured":"Schlesinger MI, Kalmykov VG, Suchorukov AA, Sravnitelnyj (1981) Comparative analysis of algorithms synthesising linear decision rule for analysis of complex hypotheses. Automatika 1:3\u20139"},{"key":"954_CR30","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang IW, Kwok JT, Cheung PM (2005) Core vector machines: fast SVM training on very large data sets. J Mach Learn Res 6:363\u2013392","journal-title":"J Mach Learn Res"},{"key":"954_CR31","doi-asserted-by":"crossref","unstructured":"Vapnik V (1995) The nature of statistical learning theory. Springer, New York","DOI":"10.1007\/978-1-4757-2440-0"},{"issue":"3","key":"954_CR32","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TKDE.2006.38","volume":"18","author":"C Xia","year":"2006","unstructured":"Xia C, Hsu W, Lee ML, Ooi BC (2006) BORDER: efficient computation of boundary points. IEEE Trans Knowl Data Eng 18(3):289\u2013303","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"954_CR33","doi-asserted-by":"crossref","first-page":"4264","DOI":"10.1016\/j.ins.2008.07.014","volume":"178","author":"W Yu","year":"2008","unstructured":"Yu W, Li X (2008) On-line fuzzy modeling via clustering and support vector machines. Inf Sci 178:4264\u20134279","journal-title":"Inf Sci"},{"key":"954_CR34","doi-asserted-by":"crossref","unstructured":"Yu H, Yang J, Han J (2003) Classifying large data sets using SVMs with hierarchical clusters. Proceedings of the 9th ACM SIGKDD 2003 Washington, DC","DOI":"10.1145\/956750.956786"},{"issue":"4","key":"954_CR35","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille AL, Rangarajan A (2003) The concave-convex procedure. Neural Comput Appl 15(4):915\u2013936","journal-title":"Neural Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0954-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-012-0954-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0954-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:41:34Z","timestamp":1687826494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-012-0954-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,24]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["954"],"URL":"https:\/\/doi.org\/10.1007\/s00500-012-0954-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,24]]}}}