{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T13:47:16Z","timestamp":1777643236578,"version":"3.51.4"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004913","name":"Universit\u00e0 degli Studi di Palermo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004913","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Decision tree learning is among the most popular and most traditional families of machine learning algorithms. While these techniques excel in being quite intuitive and interpretable, they also suffer from instability: small perturbations in the training data may result in big changes in the predictions. The so-called ensemble methods combine the output of multiple trees, which makes the decision more reliable and stable. They have been primarily applied to numeric prediction problems and to classification tasks. In the last years, some attempts to extend the ensemble methods to ordinal data can be found in the literature, but no concrete methodology has been provided for preference data. In this paper, we extend decision trees, and in the following also ensemble methods to ranking data. In particular, we propose a theoretical and computational definition of bagging and boosting, two of the best known ensemble methods. In an experimental study using simulated data and real-world datasets, our results confirm that known results from classification, such as that boosting outperforms bagging, could be successfully carried over to the ranking case.<\/jats:p>","DOI":"10.1007\/s00357-021-09397-2","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T20:08:13Z","timestamp":1630699693000},"page":"78-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Comparing Boosting and Bagging for Decision Trees of Rankings"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7811-2430","authenticated-orcid":false,"given":"Antonella","family":"Plaia","sequence":"first","affiliation":[]},{"given":"Simona","family":"Buscemi","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[]},{"given":"Eneldo Loza","family":"Menc\u00eda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"9397_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.inffus.2016.09.002","volume":"35","author":"JA Aledo","year":"2017","unstructured":"Aledo, JA, G\u00e1mez, JA, & Molina, D (2017). Tackling the supervised label ranking problem by bagging weak learners. Information Fusion, 35, 38\u201350.","journal-title":"Information Fusion"},{"issue":"2","key":"9397_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v054.i02","volume":"54","author":"E Alfaro","year":"2013","unstructured":"Alfaro, E, G\u00e1mez, M, & Garc\u00eda, N (2013). Adabag: An R package for classification with boosting and bagging. Journal of Statistical Software, 54(2), 1\u201335.","journal-title":"Journal of Statistical Software"},{"issue":"2","key":"9397_CR3","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.ejor.2015.08.048","volume":"249","author":"S Amodio","year":"2016","unstructured":"Amodio, S, D\u2019Ambrosio, A, & Siciliano, R (2016). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research, 249(2), 667\u2013676.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9397_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/00273171.2012.640600","volume":"47","author":"PC Austin","year":"2012","unstructured":"Austin, PC (2012). Using ensemble-based methods for directly estimating causal effects: an investigation of tree-based g-computation. Multivariate Behavioral Research, 47(1), 115\u2013135.","journal-title":"Multivariate Behavioral Research"},{"issue":"2","key":"9397_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L (1996). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"issue":"3","key":"9397_CR6","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L Breiman","year":"1998","unstructured":"Breiman, L (1998). Arcing classifier (with discussion and a rejoinder by the author). The Annals of Statistics, 26(3), 801\u2013849.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"9397_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"9397_CR8","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L, Friedman, JH, Olshen, R, & Stone, C. (1984). Classification and regression trees. Wadsworth & Brooks: Pacific Grove."},{"key":"9397_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fchlmann, P. (2003). Bagging, subagging and bragging for improving some prediction algorithms. Tech. rep., ETH Zurich, Switzerland. ftp:\/\/ftp.stat.math.ethz.ch\/Research-Reports\/113.pdf.","DOI":"10.1016\/B978-044451378-6\/50002-8"},{"key":"9397_CR10","unstructured":"B\u00fchlmann, P, & Yu, B. (2000). Explaining bagging. Tech. rep., ETH Zurich, Switzerland. ftp:\/\/ess.r-project.org\/pub\/Research-Reports\/92.pdf."},{"issue":"4","key":"9397_CR11","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1214\/aos\/1031689014","volume":"30","author":"P B\u00fchlmann","year":"2002","unstructured":"B\u00fchlmann, P, & Yu, B (2002). Analyzing bagging. The Annals of Statistics, 30(4), 927\u2013961.","journal-title":"The Annals of Statistics"},{"key":"9397_CR12","first-page":"323","volume":"13","author":"A Buja","year":"2006","unstructured":"Buja, A, & Stuetzle, W (2006). Observations on bagging. Statistica Sinica, 13, 323\u2013351.","journal-title":"Statistica Sinica"},{"key":"9397_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jmateco.2014.01.002","volume":"51","author":"B Can","year":"2014","unstructured":"Can, B (2014). Weighted distances between preferences. Journal of Mathematical Economics, 51, 109\u2013115.","journal-title":"Journal of Mathematical Economics"},{"key":"9397_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, W, Huhn, J, & H\u00fcllermeier, E (2009). Decision tree and instance-based learning for label ranking. In Proceedings of the 26th International Conference On Machine Learning, ICML 2009, vol 382, p 21. https:\/\/www.informatik.uni-marburg.de\/eyke\/publications\/icml09.pdf.","DOI":"10.1145\/1553374.1553395"},{"issue":"2","key":"9397_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1051\/ro\/1986200201151","volume":"20","author":"WD Cook","year":"1986","unstructured":"Cook, WD, Kress, M, & Seiford, LM (1986). An axiomatic approach to distance on partial orderings. RAIRO-Operations Research, 20(2), 115\u2013122.","journal-title":"RAIRO-Operations Research"},{"key":"9397_CR16","volume-title":"Tree-based methods for data editing and preference rankings","author":"A D\u2019Ambrosio","year":"2008","unstructured":"D\u2019Ambrosio, A. (2008). Tree-based methods for data editing and preference rankings. Italy: PhD thesis, Department of Mathematics and Statistics, Naples. http:\/\/www.fedoa.unina.it\/2746\/."},{"issue":"3","key":"9397_CR17","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s11336-016-9505-1","volume":"81","author":"A D\u2019Ambrosio","year":"2016","unstructured":"D\u2019Ambrosio, A, & Heiser, WJ (2016). A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances. Psychometrika, 81(3), 774\u2013794.","journal-title":"Psychometrika"},{"issue":"2","key":"9397_CR18","first-page":"198","volume":"8","author":"A D\u2019Ambrosio","year":"2015","unstructured":"D\u2019Ambrosio, A, Amodio, S, & Iorio, C (2015a). Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Electronic Journal of Applied Statistical Analysis, 8(2), 198\u2013213.","journal-title":"Electronic Journal of Applied Statistical Analysis"},{"key":"9397_CR19","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, A, Amodio, S, & Mazzeo, G. (2015b). Consrank: compute the median ranking(s) according to the Kemeny\u2019s axiomatic approach. r package version 1.0.2.","DOI":"10.32614\/CRAN.package.ConsRank"},{"key":"9397_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.cor.2017.01.017","volume":"82","author":"A D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio, A, Mazzeo, G, Iorio, C, & Siciliano, R (2017). A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach. Computers & Operations Research, 82, 126\u2013138.","journal-title":"Computers & Operations Research"},{"key":"9397_CR21","volume-title":"The method of paired comparisons (2 ed.), volume 12 of Griffin\u2019s Statistical Monographs & Courses","author":"HA David","year":"1969","unstructured":"David, HA. (1969). The method of paired comparisons (2 ed.), volume 12 of Griffin\u2019s Statistical Monographs & Courses. London: Charles Griffin & Company Limited."},{"key":"9397_CR22","doi-asserted-by":"publisher","first-page":"176023","DOI":"10.1109\/ACCESS.2020.3026758","volume":"8","author":"L Dery","year":"2020","unstructured":"Dery, L, & Shmueli, E (2020). BoostLR: A boosting-based learning ensemble for label ranking tasks. IEEE Access, 8, 176023\u2013176032.","journal-title":"IEEE Access"},{"key":"9397_CR23","doi-asserted-by":"crossref","unstructured":"Dietterich, TG (2000). Ensemble methods in machine learning. In J Kittler F Roli (Eds.) Multiple Classifier Systems, Springer-Verlag, pp 1\u201315. ftp:\/\/ftp.cs.orst.edu\/pub\/tgd\/papers\/mcs-ensembles.ps.gz.","DOI":"10.1007\/3-540-45014-9_1"},{"key":"9397_CR24","doi-asserted-by":"crossref","unstructured":"Efron, B. (1982). The Jackknife, the Bootstrap, and Other Resampling Plans. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611970319"},{"issue":"1","key":"9397_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/mcda.313","volume":"11","author":"EJ Emond","year":"2002","unstructured":"Emond, EJ, & Mason, DW (2002). A new rank correlation coefficient with application to the consensus ranking problem. Journal of Multi-Criteria Decision Analysis, 11(1), 17\u201328.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"9397_CR26","unstructured":"Freund, Y, & Schapire, RE (1996). Experiments with a new boosting algorithm. In L Saitta (Ed.) Proceedings of the 13th International Conference on Machine Learning, Morgan Kaufmann, Bari, Italy, pp 148\u2013156. https:\/\/cseweb.ucsd.edu\/yfreund\/papers\/boostingexperiments.pdf."},{"issue":"3","key":"9397_CR27","first-page":"824","volume":"26","author":"Y Freund","year":"1998","unstructured":"Freund, Y, & Schapire, RE (1998). Discussion: Arcing classifiers. The Annals of Statistics, 26(3), 824\u2013832.","journal-title":"The Annals of Statistics"},{"key":"9397_CR28","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund, Y, Iyer, RD, Schapire, RE, & Singer, Y (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"9397_CR29","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.jspi.2006.06.002","volume":"137","author":"JH Friedman","year":"2007","unstructured":"Friedman, JH, & Hall, P (2007). On bagging and nonlinear estimation. Journal of Statistical Planning and Inference, 137(3), 669\u2013683.","journal-title":"Journal of Statistical Planning and Inference"},{"key":"9397_CR30","volume-title":"Preference Learning","year":"2011","unstructured":"In J F\u00fcrnkranz E H\u00fcllermeier (Eds.) (2011). Preference Learning. Berlin: Springer-Verlag."},{"key":"9397_CR31","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Lapresta, JL, & P\u00e9rez-Rom\u00e1n, D (2010). Consensus measures generated by weighted Kemeny distances on weak orders. In 2010 10th International Conference on Intelligent Systems Design and Applications, IEEE, pp 463\u2013468. https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=5687220.","DOI":"10.1109\/ISDA.2010.5687220"},{"issue":"2","key":"9397_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1080\/00949658008810357","volume":"10","author":"I Good","year":"1980","unstructured":"Good, I (1980). C59. the number of orderings of n candidates when ties and omissions are both allowed. Journal of Statistical Computation and Simulation, 10 (2), 159.","journal-title":"Journal of Statistical Computation and Simulation"},{"issue":"0","key":"9397_CR33","first-page":"1","volume":"0","author":"KJ Grimm","year":"2020","unstructured":"Grimm, KJ, & Jacobucci, R (2020). Reliable trees: Reliability informed recursive partitioning for psychological data. Multivariate Behavioral Research, 0 (0), 1\u201313.","journal-title":"Multivariate Behavioral Research"},{"issue":"498","key":"9397_CR34","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/01621459.2012.682539","volume":"107","author":"P Hall","year":"2012","unstructured":"Hall, P, & Schimek, M (2012). Moderate-deviation-based inference for random degeneration in paired rank lists. Journal of the American Statistical Association, 107(498), 661\u2013672.","journal-title":"Journal of the American Statistical Association"},{"key":"9397_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T, Tibshirani, R, & Friedman, JH. (2009). The Elements of Statistical Learning. Berlin: Springer-Verlag."},{"key":"9397_CR36","doi-asserted-by":"crossref","unstructured":"Heiser, WJ, & D\u2019Ambrosio, A (2013). Clustering and prediction of rankings within a Kemeny distance framework. In B Lausen D UA Van den Poel (Eds.) Algorithms from and for nature and life, springer international publishing switzerland (pp. 19\u201331).","DOI":"10.1007\/978-3-319-00035-0_2"},{"issue":"16-17","key":"9397_CR37","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1016\/j.artint.2008.08.002","volume":"172","author":"E H\u00fcllermeier","year":"2008","unstructured":"H\u00fcllermeier, E, F\u00fcrnkranz, J, Cheng, W, & Brinker, K (2008). Label ranking by learning pairwise preferences. Artificial Intelligence, 172(16-17), 1897\u20131916.","journal-title":"Artificial Intelligence"},{"key":"9397_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An introduction to statistical learning: with applications in R","author":"G James","year":"2013","unstructured":"James, G, Witten, D, Hastie, T, & Tibshirani, R. (2013). An introduction to statistical learning: with applications in R. New York: NY."},{"key":"9397_CR39","unstructured":"Kemeny, JG, & Snell, L. (1962). Preference ranking: an axiomatic approach. In Mathematical Models in the Social Sciences, Ginn, New York, 9\u201323."},{"key":"9397_CR40","doi-asserted-by":"crossref","unstructured":"Kumar, R, & Vassilvitskii, S (2010). Generalized distances between rankings. In Proceedings of the 19th international conference on World wide web, ACM, pp 571\u2013580. http:\/\/theory.stanford.edu\/sergei\/papers\/www10-metrics.pdf.","DOI":"10.1145\/1772690.1772749"},{"issue":"6","key":"9397_CR41","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.csda.2010.01.027","volume":"54","author":"PH Lee","year":"2010","unstructured":"Lee, PH, & Yu, PLH (2010). Distance-based tree models for ranking data. Computational Statistics & Data Analysis, 54(6), 1672\u20131682.","journal-title":"Computational Statistics & Data Analysis"},{"issue":"1\u20132","key":"9397_CR42","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows, CL (1957). Non-null ranking models. Biometrika, 44(1\u20132), 114\u2013130.","journal-title":"Biometrika"},{"key":"9397_CR43","unstructured":"Marcus, P. (2013). Comparison of heterogeneous probability models for ranking data. Master\u2019s thesis, Leiden University. http:\/\/www.math.leidenuniv.nl\/scripties\/1MasterMarcus.pdf."},{"issue":"3","key":"9397_CR44","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1037\/1082-989X.10.3.285","volume":"10","author":"A Maydeu-Olivares","year":"2005","unstructured":"Maydeu-Olivares, A, & Bockenholt, U (2005). Structural equation modeling of paired-comparison and ranking data. Psychological Methods, 10(3), 285\u2013304.","journal-title":"Psychological Methods"},{"key":"9397_CR45","doi-asserted-by":"crossref","unstructured":"Maydeu-Olivares, A, & Bockenholt, U (2009). Modeling preference data. In RE Millsap A Maydeu-Olivares (Eds.) The SAGE Handbook of Quantitative Methods in Psychology. Sage Publications Ltd, pp 264\u2013282.","DOI":"10.4135\/9780857020994.n12"},{"issue":"6","key":"9397_CR46","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1080\/02664763.2017.1339025","volume":"45","author":"D M\u00fcllensiefen","year":"2018","unstructured":"M\u00fcllensiefen, D, Hennig, C, & Howells, H (2018). Using clustering of rankings to explain brand preferences with personality and socio-demographic variables. Journal of Applied Statistics, 45(6), 1009\u20131029.","journal-title":"Journal of Applied Statistics"},{"issue":"4","key":"9397_CR47","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1009744630224","volume":"2","author":"SK Murthy","year":"1998","unstructured":"Murthy, SK (1998). Automatic construction of decision trees from data: a multi-disciplinary survey. Data Mining and Knowledge Discovery, 2(4), 345\u2013389.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"6","key":"9397_CR48","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1016\/j.csda.2009.12.011","volume":"54","author":"R Piccarreta","year":"2010","unstructured":"Piccarreta, R (2010). Binary trees for dissimilarity data. Computational Statistics & Data Analysis, 54 (6), 1516\u20131524.","journal-title":"Computational Statistics & Data Analysis"},{"key":"9397_CR49","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11634-017-0306-x","volume":"13","author":"A Plaia","year":"2019","unstructured":"Plaia, A, & Sciandra, M (2019). Weighted distance-based trees for ranking data. Advances in Data Analysis and Classification, 13, 427\u2013424.","journal-title":"Advances in Data Analysis and Classification"},{"key":"9397_CR50","doi-asserted-by":"publisher","unstructured":"Plaia, A, Buscemi, S, & Sciandra, M (2021). Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings. Advances in Data Analysis and Classification https:\/\/doi.org\/10.1007\/s11634-021-00442-x.","DOI":"10.1007\/s11634-021-00442-x"},{"key":"9397_CR51","unstructured":"R Core Team. (2020). R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. https:\/\/www.R-project.org\/."},{"issue":"4","key":"9397_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01556-4","volume":"5","author":"F Rossi","year":"2011","unstructured":"Rossi, F, Venable, KB, & Walsh, T (2011). A short introduction to preferences: Between artificial intelligence and social choice. Synthesis Lectures on Artificial Intelligence and Machine Learning, 5(4), 1\u2013102.","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"issue":"3","key":"9397_CR53","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1177\/014662167800200316","volume":"2","author":"JBJr Rounds","year":"1978","unstructured":"Rounds, JB Jr, Miller, TW, & Dawis, RV (1978). Comparability of multiple rank order and paired comparison methods. Applied Psychological Measurement, 2(3), 415\u2013422.","journal-title":"Applied Psychological Measurement"},{"key":"9397_CR54","doi-asserted-by":"crossref","unstructured":"de S\u00e1, CR, Rebelo, C, Soares, C, Knobbe, A, & Cortez, P (2015). Distance-based decision tree algorithms for label ranking. In Progress in Artificial Intelligence \u2013 17th Portuguese Conference on Artificial Intelligence (EPIA), pp 525\u2013534. https:\/\/repositorio.inesctec.pt\/bitstream\/123456789\/3924\/1\/P-00G-SXT.pdf.","DOI":"10.1007\/978-3-319-23485-4_52"},{"issue":"1","key":"9397_CR55","first-page":"1","volume":"34","author":"CR de S\u00e1","year":"2017","unstructured":"de S\u00e1, C R, Soares, C, Knobbe, A, & Cortez, P (2017). Label ranking forests. Expert Systems, 34(1), 1\u20138.","journal-title":"Expert Systems"},{"key":"9397_CR56","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1007\/s10994-018-5743-z","volume":"107","author":"CR de S\u00e1","year":"2018","unstructured":"de S\u00e1, C R, Duivesteijn, W, Azevedo, P, Jorge, AM, Soares, C, & Knobbe, A (2018). Discovering a taste for the unusual: exceptional models for preference mining. Machine Learning, 107, 1775\u20131807.","journal-title":"Machine Learning"},{"issue":"6","key":"9397_CR57","first-page":"458","volume":"6","author":"S Sampath","year":"2013","unstructured":"Sampath, S, & Verducci, J (2013). Detecting the end of agreement between two long ranked lists. The ASA Data Science Journal, 6(6), 458\u2013471.","journal-title":"The ASA Data Science Journal"},{"key":"9397_CR58","unstructured":"Sciandra, M, Plaia, A, & Picone, V (2015). Recursive partitioning: an approach based on the weighted Kemeny distance. In Proceedings of the 10th scientific meeting of the classification and data analysis group of the italian statistical society (CLADAG 2015), CUEC Editrice, pp 494\u2013497. https:\/\/meetings3.sis-statistica.org\/index.php\/sis2018\/50th\/paper\/viewFile\/1377\/163."},{"issue":"4","key":"9397_CR59","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/00273171.2018.1461602","volume":"53","author":"G Stegmann","year":"2018","unstructured":"Stegmann, G, Jacobucci, R, Serang, S, & Grimm, KJ (2018). Recursive partitioning with nonlinear models of change. Multivariate Behavioral Research, 53(4), 559\u2013570.","journal-title":"Multivariate Behavioral Research"},{"key":"9397_CR60","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.csda.2017.05.010","volume":"115","author":"V Svendova","year":"2017","unstructured":"Svendova, V, & Schimek, M (2017). A novel method for estimating the common signals for consensus across multiple ranked lists. Computational Statistics & Data Analysis, 115, 122\u2013135.","journal-title":"Computational Statistics & Data Analysis"},{"key":"9397_CR61","doi-asserted-by":"crossref","unstructured":"Vembu, S, & G\u00e4rtner, T (2010). Label ranking algorithms: a survey. In J F\u00fcrnkranz E H\u00fcllermeier (Eds.) Preference Learning (pp. 45\u201364). Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-642-14125-6_3"},{"key":"9397_CR62","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.eswa.2019.06.022","volume":"136","author":"H Werbin-Ofir","year":"2019","unstructured":"Werbin-Ofir, H, Dery, L, & Shmueli, E (2019). Beyond majority: Label ranking ensembles based on voting rules. Expert Systems with Applications, 136, 50\u201361.","journal-title":"Expert Systems with Applications"},{"key":"9397_CR63","doi-asserted-by":"crossref","unstructured":"Yu, PLH, Wan, WM, & Lee, PH In F\u00fcrnkranz j E H\u00fcllermeier (Eds.) (2010). Decision tree modeling for ranking data. Preference Learning: Springer-Verlag Berlin Heidelberg.","DOI":"10.1007\/978-3-642-14125-6_5"},{"key":"9397_CR64","doi-asserted-by":"crossref","unstructured":"Zhou, S, & Mentch, L. (2021). Trees, forests, chickens, and eggs: When and why to prune trees in a random forest. arXiv:210316700v1.","DOI":"10.1002\/sam.11594"},{"key":"9397_CR65","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.eswa.2018.06.036","volume":"112","author":"Y Zhou","year":"2018","unstructured":"Zhou, Y, & Qiu, G (2018). Random forest for label ranking. Expert Systems with Applications, 112, 99\u2013109.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"9397_CR66","doi-asserted-by":"publisher","first-page":"557","DOI":"10.4304\/jcp.9.3.557-565","volume":"9","author":"Y Zhou","year":"2014","unstructured":"Zhou, Y, Liu, Y, Yang, J, He, X, & Liu, L (2014). A taxonomy of label ranking algorithms. Journal of Computers, 9(3), 557\u2013565.","journal-title":"Journal of Computers"}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-021-09397-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00357-021-09397-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-021-09397-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:15:41Z","timestamp":1725736541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00357-021-09397-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["9397"],"URL":"https:\/\/doi.org\/10.1007\/s00357-021-09397-2","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,3]]},"assertion":[{"value":"10 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}