{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T10:51:46Z","timestamp":1785840706721,"version":"3.56.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T00:00:00Z","timestamp":1695772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T00:00:00Z","timestamp":1695772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Ensemble classifiers have been investigated by many in the artificial intelligence and machine learning community. Majority voting and weighted majority voting are two commonly used combination schemes in ensemble learning. However, understanding of them is incomplete at best, with some properties even misunderstood. In this paper, we present a group of properties of these two schemes formally under a geometric framework. Two key factors, every component base classifier\u2019s performance and dissimilarity between each pair of component classifiers are evaluated by the same metric\u2014the Euclidean distance. Consequently, ensembling becomes a deterministic problem and the performance of an ensemble can be calculated directly by a formula. We prove several theorems of interest and explain their implications for ensembles. In particular, we compare and contrast the effect of the number of component classifiers on these two types of ensemble schemes. Some important properties of both combination schemes are discussed. And a method to calculate the optimal weights for the weighted majority voting is presented. Empirical investigation is conducted to verify the theoretical results. We believe that the results from this paper are very useful for us to understand the fundamental properties of these two combination schemes and the principles of ensemble classifiers in general. The results are also helpful for us to investigate some issues in ensemble classifiers, such as ensemble performance prediction, diversity, ensemble pruning, and others.<\/jats:p>","DOI":"10.1007\/s10994-023-06406-w","type":"journal-article","created":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T21:01:45Z","timestamp":1695848505000},"page":"4929-4958","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A geometric framework for multiclass ensemble classifiers"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2008-1736","authenticated-orcid":false,"given":"Shengli","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinlong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weimin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,27]]},"reference":[{"key":"6406_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.knosys.2016.07.016","volume":"110","author":"MN Adnan","year":"2016","unstructured":"Adnan, M. N., & Islam, M. Z. (2016). Optimizing the number of trees in a decision forest to discover a subforest with high ensemble accuracy using a genetic algorithm. Knowledge-Based Systems, 110, 86\u201397.","journal-title":"Knowledge-Based Systems"},{"key":"6406_CR2","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1007\/s11135-014-0090-z","volume":"49","author":"S Bashir","year":"2015","unstructured":"Bashir, S., Qamar, U., & Khan, F. H. (2015). Heterogeneous classifiers fusion for dynamic breast cancer diagnosis using weighted vote based ensemble. Quality and Quantity, 49, 2061\u20132076.","journal-title":"Quality and Quantity"},{"key":"6406_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.patcog.2016.03.017","volume":"57","author":"M Bhardwaj","year":"2016","unstructured":"Bhardwaj, M., Bhatnagar, V., & Sharma, K. (2016). Cost-effectiveness of classification ensembles. Pattern Recognition, 57, 84\u201396.","journal-title":"Pattern Recognition"},{"issue":"4","key":"6406_CR4","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.ijar.2011.12.011","volume":"53","author":"Y Bi","year":"2012","unstructured":"Bi, Y. (2012). The impact of diversity on the accuracy of evidential classifier ensembles. International Journal of Approximate Reasoning, 53(4), 584\u2013607.","journal-title":"International Journal of Approximate Reasoning"},{"key":"6406_CR5","doi-asserted-by":"crossref","unstructured":"Bonab, H.R., & Can, F. (2018). GOOWE: geometrically optimum and online-weighted ensemble classifier for evolving data streams. ACM Transactions on Knowledge Discovery from Data, 12(2):25:1\u201325:33.","DOI":"10.1145\/3139240"},{"issue":"9","key":"6406_CR6","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1109\/TNNLS.2018.2886341","volume":"30","author":"HR Bonab","year":"2019","unstructured":"Bonab, H. R., & Can, F. (2019). Less is more: A comprehensive framework for the number of components of ensemble classifiers. IEEE Transactions on Neural Networks and Learning Systems, 30(9), 2735\u20132745.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"6406_CR7","doi-asserted-by":"crossref","unstructured":"Bousquet, O., Boucheron, S., & Lugosi, G. (2003). Introduction to statistical learning theory. Lecture Notes in Computer ScienceIn O. Bousquet, U. von Luxburg, & G. R\u00e4tsch (Eds.), Advanced Lectures on Machine Learning, ML Summer Schools 2003, Canberra, Australia, February 2\u201314, 2003, T\u00fcbingen, Germany, August 4\u201316, 2003, Revised Lectures (Vol. 3176, pp. 169\u2013207). Springer.","DOI":"10.1007\/978-3-540-28650-9_8"},{"key":"6406_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.neucom.2014.02.072","volume":"149","author":"J Cao","year":"2015","unstructured":"Cao, J., Kwong, S., Wang, R., et al. (2015). Class-specific soft voting based multiple extreme learning machines ensemble. Neurocomputing, 149, 275\u2013284.","journal-title":"Neurocomputing"},{"key":"#cr-split#-6406_CR9.1","doi-asserted-by":"crossref","unstructured":"Caruana, R., Niculescu-Mizil, A., Crew, G., et\u00a0al. (2004). Ensemble selection from libraries of models. In: Brodley CE","DOI":"10.1145\/1015330.1015432"},{"key":"#cr-split#-6406_CR9.2","unstructured":"(ed) Proceedings of the Twenty-first International Conference on Machine Learning (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, ACM International Conference Proceeding Series, vol\u00a069. ACM."},{"key":"6406_CR10","doi-asserted-by":"crossref","unstructured":"Derbeko, P., El-Yaniv, R., & Meir, R. (2002). Variance optimized bagging. Lecture Notes in Computer ScienceIn T. Elomaa, H. Mannila, & H. Toivonen (Eds.), Machine Learning: ECML 2002, 13th European Conference on Machine Learning, Helsinki, Finland, August 19\u201323, 2002, Proceedings (Vol. 2430, pp. 60\u201371). Springer.","DOI":"10.1007\/3-540-36755-1_6"},{"key":"6406_CR11","doi-asserted-by":"crossref","unstructured":"Dias, K., & Windeatt. T. (2014). Dynamic ensemble selection and instantaneous pruning for regression used in signal calibration. In: Wermter S, Weber C, Duch W, et\u00a0al (eds) Artificial Neural Networks and Machine Learning\u2014ICANN 2014\u201424th International Conference on Artificial Neural Networks, Hamburg, Germany, September 15\u201319, 2014. Proceedings, Lecture Notes in Computer Science, vol 8681. Springer, pp 475\u2013482.","DOI":"10.1007\/978-3-319-11179-7_60"},{"issue":"2","key":"6406_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s11704-019-8208-z","volume":"14","author":"X Dong","year":"2020","unstructured":"Dong, X., Yu, Z., Cao, W., et al. (2020). A survey on ensemble learning. Frontiers of Computer Science, 14(2), 241\u2013258.","journal-title":"Frontiers of Computer Science"},{"issue":"5","key":"6406_CR13","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1016\/j.advwatres.2006.11.014","volume":"30","author":"Q Duan","year":"2007","unstructured":"Duan, Q., Ajami, N. K., Gao, X., et al. (2007). Multi-model ensemble hydrologic prediction using bayesian model averaging. Advances in Water Resources, 30(5), 1371\u20131386.","journal-title":"Advances in Water Resources"},{"key":"6406_CR14","unstructured":"Elisseeff, A. (2000). A study about algorithmic stability and their relation to generalization performances. Tech. rep., Laboratoire ERIC - Universit\u00e9 Lyon 2, 5 Avenue Pierre Mend\u00e8s France, 69676 BRON Cedex."},{"issue":"7","key":"6406_CR15","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TPAMI.2008.30","volume":"30","author":"G Fumera","year":"2008","unstructured":"Fumera, G., Roli, F., & Serrau, A. (2008). A theoretical analysis of bagging as a linear combination of classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(7), 1293\u20131299.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"6406_CR16","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1162\/neco_a_01273","volume":"32","author":"J Gao","year":"2020","unstructured":"Gao, J., Li, P., Chen, Z., et al. (2020). A survey on deep learning for multimodal data fusion. Neural Computation, 32(5), 829\u2013864.","journal-title":"Neural Computation"},{"key":"6406_CR17","doi-asserted-by":"crossref","unstructured":"Georgiou, H.V., Mavroforakis, M.E., & Theodoridis, S. (2006). A game-theoretic approach to weighted majority voting for combining SVM classifiers. In: Kollias, S. D., Stafylopatis, A., Duch, W., et\u00a0al (eds) Artificial Neural Networks\u2014ICANN 2006, 16th International Conference, Athens, Greece, September 10\u201314, 2006. Proceedings, Part I, Lecture Notes in Computer Science, vol 4131. Springer, pp 284\u2013292.","DOI":"10.1007\/11840817_30"},{"key":"6406_CR18","doi-asserted-by":"crossref","unstructured":"Gomes, H.M., Barddal, J.P., Enembreck, F., et\u00a0al. (2017). A survey on ensemble learning for data stream classification. ACM Computing Surveys, 50(2):23:1\u201323:36.","DOI":"10.1145\/3054925"},{"key":"6406_CR19","doi-asserted-by":"crossref","unstructured":"Haque, M.N., Noman, N., Berretta, R., et\u00a0al, (2016). Optimising weights for heterogeneous ensemble of classifiers with differential evolution. In: IEEE Congress on Evolutionary Computation, CEC 2016, Vancouver, BC, Canada, July 24\u201329, 2016. IEEE, pp 233\u2013240.","DOI":"10.1109\/CEC.2016.7743800"},{"issue":"5","key":"6406_CR20","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1016\/j.patcog.2012.10.021","volume":"46","author":"D Hern\u00e1ndez-Lobato","year":"2013","unstructured":"Hern\u00e1ndez-Lobato, D., Mart\u00ednez-Mu\u00f1oz, G., & Su\u00e1rez, A. (2013). How large should ensembles of classifiers be? Pattern Recogniton, 46(5), 1323\u20131336.","journal-title":"Pattern Recogniton"},{"key":"6406_CR21","doi-asserted-by":"crossref","unstructured":"Jain, S., Liu, G., Mueller, J., et\u00a0al. (2020). Maximizing overall diversity for improved uncertainty estimates in deep ensembles. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7\u201312, 2020. AAAI Press, pp. 4264\u20134271.","DOI":"10.1609\/aaai.v34i04.5849"},{"issue":"5","key":"6406_CR22","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S0269888913000155","volume":"29","author":"A Jurek","year":"2014","unstructured":"Jurek, A., Bi, Y., Wu, S., et al. (2014). A survey of commonly used ensemble-based classification techniques. The Knowledge Engineering Review, 29(5), 551\u2013581.","journal-title":"The Knowledge Engineering Review"},{"issue":"2","key":"6406_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10115-012-0586-6","volume":"38","author":"LI Kuncheva","year":"2014","unstructured":"Kuncheva, L. I., & Diez, J. J. R. (2014). A weighted voting framework for classifiers ensembles. Knowledge and Information Systems, 38(2), 259\u2013275.","journal-title":"Knowledge and Information Systems"},{"issue":"2","key":"6406_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1022859003006","volume":"51","author":"LI Kuncheva","year":"2003","unstructured":"Kuncheva, L. I., & Whitaker, C. J. (2003). Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Machine Learning, 51(2), 181\u2013207.","journal-title":"Machine Learning"},{"key":"6406_CR25","doi-asserted-by":"crossref","unstructured":"Latinne, P., Debeir, O., & Decaestecker, C. (2001). Limiting the number of trees in random forests. Lecture Notes in Computer Science. In: Kittler, J. & Roli , F.(Eds.), Multiple Classifier Systems, Second International Workshop, MCS 2001 Cambridge, UK, July 2\u20134, 2001, Proceedings (Vol. 2096, pp. 178\u2013187). Springer.","DOI":"10.1007\/3-540-48219-9_18"},{"key":"6406_CR26","doi-asserted-by":"crossref","unstructured":"Liu, N., Cao, J., Lin, Z., et\u00a0al. (2014). Evolutionary voting-based extreme learning machines. Mathematical Problems in Engineering 2014.","DOI":"10.1155\/2014\/808292"},{"issue":"5","key":"6406_CR27","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1016\/j.patcog.2014.10.017","volume":"48","author":"S Mao","year":"2015","unstructured":"Mao, S., Jiao, L., Xiong, L., et al. (2015). Weighted classifier ensemble based on quadratic form. Pattern Recognition, 48(5), 1688\u20131706.","journal-title":"Pattern Recognition"},{"key":"6406_CR28","unstructured":"Minkowski, (2020). http:\/\/mathworld.wolfram.com\/minkowskisinequalities.html."},{"issue":"108","key":"6406_CR29","first-page":"493","volume":"124","author":"AM Mohammed","year":"2022","unstructured":"Mohammed, A. M., Onieva, E., Wozniak, M., et al. (2022). An analysis of heuristic metrics for classifier ensemble pruning based on ordered aggregation. Pattern Recognition, 124(108), 493.","journal-title":"Pattern Recognition"},{"key":"6406_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ins.2019.03.067","volume":"490","author":"TT Nguyen","year":"2019","unstructured":"Nguyen, T. T., Dang, M. T., Liew, A. W., et al. (2019). A weighted multiple classifier framework based on random projection. Information science, 490, 36\u201358.","journal-title":"Information science"},{"issue":"3","key":"6406_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1080\/095400996116802","volume":"8","author":"DW Opitz","year":"1996","unstructured":"Opitz, D. W., & Shavlik, J. W. (1996). Actively searching for an effective neural network ensemble. Connect Science, 8(3), 337\u2013354.","journal-title":"Connect Science"},{"key":"#cr-split#-6406_CR32.1","doi-asserted-by":"crossref","unstructured":"Oshiro, T.M., Perez, P.S., & Baranauskas, J.A. (2012). How many trees in a random forest? In: Perner, P.","DOI":"10.1007\/978-3-642-31537-4_13"},{"key":"#cr-split#-6406_CR32.2","unstructured":"(ed) Machine Learning and Data Mining in Pattern Recognition-8th International Conference, MLDM 2012, Berlin, Germany, July 13-20, 2012. Proceedings, Lecture Notes in Computer Science, vol 7376. Springer, pp 154-168."},{"issue":"1","key":"6406_CR33","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.inffus.2007.07.002","volume":"9","author":"NC Oza","year":"2008","unstructured":"Oza, N. C., & Tumer, K. (2008). Classifier ensembles: Select real-world applications. Information Fusion, 9(1), 4\u201320.","journal-title":"Information Fusion"},{"key":"6406_CR34","unstructured":"Probst, P., & Boulesteix, A. (2017). To tune or not to tune the number of trees in random forest. Journal of Machine Learning Research 18:181:1\u2013181:18"},{"key":"6406_CR35","doi-asserted-by":"crossref","unstructured":"Sagi, O., & Rokach, L. (2018). Ensemble learning: A survey. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 8(4).","DOI":"10.1002\/widm.1249"},{"issue":"3","key":"6406_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297\u2013336.","journal-title":"Machine Learning"},{"key":"6406_CR37","unstructured":"Seewald, A.K. (2002). How to make stacking better and faster while also taking care of an unknown weakness. In: Sammut, C., Hoffmann, A. G. (eds) Machine Learning, Proceedings of the Nineteenth International Conference (ICML 2002), University of New South Wales, Sydney, Australia, July 8\u201312, 2002. Morgan Kaufmann, pp 554\u2013561."},{"issue":"3","key":"6406_CR38","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.patrec.2012.10.008","volume":"34","author":"MU Sen","year":"2013","unstructured":"Sen, M. U., & Erdogan, H. (2013). Linear classifier combination and selection using group sparse regularization and hinge loss. Pattern Recognition Letters, 34(3), 265\u2013274.","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"6406_CR39","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10994-006-9449-2","volume":"65","author":"EK Tang","year":"2006","unstructured":"Tang, E. K., Suganthan, P. N., & Yao, X. (2006). An analysis of diversity measures. Machine Learning, 65(1), 247\u2013271.","journal-title":"Machine Learning"},{"key":"6406_CR40","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1613\/jair.594","volume":"10","author":"KM Ting","year":"1999","unstructured":"Ting, K. M., & Witten, I. H. (1999). Issues in stacked generalization. Journal of Artificial Intelligence Research, 10, 271\u2013289.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6406_CR41","doi-asserted-by":"crossref","unstructured":"Valdovinos, R.M., & S\u00e1nchez, J.S. (2009). Combining multiple classifiers with dynamic weighted voting. In: Corchado, E., Wu, X., Oja, E., et\u00a0al (eds) Hybrid Artificial Intelligence Systems, 4th International Conference, HAIS 2009, Salamanca, Spain, June 10\u201312, 2009. Proceedings, Lecture Notes in Computer Science, vol 5572. Springer, pp 510\u2013516.","DOI":"10.1007\/978-3-642-02319-4_61"},{"key":"6406_CR42","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.inffus.2015.07.003","volume":"28","author":"I Visentini","year":"2016","unstructured":"Visentini, I., Snidaro, L., & Foresti, G. L. (2016). Diversity-aware classifier ensemble selection via f-score. Information Fusion, 28, 24\u201343.","journal-title":"Information Fusion"},{"key":"6406_CR43","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2013.09.005","volume":"27","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Hao, J., Glover, F. W., et al. (2014). A tabu search based memetic algorithm for the maximum diversity problem. Engineering Applications of Artificial Intelligence, 27, 103\u2013114.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"6406_CR44","doi-asserted-by":"crossref","unstructured":"Wozniak, M. (2008). Classifier fusion based on weighted voting\u2014analytical and experimental results. In: Pan, J., Abraham, A., Chang, C. (eds) Eighth International Conference on Intelligent Systems Design and Applications, ISDA 2008, 26\u201328 November 2008, Kaohsiung, Taiwan, 3 Volumes. IEEE Computer Society, pp 687\u2013692.","DOI":"10.1109\/ISDA.2008.216"},{"key":"6406_CR45","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.is.2015.01.001","volume":"50","author":"S Wu","year":"2015","unstructured":"Wu, S., & Crestani, F. (2015). A geometric framework for data fusion in information retrieval. Information Systems, 50, 20\u201335.","journal-title":"Information Systems"},{"issue":"18","key":"6406_CR46","doi-asserted-by":"publisher","first-page":"3402","DOI":"10.1016\/j.ins.2010.05.021","volume":"180","author":"J Xiao","year":"2010","unstructured":"Xiao, J., He, C., Jiang, X., et al. (2010). A dynamic classifier ensemble selection approach for noise data. Information Science, 180(18), 3402\u20133421.","journal-title":"Information Science"},{"issue":"6","key":"6406_CR47","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/TNNLS.2013.2246578","volume":"24","author":"J Yang","year":"2013","unstructured":"Yang, J., Zeng, X., Zhong, S., et al. (2013). Effective neural network ensemble approach for improving generalization performance. IEEE Transactions on Neural Networks and Learning Systems, 24(6), 878\u2013887.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"6406_CR48","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.inffus.2016.06.003","volume":"34","author":"H Ykhlef","year":"2017","unstructured":"Ykhlef, H., & Bouchaffra, D. (2017). An efficient ensemble pruning approach based on simple coalitional games. Information Fusion, 34, 28\u201342.","journal-title":"Information Fusion"},{"issue":"1","key":"6406_CR49","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.patcog.2010.07.021","volume":"44","author":"L Zhang","year":"2011","unstructured":"Zhang, L., & Zhou, W. (2011). Sparse ensembles using weighted combination methods based on linear programming. Pattern Recognition, 44(1), 97\u2013106.","journal-title":"Pattern Recognition"},{"key":"6406_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, W., Jiang, J., Shao, Y., et\u00a0al. (2020). Efficient diversity-driven ensemble for deep neural networks. In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20\u201324, 2020. IEEE, pp 73\u201384.","DOI":"10.1109\/ICDE48307.2020.00014"},{"issue":"1\u20132","key":"6406_CR51","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","volume":"137","author":"Z Zhou","year":"2002","unstructured":"Zhou, Z., Wu, J., & Tang, W. (2002). Ensembling neural networks: Many could be better than all. Artificial Intelligence, 137(1\u20132), 239\u2013263.","journal-title":"Artificial Intelligence"},{"key":"6406_CR52","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cie.2018.12.021","volume":"128","author":"X Zhu","year":"2019","unstructured":"Zhu, X., Ni, Z., Ni, L., et al. (2019). Improved discrete artificial fish swarm algorithm combined with margin distance minimization for ensemble pruning. Computers and Industrial Engineering, 128, 32\u201346.","journal-title":"Computers and Industrial Engineering"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06406-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06406-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06406-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T18:07:42Z","timestamp":1700071662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06406-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,27]]},"references-count":54,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["6406"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06406-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,27]]},"assertion":[{"value":"9 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The study is original and has not been submitted to any other journal\/conference.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All three authors agree with the content and submission of the manuscript to this journal.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All three authors agree with the submission of the manuscript to this journal and possible publication afterwards.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}