{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:10:59Z","timestamp":1762445459620,"version":"3.37.3"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006191","name":"Eskisehir Osmangazi University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006191","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the field of machine learning, clustering has become an increasingly popular research topic due to its critical importance. Many clustering algorithms have been proposed utilizing a variety of approaches. This study focuses on clustering of high-dimensional data using the maximum margin clustering approach. In this paper, two methods are introduced: The first method employs the classical maximum margin clustering approach, which separates data into two clusters with the greatest margin between them. The second method takes cluster compactness into account and searches for two parallel hyperplanes that best fit to the cluster samples while also being as far apart from each other as possible. Additionally, robust variants of these clustering methods are introduced to handle outliers and noise within the data samples. The stochastic gradient algorithm is used to solve the resulting optimization problems, enabling all proposed clustering methods to scale well with large-scale data. Experimental results demonstrate that the proposed methods are more effective than existing maximum margin clustering methods, particularly in high-dimensional clustering problems, highlighting the efficacy of the proposed methods.<\/jats:p>","DOI":"10.1007\/s00521-023-09388-x","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T18:01:43Z","timestamp":1705514503000},"page":"5981-6003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust and compact maximum margin clustering for high-dimensional data"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1708-8817","authenticated-orcid":false,"given":"Hakan","family":"Cevikalp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Chome","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"key":"9388_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.neucom.2017.01.012","volume":"235","author":"H Cevikalp","year":"2017","unstructured":"Cevikalp H, Franc V (2017) Large-scale robust transductive support vector machines. Neurocomputing 235:199\u2013209","journal-title":"Neurocomputing"},{"issue":"8","key":"9388_CR2","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1109\/TPAMI.2016.2609929","volume":"39","author":"DP Hofmeyr","year":"2017","unstructured":"Hofmeyr DP (2017) Clustering by minimum cut hyperplanes. IEEE Trans Pattern Anal Mach Intell 39(8):1547\u20131560. https:\/\/doi.org\/10.1109\/TPAMI.2016.2609929","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9388_CR3","doi-asserted-by":"crossref","unstructured":"Bilenko M, Basu S, Mooney RJ (2004) Integrating constraints and metric learning in semi supervised clustering. In: Proceedings of the twenty-first international conference on machine learning (ICML)","DOI":"10.1145\/1015330.1015360"},{"key":"9388_CR4","unstructured":"Xing EP, Ng AY, Jordan MI, Russell S (2003) Distance metric learning with application to clustering with side-information. In: Advances in neural information processing systems (NIPS)"},{"key":"9388_CR5","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.patrec.2010.03.009","volume":"31","author":"H Cevikalp","year":"2010","unstructured":"Cevikalp H (2010) New clustering algorithms for the support vector machine based hierarchical classification. Pattern Recogn Lett 31:1285\u20131291","journal-title":"Pattern Recogn Lett"},{"key":"9388_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.patrec.2019.10.007","volume":"128","author":"H Cevikalp","year":"2019","unstructured":"Cevikalp H (2019) High-dimensional data clustering by using local affine\/convex hulls. Pattern Recogn Lett 128:427\u2013432","journal-title":"Pattern Recogn Lett"},{"key":"9388_CR7","unstructured":"Hinneburg A, Aggarwal CC, Keim DA (2000) What is the nearest neighbor in high dimensional spaces?. In: Proceedings of the 26th international conference on very large databases"},{"key":"9388_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume":"1540","author":"K Beyer","year":"1999","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful. Lect Notes Comput Sci 1540:217\u2013235","journal-title":"Lect Notes Comput Sci"},{"key":"9388_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support vector networks. Mach Learn 20:273\u2013297","journal-title":"Mach Learn"},{"key":"9388_CR10","unstructured":"Zhu Z, Wang Y, Robinson DP, Naiman DQ, Vidal R, Tsakiris MC (2018) Dual principal component pursuit: probability analysis and efficient algorithms. arXiv:1812.09924"},{"key":"9388_CR11","doi-asserted-by":"crossref","unstructured":"Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. CoRR. arXiv:1203.1005","DOI":"10.1109\/TPAMI.2013.57"},{"key":"9388_CR12","unstructured":"Ho J, Yang MH, Lim J, Lee KC, Kriegman D (2003) Clustering appearances of objects under varying illumination conditions. In: 2003 IEEE Computer Society conference on computer vision and pattern recognition (CVPR)"},{"key":"9388_CR13","unstructured":"Agarwal PK, Mustafa NH (2004) K-means projective clustering. In: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems"},{"key":"9388_CR14","unstructured":"Zhang T, Szlam A, Lerman G (2009) Median k-flats for hybrid linear modeling with many outliers. In: ICCV workshops"},{"issue":"6","key":"9388_CR15","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"M Fischler","year":"1981","unstructured":"Fischler M, Bolles R (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM 24(6):381\u2013395","journal-title":"Commun ACM"},{"key":"9388_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1162\/089976699300016728","volume":"11","author":"M Tipping","year":"1999","unstructured":"Tipping M, Bishop C (1999) Mixtures of probabilistic principal component analyzers. Neural Comput 11:443\u2013482","journal-title":"Neural Comput"},{"key":"9388_CR17","unstructured":"Gruber A, Weiss Y (2004) Multibody factorization with uncertainty and missing data using the EM algorithm. In: Proceedings of the 2004 IEEE Computer Society conference on computer vision and pattern recognition (CVPR)"},{"key":"9388_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPAMI.2005.244","volume":"27","author":"R Vidal","year":"2005","unstructured":"Vidal R, Ma Y, Sastry S (2005) Generalized principal component analysis (GPCA). IEEE Trans Pattern Anal Mach Intell 27:1\u201315","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9388_CR19","unstructured":"Yang AY, Rao SR, Ma Y (2006) Robust statistical estimation and segmentation of multiple subspaces. In: CVPR workshops"},{"key":"9388_CR20","doi-asserted-by":"crossref","unstructured":"Elhamifar E, Vidal R (2009) Sparse subspace clustering. In: 2009 IEEE conference on computer vision and pattern recognition (CVPR)","DOI":"10.1109\/CVPRW.2009.5206547"},{"key":"9388_CR21","unstructured":"Elhamifar E, Vidal R (2011) Sparse manifold clustering and embedding. In: Advances in neural information processing systems (NIPS)"},{"key":"9388_CR22","doi-asserted-by":"crossref","unstructured":"Yan J, Pollefeys M (2006) A general framework for motion segmentation: independent, articulated, rigid, non-rigid, degenerate and non-degenerate. In: European conference on computer vision","DOI":"10.1007\/11744085_8"},{"key":"9388_CR23","unstructured":"Liu G, Lin Z, Yu Y (2010) Robust subspace segmentation by low-rank representation. In: Proceedings of the 27th international conference on machine learning (ICML)"},{"key":"9388_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s11263-012-0535-6","volume":"1000","author":"T Zhang","year":"2012","unstructured":"Zhang T, Szlam A, Wang Y, Lerman G (2012) Hybrid linear modeling via local best-fit flats. Int J Comput Vis 1000:217\u2013240","journal-title":"Int J Comput Vis"},{"key":"9388_CR25","doi-asserted-by":"publisher","first-page":"3484","DOI":"10.1109\/TNNLS.2020.3011717","volume":"32","author":"B Wang","year":"2021","unstructured":"Wang B, Hu Y, Gao J, Sun Y, Ju F, Yin B (2021) Adaptive fusion of heterogeneous manifolds for subspace clustering. IEEE Trans Neural Netw Learn Syst 32:3484\u20133497","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"9388_CR26","doi-asserted-by":"publisher","first-page":"106982","DOI":"10.1016\/j.patcog.2019.106982","volume":"96","author":"N Passalis","year":"2019","unstructured":"Passalis N, Tefas A (2019) Discriminative clustering using regularized subspace learning. Pattern Recogn 96:106982","journal-title":"Pattern Recogn"},{"issue":"2","key":"9388_CR27","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MSP.2010.939739","volume":"28","author":"R Vidal","year":"2011","unstructured":"Vidal R (2011) Subspace clustering. IEEE Signal Process Mag 28(2):52\u201368. https:\/\/doi.org\/10.1109\/MSP.2010.939739","journal-title":"IEEE Signal Process Mag"},{"key":"9388_CR28","doi-asserted-by":"crossref","unstructured":"Chapelle O, Zien A (2005) Semi-supervised classification by low density separation. In: Neural information processing systems (NIPS)","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"key":"9388_CR29","volume-title":"Advances in neural information processing systems","author":"L Xu","year":"2005","unstructured":"Xu L, Neufeld J, Larson B, Schuurmans D (2005) Maximum margin clustering. In: Saul L, Weiss Y, Bottou L (eds) Advances in neural information processing systems, vol 17. MIT Press, Cambridge"},{"key":"9388_CR30","volume-title":"Advances in neural information processing systems","author":"H Valizadegan","year":"2007","unstructured":"Valizadegan H, Jin R (2007) Generalized maximum margin clustering and unsupervised kernel learning. In: Sch\u00f6lkopf B, Platt J, Hoffman T (eds) Advances in neural information processing systems, vol 19. MIT Press, Cambridge"},{"issue":"4","key":"9388_CR31","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TNN.2008.2010620","volume":"20","author":"K Zhang","year":"2009","unstructured":"Zhang K, Tsang IW, Kwok JT (2009) Maximum margin clustering made practical. IEEE Trans Neural Netw 20(4):583\u2013596. https:\/\/doi.org\/10.1109\/TNN.2008.2010620","journal-title":"IEEE Trans Neural Netw"},{"issue":"6","key":"9388_CR32","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1109\/TSMCB.2012.2197824","volume":"42","author":"X-L Zhang","year":"2012","unstructured":"Zhang X-L, Wu J (2012) Linearithmic time sparse and convex maximum margin clustering. IEEE Trans Syst Man Cybern Part B (Cybernetics) 42(6):1669\u20131692. https:\/\/doi.org\/10.1109\/TSMCB.2012.2197824","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybernetics)"},{"key":"9388_CR33","doi-asserted-by":"publisher","unstructured":"Zhao B, Wang F, Zhang C (2008) Efficient maximum margin clustering via cutting plane algorithm. In: 8th SIAM international conference on data mining 2008, Proceedings in applied mathematics, vol 130. Society for Industrial and Applied Mathematics, pp 751\u2013762. https:\/\/doi.org\/10.1137\/1.9781611972788.68","DOI":"10.1137\/1.9781611972788.68"},{"key":"9388_CR34","first-page":"344","volume":"5","author":"YF Li","year":"2009","unstructured":"Li YF, Tsang IW, Kwok JT, Zhou ZH (2009) Tighter and convex maximum margin clustering. J Mach Learn Res 5:344\u2013351","journal-title":"J Mach Learn Res"},{"key":"9388_CR35","doi-asserted-by":"crossref","unstructured":"Wang F, Wang X, Li T (2009) Maximum margin clustering on data manifolds. In: 2009 Ninth IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 1028\u20131033","DOI":"10.1109\/ICDM.2009.104"},{"key":"9388_CR36","doi-asserted-by":"crossref","unstructured":"Hu Y, Wang J, Yu N, Hua XS (2008) Maximum margin clustering with pairwise constraints. In: IEEE international conference on data mining","DOI":"10.1109\/ICDM.2008.65"},{"issue":"5","key":"9388_CR37","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TKDE.2011.68","volume":"24","author":"H Zeng","year":"2012","unstructured":"Zeng H, Cheung Y-M (2012) Semi-supervised maximum margin clustering with pairwise constraints. IEEE Trans Knowl Data Eng 24(5):926\u2013939. https:\/\/doi.org\/10.1109\/TKDE.2011.68","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9388_CR38","unstructured":"Hoai M, la Torre FD (2012) Maximum margin temporal clustering. In: Proceedings of 15th international conference on artificial intelligence and statistics (AISTATS \u201912), pp 520 \u2013 528"},{"key":"9388_CR39","volume-title":"Advances in neural information processing systems","author":"C Chen","year":"2014","unstructured":"Chen C, Zhu J, Zhang X (2014) Robust Bayesian max-margin clustering. In: Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger KQ (eds) Advances in neural information processing systems, vol 27. Curran Associates Inc, New York"},{"key":"9388_CR40","volume-title":"Advances in neural information processing systems","author":"G-T Zhou","year":"2013","unstructured":"Zhou G-T, Lan T, Vahdat A, Mori G (2013) Latent maximum margin clustering. In: Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ (eds) Advances in neural information processing systems, vol 26. Curran Associates Inc, New York"},{"key":"9388_CR41","doi-asserted-by":"publisher","first-page":"63709","DOI":"10.1109\/ACCESS.2019.2916724","volume":"7","author":"J Li","year":"2019","unstructured":"Li J, Sun J, Liu L, Liu B, Xiao C, Wang F (2019) Improved maximum margin clustering via the bundle method. IEEE Access 7:63709\u201363721. https:\/\/doi.org\/10.1109\/ACCESS.2019.2916724","journal-title":"IEEE Access"},{"issue":"4","key":"9388_CR42","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s10044-015-0447-5","volume":"19","author":"V Vijaya Saradhi","year":"2016","unstructured":"Vijaya Saradhi V, Charly Abraham P (2016) Incremental maximum margin clustering. Pattern Anal Appl 19(4):1057\u20131067. https:\/\/doi.org\/10.1007\/s10044-015-0447-5","journal-title":"Pattern Anal Appl"},{"key":"9388_CR43","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11704-018-7402-8","volume":"13","author":"H Xue","year":"2019","unstructured":"Xue H, Li S, Chen X, Wang Y (2019) A maximum margin clustering algorithm based on indefinite kernels. Front Comput Sci 13:813\u2013827","journal-title":"Front Comput Sci"},{"key":"9388_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3311174","author":"Y Xiaoa","year":"2023","unstructured":"Xiaoa Y, Zhanga J, Liub B, Zhaoa L, Konga X, Haoc Z (2023) Multi-view maximum margin clustering with privileged information learning. IEEE Trans Circuits Syst Video Technol. https:\/\/doi.org\/10.1109\/TCSVT.2023.3311174","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"9388_CR45","doi-asserted-by":"crossref","unstructured":"Zhang T, Zhou ZH (2018) Optimal margin distribution clustering. In: AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11737"},{"key":"9388_CR46","unstructured":"Zhou GT, Hwang SJ, Schmidt M, Sigal L, Mori G (2015) Hierarchical maximum-margin clustering. arXiv:1502.01827"},{"key":"9388_CR47","unstructured":"Chen G (2015) Deep transductive semi-supervised maximum margin clustering. arXiv:1501.06237"},{"key":"9388_CR48","doi-asserted-by":"publisher","first-page":"109471","DOI":"10.1016\/j.patcog.2023.109471","volume":"139","author":"DP Hofmeyr","year":"2023","unstructured":"Hofmeyr DP (2023) Incremental estimation of low-density separating hyperplanes for clustering large data sets. Pattern Recogn 139:109471","journal-title":"Pattern Recogn"},{"key":"9388_CR49","doi-asserted-by":"crossref","unstructured":"Farhadi A, Tabrizi MK (2008) Learning to recognize activities from the wrong view point. In: Forsyth D, Torr P, Zisserman A (eds) Computer vision\u2014ECCV 2008. Springer, Berlin, pp 154\u2013166","DOI":"10.1007\/978-3-540-88682-2_13"},{"key":"9388_CR50","doi-asserted-by":"publisher","unstructured":"Hoai M, Zisserman A (2013) Discriminative sub-categorization. In: IEEE conference on computer vision and pattern recognition, pp 1666\u20131673. https:\/\/doi.org\/10.1109\/CVPR.2013.218","DOI":"10.1109\/CVPR.2013.218"},{"key":"9388_CR51","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-35728-2_13","volume-title":"Advances in multimedia modeling","author":"Y Wang","year":"2013","unstructured":"Wang Y, Cao L (2013) Discovering latent clusters from geotagged beach images. In: Li S, El Saddik A, Wang M, Mei T, Sebe N, Yan S, Hong R, Gurrin C (eds) Advances in multimedia modeling. Springer, Berlin, pp 133\u2013142"},{"key":"9388_CR52","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.amc.2013.11.028","volume":"227","author":"B Zhu","year":"2014","unstructured":"Zhu B, Ding Y, Hao K (2014) Multiclass maximum margin clustering via immune evolutionary algorithm for automatic diagnosis of electrocardiogram arrhythmias. Appl Math Comput 227:428\u2013436. https:\/\/doi.org\/10.1016\/j.amc.2013.11.028","journal-title":"Appl Math Comput"},{"key":"9388_CR53","unstructured":"Rahimi A, Recht B (2004) Clustering with normalized cuts is clustering with a hyperplane. Stat Learn Comput Vis 1\u201312"},{"issue":"8","key":"9388_CR54","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905. https:\/\/doi.org\/10.1109\/34.868688","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9388_CR55","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz S, Singer Y, Srebro N (2007) Pegasos: Primal estimated sub-grdient solver for svm. In: International conference on machine learning","DOI":"10.1145\/1273496.1273598"},{"key":"9388_CR56","unstructured":"Yuille AL, Rangarajan A (2001) The concave-convex procedure (CCCP). Adv Neural Inf Process Syst"},{"key":"9388_CR57","first-page":"1687","volume":"7","author":"R Collobert","year":"2006","unstructured":"Collobert R, Sinz F, Weston J, Bottou L, Joachims T (2006) Large scale transductive SVMs. J Mach Learn Res 7:1687\u20131712","journal-title":"J Mach Learn Res"},{"key":"9388_CR58","doi-asserted-by":"publisher","first-page":"3160","DOI":"10.1016\/j.neucom.2010.06.018","volume":"73","author":"H Cevikalp","year":"2010","unstructured":"Cevikalp H, Triggs B, Yavuz HS, Kucuk Y, Kucuk M, Barkana A (2010) Large margin classifiers based on affine hulls. Neurocomputing 73:3160\u20133168","journal-title":"Neurocomputing"},{"key":"9388_CR59","doi-asserted-by":"crossref","unstructured":"Tierney S, Gao J, Guo Y (2014) Subspace clustering for sequential data. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR)","DOI":"10.1109\/CVPR.2014.134"},{"key":"9388_CR60","first-page":"C5PC7J","volume":"10","author":"S Aeberhard","year":"1991","unstructured":"Aeberhard S, Forina M (1991) Wine. UCI Mach Learn Repos 10:C5PC7J","journal-title":"UCI Mach Learn Repos"},{"key":"9388_CR61","doi-asserted-by":"publisher","DOI":"10.24432\/C50P49","author":"E Alpaydin","year":"1998","unstructured":"Alpaydin E, Kaynak C (1998) Optical recognition of handwritten digits. UCI Mach Learn Repos. https:\/\/doi.org\/10.24432\/C50P49","journal-title":"UCI Mach Learn Repos"},{"key":"9388_CR62","doi-asserted-by":"publisher","DOI":"10.24432\/C5ZP40","author":"D Slate","year":"1991","unstructured":"Slate D (1991) Letter recognition. UCI Mach Learn Repos. https:\/\/doi.org\/10.24432\/C5ZP40","journal-title":"UCI Mach Learn Repos"},{"key":"9388_CR63","doi-asserted-by":"publisher","DOI":"10.24432\/C55887","author":"A Srinivasan","year":"1993","unstructured":"Srinivasan A (1993) Statlog (Landsat Satellite). UCI Mach Learn Repos. https:\/\/doi.org\/10.24432\/C55887","journal-title":"UCI Mach Learn Repos"},{"issue":"5","key":"9388_CR64","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/34.291440","volume":"16","author":"JJ Hull","year":"1994","unstructured":"Hull JJ (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal Mach Intell 16(5):550\u2013554. https:\/\/doi.org\/10.1109\/34.291440","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9388_CR65","doi-asserted-by":"publisher","DOI":"10.24432\/C5W01B","author":"V Sigillito","year":"1989","unstructured":"Sigillito V, Wing S, Hutton L, Baker K (1989) Ionosphere. UCI Mach Learn Repos. https:\/\/doi.org\/10.24432\/C5W01B","journal-title":"UCI Mach Learn Repos"},{"key":"9388_CR66","unstructured":"Nayar S, Murase H (1996) Columbia object image library: coil-100. Tech. Rep. CUCS-006-96, Department of Computer Science, Columbia University"},{"key":"9388_CR67","doi-asserted-by":"crossref","unstructured":"Ng H, Winkler S (2014) A data-driven approach to cleaning large face datasets. In: IEEE international conference on image processing (ICIP), pp 343\u2013347","DOI":"10.1109\/ICIP.2014.7025068"},{"key":"9388_CR68","doi-asserted-by":"crossref","unstructured":"Lang K (1995) Newsweeder: learning to filter netnews. In: International conference on machine learning","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"9388_CR69","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1038\/s41416-018-0185-8","volume":"119","author":"AH Saha","year":"2018","unstructured":"Saha AH (2018) A machine learning approach to radiogenomics of breast cancer: a study of 922 subjects and 529 DCE-MRI features. Br J Cancer 119:508\u2013516","journal-title":"Br J Cancer"},{"key":"9388_CR70","unstructured":"Huang GB, Ramesh M, Berg T, Learned-Miller E (2007) Labeled faces in the wild: a database for studying face recognition in unconstrained environments. Tech. Rep. 07-49, University of Massachusetts, Amherst"},{"key":"9388_CR71","doi-asserted-by":"crossref","unstructured":"Kumar N, Berg AC, Belhumeur PN, Nayar SK (2009) Attribute and simile classifiers for face verification. In: IEEE international conference on computer vision (ICCV)","DOI":"10.1109\/ICCV.2009.5459250"},{"key":"9388_CR72","doi-asserted-by":"publisher","first-page":"630","DOI":"10.3758\/BF03206543","volume":"36","author":"M Minear","year":"2004","unstructured":"Minear M, Park D (2004) A lifespan database of adult facial stimuli. Behav Res Methods Instrum Comput 36:630\u2013633","journal-title":"Behav Res Methods Instrum Comput"},{"key":"9388_CR73","unstructured":"U\u0159i\u010d\u00e1\u0159 M,\u00a0Franc V,\u00a0Hlav\u00e1\u010d V (2012) Detector of facial landmarks learned by the structured output SVM. In: Csurka G, Braz J (eds) VISAPP \u201912: Proceedings of the 7th international conference on computer vision theory and applications, vol 1. SciTePress\u2014Science and Technology Publications, Porto, pp 547\u2013556"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09388-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09388-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09388-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T09:12:09Z","timestamp":1710580329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09388-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":73,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09388-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2024,1,17]]},"assertion":[{"value":"13 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":3,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}