{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:22:16Z","timestamp":1717028536777},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10115-024-02069-8","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T03:02:11Z","timestamp":1709002931000},"page":"3261-3281","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing the number of branches in a decision forest using association rule metrics"],"prefix":"10.1007","volume":"66","author":[{"given":"Youness","family":"Manzali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Elfar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"issue":"2","key":"2069_CR1","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":"2","key":"2069_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"TG Dietterich","year":"2000","unstructured":"Dietterich TG (2000) An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach Learn 40(2):139\u2013157","journal-title":"Mach Learn"},{"issue":"1","key":"2069_CR3","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":"2069_CR4","unstructured":"Freund Y, Schapire RE et al (1996) Experiments with a new boosting algorithm. In: ICML, vol 96, pp 148\u2013156. Citeseer"},{"key":"2069_CR5","doi-asserted-by":"crossref","unstructured":"Dietterich TG (2000) Ensemble methods in machine learning. In: International workshop on multiple classifier systems. Springer, pp 1\u201315","DOI":"10.1007\/3-540-45014-9_1"},{"issue":"7553","key":"2069_CR6","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521(7553):436\u2013444","journal-title":"Nature"},{"issue":"1","key":"2069_CR7","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":"2069_CR8","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"2069_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1108\/IJICC-10-2020-0147","volume":"14","author":"MEH Daho","year":"2021","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:251\u2013268","journal-title":"Int J Intell Comput Cybern"},{"issue":"2","key":"2069_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s12530-022-09441-5","volume":"14","author":"Y Manzali","year":"2023","unstructured":"Manzali Y, Akhiat Y, Chahhou M, Elmohajir M, Zinedine A (2023) Reducing the number of trees in a forest using noisy features. Evol Syst 14(2):157\u2013174","journal-title":"Evol Syst"},{"key":"2069_CR11","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":"2069_CR12","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/7560872","author":"R Hu","year":"2019","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. https:\/\/doi.org\/10.1155\/2019\/7560872","journal-title":"Comput Intell Neurosci"},{"key":"2069_CR13","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"},{"key":"2069_CR14","doi-asserted-by":"publisher","first-page":"158297","DOI":"10.1109\/ACCESS.2021.3130905","volume":"9","author":"L Wan","year":"2021","unstructured":"Wan L, Gong K, Zhang G, Li C, Wang Z, Deng X (2021) Ensemble pruning of RF via multi-objective TLBO algorithm and its parallelization on spark. IEEE Access 9:158297\u2013158312","journal-title":"IEEE Access"},{"issue":"1","key":"2069_CR15","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":"2069_CR16","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":"2069_CR17","doi-asserted-by":"crossref","unstructured":"Thi KPL, Thi NCV, Phung NH (2015) Extracting rule RF in educational data classification: from a random forest to interpretable refined rules. In: 2015 international conference on advanced computing and applications (ACOMP). IEEE, pp 20\u201327","DOI":"10.1109\/ACOMP.2015.13"},{"key":"2069_CR18","doi-asserted-by":"crossref","unstructured":"Mashayekhi M, Gras R (2015) Rule extraction from random forest: the RF+ HC methods. In: Canadian conference on artificial intelligence. Springer, pp 223\u2013237","DOI":"10.1007\/978-3-319-18356-5_20"},{"key":"2069_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ins.2021.05.063","volume":"573","author":"L-A Dong","year":"2021","unstructured":"Dong L-A, Ye X, Yang G (2021) Two-stage rule extraction method based on tree ensemble model for interpretable loan evaluation. Inf Sci 573:46\u201364","journal-title":"Inf Sci"},{"key":"2069_CR20","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8906034","author":"H Zhang","year":"2019","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. https:\/\/doi.org\/10.1155\/2019\/8906034","journal-title":"Math Probl Eng"},{"key":"2069_CR21","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/3162571","author":"X Jiang","year":"2017","unstructured":"Jiang X, Wu C, Guo H (2017) Forest pruning based on branch importance. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2017\/3162571","journal-title":"Comput Intell Neurosci"},{"issue":"2","key":"2069_CR22","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s11063-021-10664-x","volume":"54","author":"Y Manzali","year":"2022","unstructured":"Manzali Y, Chahhou M, Mohajir ME (2022) Classification algorithm using branches importance. Neural Process Lett 54(2):891\u2013907","journal-title":"Neural Process Lett"},{"issue":"8","key":"2069_CR23","doi-asserted-by":"publisher","first-page":"5747","DOI":"10.1007\/s10462-020-09833-6","volume":"53","author":"J Hatwell","year":"2020","unstructured":"Hatwell J, Gaber MM, Azad R (2020) CHIRPS: explaining random forest classification. Artif Intell Rev 53(8):5747\u20135788","journal-title":"Artif Intell Rev"},{"issue":"1","key":"2069_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12530-022-09434-4","volume":"14","author":"AN Boruah","year":"2023","unstructured":"Boruah AN, Biswas SK, Bandyopadhyay S (2023) Transparent rule generator random forest (TRG-RF): an interpretable random forest. Evol Syst 14(1):69\u201383","journal-title":"Evol Syst"},{"key":"2069_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.inffus.2020.03.013","volume":"61","author":"O Sagi","year":"2020","unstructured":"Sagi O, Rokach L (2020) Explainable decision forest: Transforming a decision forest into an interpretable tree. Inf Fusion 61:124\u2013138","journal-title":"Inf Fusion"},{"key":"2069_CR26","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.ins.2021.05.055","volume":"572","author":"O Sagi","year":"2021","unstructured":"Sagi O, Rokach L (2021) Approximating XGBoost with an interpretable decision tree. Inf Sci 572:522\u2013542","journal-title":"Inf Sci"},{"key":"2069_CR27","doi-asserted-by":"crossref","unstructured":"Manzali Y, Elfar M (2023) Random forest pruning techniques: a recent review. In: Operations research forum, vol 4. Springer, pp 1\u201314","DOI":"10.1007\/s43069-023-00223-6"},{"key":"2069_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.asoc.2019.105941","volume":"86","author":"S Wang","year":"2020","unstructured":"Wang S, Wang Y, Wang D, Yin Y, Wang Y, Jin Y (2020) An improved random forest-based rule extraction method for breast cancer diagnosis. Appl Soft Comput 86:105\u2013941","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2069_CR29","first-page":"05","volume":"5","author":"H Bostrom","year":"2018","unstructured":"Bostrom H, Gurung RB, Lindgren T, Johansson U (2018) Explaining random forest predictions with association rules. Arch Data Sci Ser A (Online First) 5(1):05","journal-title":"Arch Data Sci Ser A (Online First)"},{"issue":"4","key":"2069_CR30","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 inTrees. Int J Data Sci Anal 7(4):277\u2013287","journal-title":"Int J Data Sci Anal"},{"key":"2069_CR31","first-page":"1407","volume":"457","author":"J Shi","year":"2014","unstructured":"Shi J, Zhang SY (2014) Affective product design based on random forest and association rules. Appl Mech Mater 457:1407\u20131410","journal-title":"Appl Mech Mater"},{"key":"2069_CR32","doi-asserted-by":"crossref","unstructured":"Liu L, Wu J, Li X, Huang H (2023) Dynamic ensemble selection with reinforcement learning. In: International conference on intelligent computing. Springer, pp 629\u2013640","DOI":"10.1007\/978-981-99-4761-4_53"},{"key":"2069_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.neucom.2021.11.045","volume":"482","author":"AM Mohammed","year":"2022","unstructured":"Mohammed AM, Onieva E, Wo\u017aniak M (2022) Selective ensemble of classifiers trained on selective samples. Neurocomputing 482:197\u2013211","journal-title":"Neurocomputing"},{"issue":"3","key":"2069_CR34","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1007\/s10618-023-00921-z","volume":"37","author":"S Buschj\u00e4ger","year":"2023","unstructured":"Buschj\u00e4ger S, Morik K (2023) Joint leaf-refinement and ensemble pruning through $$L_ 1$$ regularization. Data Min Knowl Discov 37(3):1230\u20131261","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"2069_CR35","first-page":"54","volume":"10","author":"F Khalifa","year":"2023","unstructured":"Khalifa F, Ali AH, Abdel-Kader H (2023) Improved version of explainable decision forest: forest-based tree. Int J Comput Inf 10(1):54\u201364","journal-title":"Int J Comput Inf"},{"key":"2069_CR36","doi-asserted-by":"publisher","first-page":"108493","DOI":"10.1016\/j.patcog.2021.108493","volume":"124","author":"AM Mohammed","year":"2022","unstructured":"Mohammed AM, Onieva E, Wo\u017aniak M, Martinez-Munoz G (2022) An analysis of heuristic metrics for classifier ensemble pruning based on ordered aggregation. Pattern Recogn 124:108493","journal-title":"Pattern Recogn"},{"issue":"2","key":"2069_CR37","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s13042-022-01644-1","volume":"14","author":"H Ragab Hassen","year":"2023","unstructured":"Ragab Hassen H, Alabdeen YZ, Gaber MM, Sharma M (2023) D2TS: a dual diversity tree selection approach to pruning of random forests. Int J Mach Learn Cybern 14(2):467\u2013481","journal-title":"Int J Mach Learn Cybern"},{"key":"2069_CR38","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-031-12402-0_3","volume-title":"Interpretability for industry 4.0: statistical and machine learning approaches","author":"C B\u00e9nard","year":"2022","unstructured":"B\u00e9nard C, Veiga SD, Scornet E (2022) Interpretability via random forests. In: Lepore A, Palumbo B, Poggi J-M (eds) Interpretability for industry 4.0: statistical and machine learning approaches. Springer, Berlin, pp 37\u201384"},{"key":"2069_CR39","unstructured":"Liu B, Mazumder R (2023) ForestPrune: compact depth-pruned tree ensembles. In: International conference on artificial intelligence and statistics. PMLR, pp 9417\u20139428"},{"key":"2069_CR40","unstructured":"Asuncion A, Newman D (2007) UCI machine learning repository. Irvine, CA, USA"},{"issue":"2","key":"2069_CR41","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)"},{"issue":"3","key":"2069_CR42","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":"2069_CR43","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"},{"issue":"4","key":"2069_CR44","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 Statist Data Anal 38(4):367\u2013378","journal-title":"Comput Statist Data Anal"},{"key":"2069_CR45","volume-title":"Pattern classification","author":"PE Hart","year":"2000","unstructured":"Hart PE, Stork DG, Duda RO (2000) Pattern classification. Wiley, Hoboken"},{"key":"2069_CR46","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"},{"key":"2069_CR47","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":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02069-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T04:12:49Z","timestamp":1716955969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02069-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2069"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02069-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"26 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}