{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T20:59:35Z","timestamp":1775854775269,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T00:00:00Z","timestamp":1684454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T00:00:00Z","timestamp":1684454400000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00223-6","type":"journal-article","created":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T08:01:53Z","timestamp":1684483313000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Random Forest Pruning Techniques: A Recent Review"],"prefix":"10.1007","volume":"4","author":[{"given":"Youness","family":"Manzali","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Elfar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"223_CR1","unstructured":"Nilsson NJ\u00a0(1965) Learning machines"},{"key":"223_CR2","doi-asserted-by":"publisher","first-page":"9715","DOI":"10.1109\/ACCESS.2020.2964849","volume":"8","author":"K Yu","year":"2020","unstructured":"Yu K, Wang L, Yu Y (2020) Ordering-based Kalman filter selective ensemble for classification. IEEE Access 8:9715\u20139727","journal-title":"IEEE Access"},{"issue":"7","key":"223_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/S0031-3203(97)00110-6","volume":"31","author":"M Skurichina","year":"1998","unstructured":"Skurichina M, Duin RP (1998) Bagging for linear classifiers. Pattern Recogn 31(7):909\u2013930","journal-title":"Pattern Recogn"},{"issue":"2","key":"223_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(2):123\u2013140","journal-title":"Mach Learn"},{"issue":"1","key":"223_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1):119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"223_CR6","unstructured":"Freund Y, Schapire RE et al (1996) Experiments with a new boosting algorithm. In: ICML, vol 96. Citeseer, pp 148\u2013156"},{"issue":"8","key":"223_CR7","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell 20(8):832\u2013844","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"223_CR8","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. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"223_CR9","doi-asserted-by":"crossref","unstructured":"Robnik-Sikonja M (2004) Improving random forests. In: European Conference on Machine Learning. Springer, pp 359\u2013370","DOI":"10.1007\/978-3-540-30115-8_34"},{"key":"223_CR10","doi-asserted-by":"crossref","unstructured":"Tsymbal A, Pechenizkiy M, Cunningham P (2006) Dynamic integration with random forests. In: European Conference on Machine Learning. Springer, pp 801\u2013808","DOI":"10.1007\/11871842_82"},{"key":"223_CR11","unstructured":"Breitenbach M, Nielsen R, Grudic GZ (2003) Probabilistic random forests: Predicting data point specific misclassification probabilities. University of Colorado at Boulder, Tech. Rep. CU-CS-954-03"},{"key":"223_CR12","unstructured":"Biau G, Devroye L, Lugosi G (2008) Consistency of random forests and other averaging classifiers. J Mach Learn Res 9(9)"},{"key":"223_CR13","doi-asserted-by":"crossref","unstructured":"Kulkarni VY, Sinha PK (2012) Pruning of random forest classifiers: A survey and future directions. In: 2012 International Conference on Data Science & Engineering (ICDSE). IEEE, pp 64\u201368","DOI":"10.1109\/ICDSE.2012.6282329"},{"key":"223_CR14","doi-asserted-by":"crossref","unstructured":"Shaik AB, Srinivasan S (2019) A brief survey on random forest ensembles in classification model. In: International Conference on Innovative Computing and Communications. Springer, pp 253\u2013260","DOI":"10.1007\/978-981-13-2354-6_27"},{"key":"223_CR15","doi-asserted-by":"crossref","unstructured":"Hu R, Zhou S, Liu Y, Tang Z (2019) Margin-based pareto ensemble pruning: an ensemble pruning algorithm that learns to search optimized ensembles. Comput Intell Neurosci 2019","DOI":"10.1155\/2019\/7560872"},{"key":"223_CR16","doi-asserted-by":"publisher","first-page":"48931","DOI":"10.1109\/ACCESS.2021.3062867","volume":"9","author":"WG Martinez","year":"2021","unstructured":"Martinez WG (2021) Ensemble pruning via quadratic margin maximization. IEEE Access 9:48931\u201348951","journal-title":"IEEE Access"},{"key":"223_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.csda.2014.09.003","volume":"83","author":"D Chung","year":"2015","unstructured":"Chung D, Kim H (2015) Accurate ensemble pruning with Pl-bagging. Comput Stat Data Anal 83:1\u201313","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"223_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11042-018-5718-x","volume":"78","author":"Z-Q Jiang","year":"2019","unstructured":"Jiang Z-Q, Shen X-J, Gou J-P, Wang L, Zha Z-J (2019) Dynamically building diversified classifier pruning ensembles via canonical correlation analysis. Multimed Tools Appl 78(1):271\u2013288","journal-title":"Multimed Tools Appl"},{"key":"223_CR19","doi-asserted-by":"crossref","unstructured":"Zhang H, Song Y, Jiang B, Chen B, Shan G (2019) Two-stage bagging pruning for reducing the ensemble size and improving the classification performance. Math Probl Eng 2019","DOI":"10.1155\/2019\/8906034"},{"issue":"1","key":"223_CR20","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.csda.2007.06.012","volume":"52","author":"C Croux","year":"2007","unstructured":"Croux C, Joossens K, Lemmens A (2007) Trimmed bagging. Comput Stat Data Anal 52(1):362\u2013368","journal-title":"Comput Stat Data Anal"},{"issue":"6","key":"223_CR21","doi-asserted-by":"publisher","first-page":"8299","DOI":"10.3233\/JIFS-189149","volume":"39","author":"Z Ni","year":"2020","unstructured":"Ni Z, Xia P, Zhu X, Ding Y, Ni L (2020) A novel ensemble pruning approach based on information exchange glowworm swarm optimization and complementarity measure. J Intell Fuzzy Syst 39(6):8299\u20138313","journal-title":"J Intell Fuzzy Syst"},{"key":"223_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.neucom.2017.06.052","volume":"275","author":"H Guo","year":"2018","unstructured":"Guo H, Liu H, Li R, Wu C, Guo Y, Xu M (2018) Margin & diversity based ordering ensemble pruning. Neurocomputing 275:237\u2013246","journal-title":"Neurocomputing"},{"key":"223_CR23","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, Jin F, Cheng M, Li J (2019) Improved discrete artificial fish swarm algorithm combined with margin distance minimization for ensemble pruning. Comput Ind Eng 128:32\u201346","journal-title":"Comput Ind Eng"},{"key":"223_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen TT, Luong AV, Dang MT, Liew AW-C, McCall J (2020) Ensemble selection based on classifier prediction confidence. Pattern Recogn 100:107104","DOI":"10.1016\/j.patcog.2019.107104"},{"key":"223_CR25","doi-asserted-by":"crossref","unstructured":"Fawagreh K, Gaber MM, Elyan E (2015) Club-DRF: a clustering approach to extreme pruning of random forests. In: International Conference on Innovative Techniques and Applications of Artificial Intelligence. Springer, pp 59\u201373","DOI":"10.1007\/978-3-319-25032-8_4"},{"key":"223_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.neucom.2014.02.030","volume":"139","author":"H Zhang","year":"2014","unstructured":"Zhang H, Cao L (2014) A spectral clustering based ensemble pruning approach. Neurocomputing 139:289\u2013297","journal-title":"Neurocomputing"},{"key":"223_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.eswa.2018.04.002","volume":"106","author":"JAS Lustosa Filho","year":"2018","unstructured":"Lustosa Filho JAS, Canuto AM, Santiago RHN (2018) Investigating the impact of selection criteria in dynamic ensemble selection methods. Expert Syst Appl 106:141\u2013153","journal-title":"Expert Syst Appl"},{"key":"223_CR28","doi-asserted-by":"crossref","unstructured":"Zouggar ST, Adla A (2019) A diversity-accuracy measure for homogenous ensemble selection. International Journal of Interactive Multimedia & Artificial Intelligence 5(5)","DOI":"10.9781\/ijimai.2018.06.005"},{"key":"223_CR29","doi-asserted-by":"crossref","unstructured":"Bader-El-Den M, Gaber M (2012) GARF: towards self-optimised random forests. In: International Conference on Neural Information Processing. Springer, pp 506\u2013515","DOI":"10.1007\/978-3-642-34481-7_62"},{"key":"223_CR30","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.knosys.2016.07.016","volume":"110","author":"MN Adnan","year":"2016","unstructured":"Adnan MN, Islam MZ (2016) Optimizing the number of trees in a decision forest to discover a subforest with high ensemble accuracy using a genetic algorithm. Knowl-Based Syst 110:86\u201397","journal-title":"Knowl-Based Syst"},{"key":"223_CR31","unstructured":"Daho MEH, Settouti N, Bechar MEA, Boublenza A, Chikh MA (2021) A new correlation-based approach for ensemble selection in random forests. Int J Intell Comput Cybern"},{"key":"223_CR32","unstructured":"Souad TZ, Abdelkader A (2019) Pruning of random forests: a diversity-based heuristic measure to simplify a random forest ensemble. INFOCOMP: J Comput Sci 18(1)"},{"issue":"1","key":"223_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11634-019-00364-9","volume":"14","author":"Z Khan","year":"2020","unstructured":"Khan Z, Gul A, Perperoglou A, Miftahuddin M, Mahmoud O, Adler W, Lausen B (2020) Ensemble of optimal trees, random forest and random projection ensemble classification. Adv Data Anal Classif 14(1):97\u2013116","journal-title":"Adv Data Anal Classif"},{"key":"223_CR34","doi-asserted-by":"crossref","unstructured":"Dheenadayalan K, Srinivasaraghavan G, Muralidhara V (2016) Pruning a random forest by learning a learning algorithm. In: International Conference on Machine Learning and Data Mining in Pattern Recognition. Springer, pp 516\u2013529","DOI":"10.1007\/978-3-319-41920-6_41"},{"key":"223_CR35","unstructured":"Giffon L, Lamothe C, Bouscarrat L, Milanesi P, Cherfaoui F, Ko\u00e7o S (2020) Pruning random forest with orthogonal matching trees"},{"key":"223_CR36","doi-asserted-by":"crossref","unstructured":"Jiang X, Wu C-A, Guo H (2017) Forest pruning based on branch importance. Comput Intell Neurosci 2017","DOI":"10.1155\/2017\/3162571"},{"issue":"4","key":"223_CR37","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3390\/bdcc4040037","volume":"4","author":"K Fawagreh","year":"2020","unstructured":"Fawagreh K, Gaber MM (2020) egap: an evolutionary game theoretic approach to random forest pruning. Big Data Cogn Comput 4(4):37","journal-title":"Big Data Cogn Comput"},{"key":"223_CR38","unstructured":"Ren S, Cao X, Wei Y, Sun J (2015) Global refinement of random forest. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp 723\u2013730"},{"key":"223_CR39","doi-asserted-by":"crossref","unstructured":"Narassiguin A, Elghazel H, Aussem A (2016) Similarity tree pruning: a novel dynamic ensemble selection approach. In: 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW). IEEE, pp 1243\u20131250","DOI":"10.1109\/ICDMW.2016.0179"},{"key":"223_CR40","doi-asserted-by":"crossref","unstructured":"Rodriguez-Fdez I, Canosa A, Mucientes M, Bugarin A (2015) STAC: a web platform for the comparison of algorithms using statistical tests. In: 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, pp 1\u20138","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00223-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00223-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00223-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T12:08:18Z","timestamp":1688386098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00223-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,19]]},"references-count":40,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00223-6","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,19]]},"assertion":[{"value":"27 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"All authors of the manuscript have agreed for authorship, read and approved the manuscript, and given consent for the submission of the manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"43"}}