{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:04:28Z","timestamp":1742947468225,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031138317"},{"type":"electronic","value":"9783031138324"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-13832-4_17","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T11:32:22Z","timestamp":1660563142000},"page":"198-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cross Distance Minimization for Solving the Nearest Point Problem Based on Scaled Convex Hull"],"prefix":"10.1007","author":[{"given":"Qiangkui","family":"Leng","sequence":"first","affiliation":[]},{"given":"Erjie","family":"Jiao","sequence":"additional","affiliation":[]},{"given":"Yuqing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jiamei","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/TNNLS.2011.2179120","volume":"23","author":"X Peng","year":"2011","unstructured":"Peng, X., Wang, Y.: Geometric algorithms to large margin classifier based on affine hulls. IEEE Trans. Neural Netw. Learn. Syst. 23(2), 236\u2013246 (2011)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ins.2019.07.065","volume":"504","author":"Q Leng","year":"2019","unstructured":"Leng, Q., Wang, S., Qin, Y., et al.: An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier. Inf. Sci. 504, 435\u2013448 (2019)","journal-title":"Inf. Sci."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/TNNLS.2017.2648038","volume":"29","author":"S Ding","year":"2017","unstructured":"Ding, S., Nie, X., Qiao, H., et al.: A fast algorithm of convex hull vertices selection for online classification. IEEE Trans. Neural Netw. Learn. Syst. 29(4), 792\u2013806 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"6311","DOI":"10.1214\/21-EJS1902","volume":"15","author":"I Carmichael","year":"2021","unstructured":"Carmichael, I., Marron, J.S.: Geometric insights into support vector machine behavior using the KKT conditions. Electron. J. Stat. 15(2), 6311\u20136343 (2021)","journal-title":"Electron. J. Stat."},{"issue":"15","key":"17_CR5","doi-asserted-by":"publisher","first-page":"23073","DOI":"10.1007\/s11042-020-09103-1","volume":"80","author":"X Chen","year":"2020","unstructured":"Chen, X., Xiao, Y.: Geometric projection twin support vector machine for pattern classification. Multimedia Tools Appl. 80(15), 23073\u201323089 (2020). https:\/\/doi.org\/10.1007\/s11042-020-09103-1","journal-title":"Multimedia Tools Appl."},{"key":"17_CR6","unstructured":"Bennett, K.P., Bredensteiner, E.J.: Duality and geometry in SVM classifiers. In: Seventeenth International Conference on Machine Learning (ICML 2000), pp. 57\u201364 (2000)"},{"key":"17_CR7","first-page":"323","volume":"16","author":"A Barbero","year":"2015","unstructured":"Barbero, A., Takeda, A., L\u00f3pez, J.: Geometric intuition and algorithms for E\u03bd\u2013SVM. J. Mach. Learn. Res. 16, 323\u2013369 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR8","volume":"4","author":"ON Almasi","year":"2021","unstructured":"Almasi, O.N., Rouhani, M.: A geometric-based data reduction approach for large low dimensional datasets: Delaunay triangulation in SVM algorithms. Mach. Learn. Appl. 4, 100025 (2021)","journal-title":"Mach. Learn. Appl."},{"issue":"9","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0031-3203(03)00060-8","volume":"36","author":"V Franc","year":"2003","unstructured":"Franc, V., Hlav\u00e1\u010d, V.: An iterative algorithm learning the maximal margin classifier. Pattern Recogn. 36(9), 1985\u20131996 (2003)","journal-title":"Pattern Recogn."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/72.822516","volume":"11","author":"SS Keerthi","year":"2000","unstructured":"Keerthi, S.S., Shevade, S.K., Bhattacharyya, C., et al.: A fast iterative nearest point algorithm for support vector machine classifier design. IEEE Trans. Neural Netw. 11(1), 124\u2013136 (2000)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TNN.2010.2094624","volume":"22","author":"L Yujian","year":"2011","unstructured":"Yujian, L., Bo, L., Xinwu, Y., et al.: Multiconlitron: a general piecewise linear classifier. IEEE Trans. Neural Netw. 22(2), 276\u2013289 (2011)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TNN.2006.873281","volume":"17","author":"ME Mavroforakis","year":"2006","unstructured":"Mavroforakis, M.E., Theodoridis, S.: A geometric approach to support vector machine (SVM) classification. IEEE Trans. Neural Netw. 17(3), 671\u2013682 (2006)","journal-title":"IEEE Trans. Neural Netw."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Mavroforakis, M.E., Sdralis, M., Theodoridis, S.: A novel SVM geometric algorithm based on reduced convex hulls. In: 18th International Conference on Pattern Recognition (ICPR 2006), pp. 564\u2013568 (2006)","DOI":"10.1109\/ICPR.2006.143"},{"issue":"5","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1109\/TNN.2007.900237","volume":"18","author":"ME Mavroforakis","year":"2007","unstructured":"Mavroforakis, M.E., Sdralis, M., Theodoridis, S.: A geometric nearest point algorithm for the efficient solution of the SVM classification task. IEEE Trans. Neural Netw. 18(5), 1545\u20131549 (2007)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.patcog.2010.08.030","volume":"44","author":"J L\u00f3pez","year":"2011","unstructured":"L\u00f3pez, J., Barbero, \u00c1., Dorronsoro, J.R.: Clipping algorithms for solving the nearest point problem over reduced convex hulls. Pattern Recogn. 44(3), 607\u2013614 (2011)","journal-title":"Pattern Recogn."},{"issue":"7","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TNN.2009.2022399","volume":"20","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Liu, J.G., Pan, C., et al.: A novel geometric approach to binary classification based on scaled convex hulls. IEEE Trans. Neural Netw. 20(7), 1215\u20131220 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1\u20133","key":"17_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.neucom.2009.09.005","volume":"73","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Liu, J.G., Chen, Z.: A generalized Gilbert\u2019s algorithm for approximating general SVM classifiers. Neurocomputing 73(1\u20133), 219\u2013224 (2009)","journal-title":"Neurocomputing"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Barbero, \u00c1., Dorronsoro, J.R.: An MDM solver for the nearest point problem in Scaled Convex Hulls. In: 2010 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138 (2010)","DOI":"10.1109\/IJCNN.2010.5596984"},{"issue":"5","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1007\/s13042-016-0529-8","volume":"8","author":"Y Li","year":"2016","unstructured":"Li, Y., Leng, Q., Fu, Y.: Cross kernel distance minimization for designing support vector machines. Int. J. Mach. Learn. Cybern. 8(5), 1585\u20131593 (2016). https:\/\/doi.org\/10.1007\/s13042-016-0529-8","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"17_CR20","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml. Accessed 21 Dec 2021"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13832-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:05:02Z","timestamp":1710338702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13832-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138317","9783031138324"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13832-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"209","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}