{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:55Z","timestamp":1740108055700,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10044-022-01116-w","type":"journal-article","created":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T21:09:14Z","timestamp":1669583354000},"page":"703-733","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Consensus similarity graph construction for clustering"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6260-0162","authenticated-orcid":false,"given":"T\u00fclin","family":"\u0130nkaya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,27]]},"reference":[{"key":"1116_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/b17320","volume-title":"Data clustering: algorithms and applications","author":"CC Aggarwal","year":"2014","unstructured":"Aggarwal CC, Reddy CK (2014) Data clustering: algorithms and applications. Chapman &Hall\/CRC, USA"},{"issue":"4","key":"1116_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"1116_CR3","unstructured":"Tan P-N, Steinbach M, Kumar V (2013) Data mining cluster analysis: basic concepts and algorithms. Introduction to data mining, 487\u2013533"},{"issue":"24","key":"1116_CR4","doi-asserted-by":"crossref","first-page":"9489","DOI":"10.1016\/j.eswa.2015.07.074","volume":"42","author":"T \u0130nkaya","year":"2015","unstructured":"\u0130nkaya T (2015) A parameter-free similarity graph for spectral clustering. Expert Syst Appl 42(24):9489\u20139498","journal-title":"Expert Syst Appl"},{"key":"1116_CR5","doi-asserted-by":"crossref","unstructured":"Nadler B, Galun M (2007) Fundamental limitations of spectral clustering. In: Advances in neural information processing systems, pp. 1017\u20131024","DOI":"10.7551\/mitpress\/7503.003.0132"},{"key":"1116_CR6","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems pp. 849\u2013856"},{"key":"1116_CR7","first-page":"1601","volume":"17","author":"L Zelnik-Manor","year":"2004","unstructured":"Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. Adv Neural Inf Process Syst 17:1601\u20131608","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"1116_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.patrec.2010.09.014","volume":"32","author":"X Zhang","year":"2011","unstructured":"Zhang X, Li J, Yu H (2011) Local density adaptive similarity measurement for spectral clustering. Pattern Recogn Lett 32(2):352\u2013358","journal-title":"Pattern Recogn Lett"},{"key":"1116_CR9","doi-asserted-by":"crossref","unstructured":"Correa CD, Lindstrom P (2012) Locally-scaled spectral clustering using empty region graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1330\u20131338","DOI":"10.1145\/2339530.2339736"},{"key":"1116_CR10","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106676","volume":"97","author":"G Mishra","year":"2020","unstructured":"Mishra G, Mohanty SK (2020) Efficient construction of an approximate similarity graph for minimum spanning tree based clustering. Appl Soft Comput 97:106676","journal-title":"Appl Soft Comput"},{"key":"1116_CR11","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2015.05.026","volume":"34","author":"C Chrysouli","year":"2015","unstructured":"Chrysouli C, Tefas A (2015) Spectral clustering and semi-supervised learning using evolving similarity graphs. Appl Soft Comput 34:625\u2013637","journal-title":"Appl Soft Comput"},{"issue":"04","key":"1116_CR12","doi-asserted-by":"crossref","first-page":"1750010","DOI":"10.1142\/S0218001417500100","volume":"31","author":"W Zang","year":"2017","unstructured":"Zang W, Jiang Z, Ren L (2017) Improved spectral clustering based on density combining dna genetic algorithm. Int J Pattern Recognit Artif Intell 31(04):1750010","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"11","key":"1116_CR13","doi-asserted-by":"crossref","first-page":"6435","DOI":"10.1007\/s00521-018-3836-z","volume":"32","author":"M Tan","year":"2020","unstructured":"Tan M, Zhang S, Wu L (2020) Mutual knn based spectral clustering. Neural Comput Appl 32(11):6435\u20136442","journal-title":"Neural Comput Appl"},{"key":"1116_CR14","volume-title":"Ensemble methods: foundations and algorithms","author":"Z-H Zhou","year":"2019","unstructured":"Zhou Z-H (2019) Ensemble methods: foundations and algorithms. Chapman and Hall\/CRC, USA"},{"issue":"03","key":"1116_CR15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons S, Ruiz-Shulcloper J (2011) A survey of clustering ensemble algorithms. Int J Pattern Recognit Artif Intell 25(03):337\u2013372","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"1116_CR16","doi-asserted-by":"crossref","unstructured":"Zhu X, Change\u00a0Loy C, Gong S (2014) Constructing robust affinity graphs for spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1450\u20131457","DOI":"10.1109\/CVPR.2014.188"},{"key":"1116_CR17","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.neucom.2014.10.012","volume":"151","author":"M Beauchemin","year":"2015","unstructured":"Beauchemin M (2015) A density-based similarity matrix construction for spectral clustering. Neurocomputing 151:835\u2013844","journal-title":"Neurocomputing"},{"key":"1116_CR18","first-page":"225","volume":"17","author":"MA Carreira-Perpin\u00e1n","year":"2005","unstructured":"Carreira-Perpin\u00e1n MA, Zemel RS (2005) Proximity graphs for clustering and manifold learning. Adv Neural Inf Process Syst 17:225\u2013232","journal-title":"Adv Neural Inf Process Syst"},{"key":"1116_CR19","doi-asserted-by":"crossref","unstructured":"Premachandran V, Kakarala R (2013) Consensus of k-nns for robust neighborhood selection on graph-based manifolds. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1594\u20131601","DOI":"10.1109\/CVPR.2013.209"},{"issue":"12","key":"1116_CR20","doi-asserted-by":"crossref","first-page":"4046","DOI":"10.1016\/j.csda.2009.07.017","volume":"53","author":"L Rokach","year":"2009","unstructured":"Rokach L (2009) Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography. Comput Stat Data Anal 53(12):4046\u20134072","journal-title":"Comput Stat Data Anal"},{"key":"1116_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.inffus.2013.04.006","volume":"16","author":"M Wo\u017aniak","year":"2014","unstructured":"Wo\u017aniak M, Grana M, Corchado E (2014) A survey of multiple classifier systems as hybrid systems. Inf Fusion 16:3\u201317","journal-title":"Inf Fusion"},{"key":"1116_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cosrev.2018.01.003","volume":"28","author":"T Boongoen","year":"2018","unstructured":"Boongoen T, Iam-On N (2018) Cluster ensembles: a survey of approaches with recent extensions and applications. Comput Sci Rev 28:1\u201325","journal-title":"Comput Sci Rev"},{"key":"1116_CR23","first-page":"636","volume":"50","author":"R Ghaemi","year":"2009","unstructured":"Ghaemi R, Sulaiman MN, Ibrahim H, Mustapha N et al (2009) A survey: clustering ensembles techniques. World Acad Sci Eng Technol 50:636\u2013645","journal-title":"World Acad Sci Eng Technol"},{"key":"1116_CR24","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles: a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"key":"1116_CR25","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/ICPR.2002.1047450","volume":"4","author":"AL Fred","year":"2002","unstructured":"Fred AL, Jain AK (2002) Data clustering using evidence accumulation. Object Recognit Support User Interact Service Robots 4:276\u2013280","journal-title":"Object Recognit Support User Interact Service Robots"},{"issue":"6","key":"1116_CR26","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","volume":"27","author":"AL Fred","year":"2005","unstructured":"Fred AL, Jain AK (2005) Combining multiple clusterings using evidence accumulation. IEEE Trans Pattern Anal Mach Intell 27(6):835\u2013850","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"1116_CR27","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1093\/bioinformatics\/btg038","volume":"19","author":"S Dudoit","year":"2003","unstructured":"Dudoit S, Fridlyand J (2003) Bagging to improve the accuracy of a clustering procedure. Bioinformatics 19(9):1090\u20131099","journal-title":"Bioinformatics"},{"issue":"4","key":"1116_CR28","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/TPAMI.2003.1190577","volume":"25","author":"B Fischer","year":"2003","unstructured":"Fischer B, Buhmann JM (2003) Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans Pattern Anal Mach Intell 25(4):513\u2013518","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"1116_CR29","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.patcog.2008.09.013","volume":"42","author":"X Wang","year":"2009","unstructured":"Wang X, Yang C, Zhou J (2009) Clustering aggregation by probability accumulation. Pattern Recogn 42(5):668\u2013675","journal-title":"Pattern Recogn"},{"issue":"1","key":"1116_CR30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10994-013-5339-6","volume":"98","author":"A Louren\u00e7o","year":"2015","unstructured":"Louren\u00e7o A, Bulo SR, Rebagliati N, Fred AL, Figueiredo MA, Pelillo M (2015) Probabilistic consensus clustering using evidence accumulation. Mach Learn 98(1):331\u2013357","journal-title":"Mach Learn"},{"issue":"5","key":"1116_CR31","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1109\/TCYB.2017.2702343","volume":"48","author":"D Huang","year":"2017","unstructured":"Huang D, Wang C-D, Lai J-H (2017) Locally weighted ensemble clustering. IEEE Trans Cybern 48(5):1460\u20131473","journal-title":"IEEE Trans Cybern"},{"key":"1116_CR32","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.patcog.2019.03.020","volume":"92","author":"C Zhong","year":"2019","unstructured":"Zhong C, Hu L, Yue X, Luo T, Fu Q, Xu H (2019) Ensemble clustering based on evidence extracted from the co-association matrix. Pattern Recogn 92:93\u2013106","journal-title":"Pattern Recogn"},{"key":"1116_CR33","doi-asserted-by":"crossref","first-page":"69210","DOI":"10.1109\/ACCESS.2018.2879851","volume":"6","author":"C Zhong","year":"2018","unstructured":"Zhong C, Luo T, Yue X (2018) Cluster ensemble based on iteratively refined co-association matrix. IEEE Access 6:69210\u201369223","journal-title":"IEEE Access"},{"issue":"8","key":"1116_CR34","doi-asserted-by":"crossref","first-page":"2699","DOI":"10.1016\/j.patcog.2015.02.014","volume":"48","author":"C Zhong","year":"2015","unstructured":"Zhong C, Yue X, Zhang Z, Lei J (2015) A clustering ensemble: Two-level-refined co-association matrix with path-based transformation. Pattern Recogn 48(8):2699\u20132709","journal-title":"Pattern Recogn"},{"issue":"5","key":"1116_CR35","doi-asserted-by":"crossref","first-page":"1943","DOI":"10.1016\/j.patcog.2009.11.012","volume":"43","author":"HG Ayad","year":"2010","unstructured":"Ayad HG, Kamel MS (2010) On voting-based consensus of cluster ensembles. Pattern Recogn 43(5):1943\u20131953","journal-title":"Pattern Recogn"},{"key":"1116_CR36","doi-asserted-by":"crossref","unstructured":"Fern XZ, Brodley CE (2004) Solving cluster ensemble problems by bipartite graph partitioning. In: Proceedings of the twenty-first international conference on machine learning, p. 36","DOI":"10.1145\/1015330.1015414"},{"issue":"1","key":"1116_CR37","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"12","key":"1116_CR38","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"A Topchy","year":"2005","unstructured":"Topchy A, Jain AK, Punch W (2005) Clustering ensembles: models of consensus and weak partitions. IEEE Trans Pattern Anal Mach Intell 27(12):1866\u20131881","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1116_CR39","doi-asserted-by":"crossref","unstructured":"Topchy A, Jain AK, Punch W (2004) A mixture model for clustering ensembles. In: Proceedings of the 2004 SIAM international conference on data mining, pp. 379\u2013390","DOI":"10.1137\/1.9781611972740.35"},{"issue":"3","key":"1116_CR40","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.patcog.2010.09.008","volume":"44","author":"S Mimaroglu","year":"2011","unstructured":"Mimaroglu S, Erdil E (2011) Combining multiple clusterings using similarity graph. Pattern Recogn 44(3):694\u2013703","journal-title":"Pattern Recogn"},{"key":"1116_CR41","doi-asserted-by":"crossref","DOI":"10.1016\/j.datak.2019.101754","volume":"124","author":"SS Hamidi","year":"2019","unstructured":"Hamidi SS, Akbari E, Motameni H (2019) Consensus clustering algorithm based on the automatic partitioning similarity graph. Data Knowl Eng 124:101754","journal-title":"Data Knowl Eng"},{"issue":"5","key":"1116_CR42","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.patcog.2012.11.017","volume":"46","author":"Y Lu","year":"2013","unstructured":"Lu Y, Wan Y (2013) Pha: a fast potential-based hierarchical agglomerative clustering method. Pattern Recogn 46(5):1227\u20131239","journal-title":"Pattern Recogn"},{"issue":"5","key":"1116_CR43","first-page":"7","volume":"16","author":"S Belhadj","year":"2016","unstructured":"Belhadj S, Attia A, Adnane BA, Ahmed-Foitih Z, Ahmed AT (2016) A novel epileptic seizure detection using fast potential-based hierarchical agglomerative clustering based on emd. Int J Comput Sci Netw Secur 16(5):7\u201312","journal-title":"Int J Comput Sci Netw Secur"},{"issue":"5","key":"1116_CR44","first-page":"222","volume":"14","author":"A Attia","year":"2016","unstructured":"Attia A, Frahta N, Moussaoui A, Belhadj S (2016) An efficient fmri data clustering method using pha algorithm and dynamic time warping. Int J Comput Sci Inf Secur 14(5):222\u2013230","journal-title":"Int J Comput Sci Inf Secur"},{"key":"1116_CR45","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.ins.2019.08.048","volume":"508","author":"Z Cai","year":"2020","unstructured":"Cai Z, Yang X, Huang T, Zhu W (2020) A new similarity combining reconstruction coefficient with pairwise distance for agglomerative clustering. Inf Sci 508:173\u2013182","journal-title":"Inf Sci"},{"key":"1116_CR46","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.neucom.2015.01.090","volume":"173","author":"Y Lu","year":"2016","unstructured":"Lu Y, Hou X, Chen X (2016) A novel travel-time based similarity measure for hierarchical clustering. Neurocomputing 173:3\u20138","journal-title":"Neurocomputing"},{"issue":"1","key":"1116_CR47","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0167-7152(96)00213-1","volume":"35","author":"MR Brito","year":"1997","unstructured":"Brito MR, Ch\u00e1vez EL, Quiroz AJ, Yukich JE (1997) Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Stat Probab Lett 35(1):33\u201342","journal-title":"Stat Probab Lett"},{"key":"1116_CR48","volume-title":"Pattern classification","author":"R Duda","year":"2012","unstructured":"Duda R, Hart P, Stork D (2012) Pattern classification. Wiley, New York"},{"issue":"4","key":"1116_CR49","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC-C Yao","year":"1982","unstructured":"Yao AC-C (1982) On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J Comput 11(4):721\u2013736","journal-title":"SIAM J Comput"},{"issue":"4","key":"1116_CR50","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint GT (1980) The relative neighbourhood graph of a finite planar set. Pattern Recogn 12(4):261\u2013268. https:\/\/doi.org\/10.1016\/0031-3203(80)90066-7","journal-title":"Pattern Recogn"},{"issue":"3","key":"1116_CR51","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel KR, Sokal RR (1969) A new statistical approach to geographic variation analysis. Syst Zool 18(3):259\u2013278. https:\/\/doi.org\/10.2307\/2412323","journal-title":"Syst Zool"},{"key":"1116_CR52","doi-asserted-by":"crossref","unstructured":"Topchy A, Minaei-Bidgoli B, Jain AK, Punch WF (2004) Adaptive clustering ensembles. In: Proceedings of the 17th international conference on pattern recognition. ICPR 2004, pp. 272\u2013275","DOI":"10.1109\/ICPR.2004.1334105"},{"issue":"3","key":"1116_CR53","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s11634-020-00423-6","volume":"15","author":"A Casa","year":"2021","unstructured":"Casa A, Scrucca L, Menardi G (2021) Better than the best? answers via model ensemble in density-based clustering. Adv Data Anal Classif 15(3):599\u2013623","journal-title":"Adv Data Anal Classif"},{"key":"1116_CR54","doi-asserted-by":"crossref","unstructured":"Jain AK, Law MH (2005) Data clustering: A user\u2019s dilemma. In: International conference on pattern recognition and machine intelligence, pp. 1\u201310. Springer","DOI":"10.1007\/11590316_1"},{"issue":"9","key":"1116_CR55","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1016\/j.patrec.2008.01.028","volume":"29","author":"D Liu","year":"2008","unstructured":"Liu D, Nosovskiy GV, Sourina O (2008) Effective clustering and boundary detection algorithm based on delaunay triangulation. Pattern Recogn Lett 29(9):1261\u20131273","journal-title":"Pattern Recogn Lett"},{"key":"1116_CR56","unstructured":"Ultsch A (2005) Clustering wih som: U*c. In: Proceedings of the workshop on self-organizing maps, pp. 75\u201382"},{"key":"1116_CR57","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"8","key":"1116_CR58","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"1116_CR59","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"100","author":"CT Zahn","year":"1971","unstructured":"Zahn CT (1971) Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput 100(1):68\u201386","journal-title":"IEEE Trans Comput"},{"key":"1116_CR60","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Morgan Kaufmann, Burlington"},{"issue":"336","key":"1116_CR61","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"1116_CR62","unstructured":"Fred A, Jain AK (2003) Robust data clustering. In: Proceedings of the 2003 IEEE Computer society conference on computer vision and pattern recognition, pp. II\u2013II"},{"key":"1116_CR63","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-1-4612-4380-9_16","volume-title":"Breakthroughs in statistics","author":"F Wilcoxon","year":"1992","unstructured":"Wilcoxon F (1992) Individual comparisons by ranking methods. In: Johnson NL (ed) Breakthroughs in statistics. Springer, New York, pp 196\u2013202"},{"issue":"1","key":"1116_CR64","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E Bauer","year":"1999","unstructured":"Bauer E, Kohavi R (1999) An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach Learn 36(1):105\u2013139","journal-title":"Mach Learn"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-022-01116-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-022-01116-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-022-01116-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T22:48:25Z","timestamp":1701470905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-022-01116-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,27]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1116"],"URL":"https:\/\/doi.org\/10.1007\/s10044-022-01116-w","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"type":"print","value":"1433-7541"},{"type":"electronic","value":"1433-755X"}],"subject":[],"published":{"date-parts":[[2022,11,27]]},"assertion":[{"value":"6 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2022","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 author has no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}