{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T05:10:07Z","timestamp":1751778607636,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_19","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"194-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Supervised Classification Using Feature Space Partitioning"],"prefix":"10.1007","author":[{"given":"Ventzeslav","family":"Valev","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Yanev","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Krzy\u017cak","sequence":"additional","affiliation":[]},{"given":"Karima Ben","family":"Suliman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1142\/S0129065707001056","volume":"17","author":"G Yang","year":"2007","unstructured":"Yang, G., Tang, Z., Zhang, Z., Zhu, Y.: A Flexible annealing chaotic neural network to maximum clique problem. Int. J. Neural Syst. 17(3), 183\u2013192 (2007)","journal-title":"Int. J. Neural Syst."},{"issue":"7","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1162\/089976603321891828","volume":"15","author":"RL Wang","year":"2003","unstructured":"Wang, R.L., Tang, Z., Cao, Q.P.: An efficient approximation algorithm for finding a maximum clique using hopfield network learning. Neural Comput. 15(7), 1605\u20131619 (2003)","journal-title":"Neural Comput."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Pelillo, M., Torsello, A.: Payoff-Monotonic game dynamics and the maximum clique problem. Neural Comput. 18(5) (2006)","DOI":"10.1162\/089976606776241011"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Kumlander, D.: Problems of optimization: an exact algorithm for finding a maximum clique optimized for dense graphs. In: Proceedings of the Estonian Academy of Sciences, Physics, Mathematics, vol. 54, no. 2, pp. 79\u201386 (2005)","DOI":"10.3176\/phys.math.2005.2.02"},{"key":"19_CR5","unstructured":"Joachims, T.: Transductive learning via spectral graph partitioning. In: Proceedings of Twentieth International Conference on Machine Learning, pp. 290\u2013297, Washington DC (2003)"},{"key":"19_CR6","volume-title":"Statistical Learning Theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. Wiley, Hoboken (1998)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of International Conference on Data Mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"19_CR8","unstructured":"Valev, V., Yanev, N.: Classification using graph partitioning. In: Proceedings of the 21st International Conference on Pattern Recognition, pp. 1261\u20131264 (2012)"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0377-2217(98)00229-X","volume":"115","author":"N Yanev","year":"1999","unstructured":"Yanev, N., Balev, S.: A combinatorial approach to the classification problem. Eur. J. Oper. Res. 115(2), 339\u2013350 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Valev, V., Yanev, N., Krzy\u017cak, A.: A new geometrical approach for solving the supervised pattern recognition problem. In: Proceedings of the 23rd International Conference on Pattern Recognition, pp. 1648\u20131652 (2016)","DOI":"10.1109\/ICPR.2016.7899873"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.patcog.2003.09.003","volume":"37","author":"V Valev","year":"2004","unstructured":"Valev, V.: Supervised pattern recognition by parallel feature partitioning. Pattern Recogn. 37(3), 463\u2013467 (2004)","journal-title":"Pattern Recogn."},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0129054114500257","volume":"25","author":"T Ghasemi","year":"2014","unstructured":"Ghasemi, T., Ghasemalizadeh, H., Razzazi, M.: An algorithmic framework for solving geometric covering problems - with applications. Int. J. Found. Comput. Sci. 25(5), 623\u2013639 (2014)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97785-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:39:53Z","timestamp":1751776793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}