{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:08:36Z","timestamp":1777547316169,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:00:00Z","timestamp":1653609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:00:00Z","timestamp":1653609600000},"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":["Evolving Systems"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12530-022-09441-5","type":"journal-article","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T06:02:46Z","timestamp":1653631366000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reducing the number of trees in a forest using noisy features"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5912-3094","authenticated-orcid":false,"given":"Youness","family":"Manzali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassine","family":"Akhiat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Chahhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Elmohajir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Zinedine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"9441_CR2","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":"9441_CR1","doi-asserted-by":"crossref","unstructured":"Adnan MN, Islam MZ et\u00a0al (2017a) Forex++: a new framework for knowledge discovery from decision forests. Australas J Inf Syst 21","DOI":"10.3127\/ajis.v21i0.1539"},{"key":"9441_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.eswa.2017.08.002","volume":"89","author":"MN Adnan","year":"2017","unstructured":"Adnan MN, Islam MZ (2017b) Forest pa: constructing a decision forest by penalizing attributes used in previous trees. Expert Syst Appl 89:389\u2013403","journal-title":"Expert Syst Appl"},{"key":"9441_CR6","doi-asserted-by":"crossref","unstructured":"Akhiat Y, Chahhou M, Zinedine A (2018) Feature selection based on graph representation. In: 2018 IEEE 5th international congress on Information science and technology (CiSt). IEEE, pp\u00a0232\u2013237","DOI":"10.1109\/CIST.2018.8596467"},{"issue":"1","key":"9441_CR4","first-page":"24","volume":"11","author":"Y Akhiat","year":"2019","unstructured":"Akhiat Y, Chahhou M, Zinedine A (2019) Ensemble feature selection algorithm. Int J Intell Syst Appl 11(1):24","journal-title":"Int J Intell Syst Appl"},{"key":"9441_CR5","doi-asserted-by":"crossref","unstructured":"Akhiat Y, Asnaoui Y, Chahhou M, Zinedine A (2021a) A new graph feature selection approach. In: 2020 6th IEEE congress on information science and technology (CiSt). IEEE, pp\u00a0156\u2013161","DOI":"10.1109\/CiSt49399.2021.9357067"},{"key":"9441_CR7","doi-asserted-by":"crossref","unstructured":"Akhiat Y, Manzali Y, Chahhou M, Zinedine A (2021b) A new noisy random forest based method for feature selection. Cybern Inf Technol 21(2)","DOI":"10.2478\/cait-2021-0016"},{"issue":"3","key":"9441_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00058611","volume":"24","author":"KM Ali","year":"1996","unstructured":"Ali KM, Pazzani MJ (1996) Error reduction through learning multiple descriptions. Mach Learn 24(3):173\u2013202","journal-title":"Mach Learn"},{"key":"9441_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02384-3","volume-title":"Empirical approach to machine learning","author":"PP Angelov","year":"2019","unstructured":"Angelov PP, Gu X (2019) Empirical approach to machine learning. Springer, Berlin"},{"issue":"10","key":"9441_CR10","doi-asserted-by":"publisher","first-page":"2981","DOI":"10.1109\/TCYB.2017.2753880","volume":"48","author":"PP Angelov","year":"2017","unstructured":"Angelov PP, Gu X, Pr\u00edncipe JC (2017) A generalized methodology for data analysis. IEEE Trans Cybern 48(10):2981\u20132993","journal-title":"IEEE Trans Cybern"},{"key":"9441_CR12","doi-asserted-by":"crossref","unstructured":"Bernard S, Heutte L, Adam S (2008) Forest-rk: a new random forest induction method. In: International conference on intelligent computing. Springer, pp\u00a0430\u2013437","DOI":"10.1007\/978-3-540-85984-0_52"},{"key":"9441_CR13","doi-asserted-by":"crossref","unstructured":"Bernard S, Heutte L, Adam S (2009) On the selection of decision trees in random forests. In: 2009 international joint conference on neural networks. IEEE, pp\u00a0302\u2013307","DOI":"10.1109\/IJCNN.2009.5178693"},{"issue":"12","key":"9441_CR11","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1016\/j.patrec.2012.04.003","volume":"33","author":"S Bernard","year":"2012","unstructured":"Bernard S, Adam S, Heutte L (2012) Dynamic random forests. Pattern Recogn Lett 33(12):1580\u20131586","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"9441_CR14","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":"9441_CR15","volume-title":"Classification and regression trees","author":"L Brieman","year":"1984","unstructured":"Brieman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees, vol 67. Wadsworth Inc, Routledge"},{"issue":"3","key":"9441_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297","journal-title":"Mach Learn"},{"key":"9441_CR17","doi-asserted-by":"crossref","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 14(2):251\u2013268","DOI":"10.1108\/IJICC-10-2020-0147"},{"issue":"4","key":"9441_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s41060-018-0144-8","volume":"7","author":"H Deng","year":"2019","unstructured":"Deng H (2019) Interpreting tree ensembles with in trees. Int J Data Sci Anal 7(4):277\u2013287","journal-title":"Int J Data Sci Anal"},{"issue":"4","key":"9441_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"JH Friedman","year":"2002","unstructured":"Friedman JH (2002) Stochastic gradient boosting. Comput Stat Data Anal 38(4):367\u2013378","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"9441_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Mach Learn 63(1):3\u201342","journal-title":"Mach Learn"},{"key":"9441_CR21","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":"9441_CR22","volume-title":"Pattern classification","author":"PE Hart","year":"2000","unstructured":"Hart PE, Stork DG, Duda RO (2000) Pattern classification. Wiley, Hoboken"},{"issue":"2","key":"9441_CR23","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TSMCB.2011.2168604","volume":"42","author":"G-B Huang","year":"2011","unstructured":"Huang G-B, Zhou H, Ding X, Zhang R (2011) Extreme learning machine for regression and multiclass classification. IEEE Trans Syst Man Cybern Part B (Cybern) 42(2):513\u2013529","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"9441_CR24","doi-asserted-by":"crossref","unstructured":"Jiang X, Wu C-A, Guo H (2017) Forest pruning based on branch importance. Comput Intell Neurosci \u00a02017","DOI":"10.1155\/2017\/3162571"},{"key":"9441_CR25","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TSMC.1985.6313426","volume":"4","author":"JM Keller","year":"1985","unstructured":"Keller JM, Gray MR, Givens JA (1985) A fuzzy k-nearest neighbor algorithm. IEEE Trans Syst Man Cybern 4:580\u2013585","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9441_CR28","doi-asserted-by":"crossref","unstructured":"Khan Z, Gul A, Mahmoud O, Miftahuddin M, Perperoglou A, Adler W, Lausen B (2016) An ensemble of optimal trees for class membership probability estimation. In: Analysis of large and complex data. Springer, pp\u00a0395\u2013409","DOI":"10.1007\/978-3-319-25226-1_34"},{"issue":"1","key":"9441_CR26","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":"9441_CR27","doi-asserted-by":"publisher","first-page":"28591","DOI":"10.1109\/ACCESS.2021.3055992","volume":"9","author":"Z Khan","year":"2021","unstructured":"Khan Z, Gul N, Faiz N, Gul A, Adler W, Lausen B (2021) Optimal trees selection for classification via out-of-bag assessment and sub-bagging. IEEE Access 9:28591\u201328607","journal-title":"IEEE Access"},{"key":"9441_CR29","unstructured":"Kulkarni V, Sinha P, Singh A (2012) Heuristic based improvements for effective random forest classifier. In: Proceedings of international conference on computational intelligence. Springer, Chennai"},{"key":"9441_CR30","doi-asserted-by":"crossref","unstructured":"Latinne P, Debeir O, Decaestecker C (2001) Limiting the number of trees in random forests. In: International workshop on multiple classifier systems. Springer, pp 178\u2013187","DOI":"10.1007\/3-540-48219-9_18"},{"key":"9441_CR31","unstructured":"Lichman M et\u00a0al (2013) Uci machine learning repository"},{"key":"9441_CR32","doi-asserted-by":"crossref","unstructured":"Lu Z, Wu X, Zhu X, Bongard J (2010) Ensemble pruning via individual contribution ordering. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp\u00a0871\u2013880","DOI":"10.1145\/1835804.1835914"},{"key":"9441_CR33","unstructured":"Maclin R, Opitz D (2011) Popular ensemble methods: an empirical study. J Artif Intell Res. arXiv:1106.0257"},{"key":"9441_CR34","unstructured":"Margineantu DD, Dietterich TG (1997) Pruning adaptive boosting. In: ICML, vol\u00a097. Citeseer, pp.\u00a0211\u2013218"},{"key":"9441_CR35","unstructured":"Mart\u0131nez-Munoz G, Su\u00e1rez A (2004) Aggregation ordering in bagging. In: Proc. of the IASTED international conference on artificial intelligence and applications. Citeseer, pp\u00a0258\u2013263"},{"key":"9441_CR36","unstructured":"Nan F, Wang J, Saligrama V (2016) Pruning random forests for prediction on a budget. In: Advances in neural information processing systems, pp\u00a02334\u20132342"},{"key":"9441_CR37","unstructured":"Oh D-Y (2012) GA-Boost: a genetic algorithm for robust boosting. The University of Alabama"},{"key":"9441_CR38","unstructured":"Ord\u00f3\u00f1ez FJ, Ledezma A, Sanchis A (2008) Genetic approach for optimizing ensembles of classifiers. In: FLAIRS conference, pp\u00a089\u201394"},{"key":"9441_CR39","doi-asserted-by":"crossref","unstructured":"Oshiro TM, Perez PS, Baranauskas JA (2012) How many trees in a random forest? In: International workshop on machine learning and data mining in pattern recognition. Springer, pp\u00a0154\u2013168","DOI":"10.1007\/978-3-642-31537-4_13"},{"key":"9441_CR40","doi-asserted-by":"publisher","first-page":"124","DOI":"10.2751\/jcac.18.124","volume":"18","author":"C Rakers","year":"2017","unstructured":"Rakers C, Reker D, Brown JB (2017) Small random forest models for effective chemogenomic active learning. J Comput Aided Chem 18:124\u2013142","journal-title":"J Comput Aided Chem"},{"key":"9441_CR41","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fdez I, Canosa A, Mucientes M, Bugar\u00edn A (2015) STAC: a web platform for the comparison of algorithms using statistical tests. In: Proceedings of the 2015 IEEE international conference on Fuzzy systems (FUZZ-IEEE)","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"},{"issue":"1","key":"9441_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.inffus.2004.04.008","volume":"6","author":"D Ruta","year":"2005","unstructured":"Ruta D, Gabrys B (2005) Classifier selection for majority voting. Inf Fusion 6(1):63\u201381","journal-title":"Inf Fusion"},{"key":"9441_CR43","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)"},{"key":"9441_CR44","doi-asserted-by":"crossref","unstructured":"Tripoliti EE, Fotiadis DI, Manis G (2010) Dynamic construction of random forests: evaluation using biomedical engineering problems. In: Proceedings of the 10th IEEE international conference on information technology and applications in biomedicine. IEEE, pp\u00a01\u20134","DOI":"10.1109\/ITAB.2010.5687796"},{"key":"9441_CR45","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.asoc.2019.01.015","volume":"77","author":"Y Wang","year":"2019","unstructured":"Wang Y, Wang D, Geng N, Wang Y, Yin Y, Jin Y (2019) Stacking-based ensemble learning of decision trees for interpretable prostate cancer detection. Appl Soft Comput 77:188\u2013204","journal-title":"Appl Soft Comput"},{"key":"9441_CR46","doi-asserted-by":"crossref","unstructured":"Xu X, Chen W (2017) Implementation and performance optimization of dynamic random forest. In: 2017 International conference on cyber-enabled distributed computing and knowledge discovery (CyberC). IEEE, pp\u00a0283\u2013289","DOI":"10.1109\/CyberC.2017.53"},{"key":"9441_CR47","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.neucom.2012.04.007","volume":"94","author":"F Yang","year":"2012","unstructured":"Yang F, Lu W-H, Luo L-K, Li T (2012) Margin optimization based pruning for random forest. Neurocomputing 94:54\u201363","journal-title":"Neurocomputing"},{"key":"9441_CR48","doi-asserted-by":"crossref","unstructured":"Yassine A, Mohamed C, Zinedine A (2017) Feature selection based on pairwise evalution. In: 2017 intelligent systems and computer vision (ISCV). IEEE, pp\u00a01\u20136","DOI":"10.1109\/ISACV.2017.8054919"},{"key":"9441_CR49","first-page":"022022","volume":"1168","author":"X Ying","year":"2019","unstructured":"Ying X (2019) An overview of overfitting and its solutions. J Phys: Conf Ser 1168:022022","journal-title":"J Phys: Conf Ser"},{"issue":"3","key":"9441_CR50","doi-asserted-by":"publisher","first-page":"381","DOI":"10.4310\/SII.2009.v2.n3.a11","volume":"2","author":"H Zhang","year":"2009","unstructured":"Zhang H, Wang M (2009) Search for the smallest random forest. Stat Interface 2(3):381","journal-title":"Stat Interface"},{"key":"9441_CR51","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.eswa.2017.04.003","volume":"82","author":"C Zhang","year":"2017","unstructured":"Zhang C, Liu C, Zhang X, Almpanidis G (2017) An up-to-date comparison of state-of-the-art classification algorithms. Expert Syst Appl 82:128\u2013150","journal-title":"Expert Syst Appl"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-022-09441-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12530-022-09441-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-022-09441-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T23:04:06Z","timestamp":1679699046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12530-022-09441-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,27]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["9441"],"URL":"https:\/\/doi.org\/10.1007\/s12530-022-09441-5","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"value":"1868-6478","type":"print"},{"value":"1868-6486","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,27]]},"assertion":[{"value":"9 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}