{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:09Z","timestamp":1740122769245,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11063-021-10664-x","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T18:02:36Z","timestamp":1636135356000},"page":"891-907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classification Algorithm Using Branches Importance"],"prefix":"10.1007","volume":"54","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":"Mohamed","family":"Chahhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed El","family":"Mohajir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"key":"10664_CR1","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24:123\u2013140","journal-title":"Mach Learn"},{"key":"10664_CR2","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:5\u201332","journal-title":"Mach Learn"},{"key":"10664_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"Pierre Geurts","year":"2006","unstructured":"Geurts Pierre, Ernst Damien, Wehenkel Louis (2006) Extremely randomized trees. Mach Learn 63:3\u201342","journal-title":"Mach Learn"},{"issue":"2","key":"10664_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"WH David","year":"1992","unstructured":"David WH (1992) Stacked generalization. Neural Netw 5(2):241\u2013259","journal-title":"Neural Netw"},{"key":"10664_CR5","doi-asserted-by":"crossref","unstructured":"COHEN, William W (1995) Fast effective rule induction. In : Machine learning proceedings. Morgan Kaufmann, 1995: 115-123","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"10664_CR6","first-page":"335","volume":"99","author":"CW William","year":"1999","unstructured":"William CW, Yoram S (1999) A simple fast and effective rule learner. AAAI\/IAAI 99:335\u2013342","journal-title":"AAAI\/IAAI"},{"issue":"3","key":"10664_CR7","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"JH Friedman","year":"2008","unstructured":"Friedman JH, Popescu BE et al (2008) Predictive learning via rule ensembles. Ann Appl Statist 2(3):916\u2013954","journal-title":"Ann Appl Statist"},{"issue":"1","key":"10664_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10618-010-0177-7","volume":"21","author":"K Dembczynski","year":"2010","unstructured":"Dembczynski K, Kotlowski W, Slowinski R (2010) ENDER: a statistical framework for boosting decision rules. Data Mining Know Discov 21(1):52\u201390","journal-title":"Data Mining Know Discov"},{"key":"10664_CR9","unstructured":"Freund Y, Schapire RE et\u00a0al. (1996) Experiments with a new boosting algorithm,Thirteenth International Conference on ML, 148-156"},{"key":"10664_CR10","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, 302-307","DOI":"10.1109\/IJCNN.2009.5178693"},{"key":"10664_CR11","doi-asserted-by":"crossref","unstructured":"Tripoliti EE, Fotiadis DI, et 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, 1-4","DOI":"10.1109\/ITAB.2010.5687796"},{"key":"10664_CR12","unstructured":"Sirikulviriya N et Sinthupinyo S (2011) Integration of rules from a random forest. In : International Conference on Information and Electronics Engineering,194-198"},{"key":"10664_CR13","doi-asserted-by":"crossref","unstructured":"MASHAYEKHI, Morteza et GRAS, Robin. Rule extraction from random forest: the RF+ HC methods. In : Canadian Conference on Artificial Intelligence. Springer, Cham, 223-237(2015)","DOI":"10.1007\/978-3-319-18356-5_20"},{"key":"10664_CR14","doi-asserted-by":"crossref","unstructured":"Van assche A, et Blockeel H (2007) Seeing the forest through the trees: Learning a comprehensible model from an ensemble. In : European Conference on Machine Learning. Springer, Berlin, Heidelberg, 418-429","DOI":"10.1007\/978-3-540-74958-5_39"},{"key":"10664_CR15","doi-asserted-by":"crossref","unstructured":"Johansson Ulf, Sonstr DC, et Lofstrom T (2011) One tree to explain them all. In : 2011 IEEE Congress of Evolutionary Computation (CEC). IEEE, 1444-1451","DOI":"10.1109\/CEC.2011.5949785"},{"key":"10664_CR16","doi-asserted-by":"crossref","unstructured":"Meinshausen N (2010) Node harvest. The Annals of Applied Statistics, 2049-2072","DOI":"10.1214\/10-AOAS367"},{"issue":"4","key":"10664_CR17","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":"10664_CR18","unstructured":"Benard C, Biau G, Daveiga S et\u00a0al. (2020) Interpretable Random Forests via Rule Extraction. arXiv preprint arXiv:2004.14841"},{"key":"10664_CR19","unstructured":"Mita G, Papotti P, Filippone M et\u00a0al. (2020) LIBRE: Learning Interpretable Boolean Rule Ensembles. In : International Conference on Artificial Intelligence and Statistics. 245-255"},{"key":"10664_CR20","doi-asserted-by":"crossref","unstructured":"Pancho DP, Alonso JM, Cordon NO et\u00a0al. (2013) FINGRAMS: visual representations of fuzzy rule-based inference for expert analysis of comprehensibility. IEEE Transactions on Fuzzy Systems, vol. 21, no 6, p. 1133-1149","DOI":"10.1109\/TFUZZ.2013.2245130"},{"key":"10664_CR21","doi-asserted-by":"crossref","unstructured":"Pierrard R, Poli JP, et Hudelot C (2018) Learning fuzzy relations and properties for explainable artificial intelligence. In : 2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE. p. 1-8","DOI":"10.1109\/FUZZ-IEEE.2018.8491538"},{"key":"10664_CR22","unstructured":"Rizzo L, et Longo L (2018) A qualitative investigation of the degree of explainability of defeasible argumentation and non-monotonic fuzzy reasoning. In : 26th AIAI Irish Conference on Artificial Intelligence and Cognitive Science. p. 138-149"},{"issue":"1","key":"10664_CR23","first-page":"2357","volume":"18","author":"T Wang","year":"2017","unstructured":"Wang T, Rudin C, Doshi-velez F (2017) A bayesian framework for learning rule sets for interpretable classification. J Mach Learn Res 18(1):2357\u20132393","journal-title":"J Mach Learn Res"},{"issue":"3","key":"10664_CR24","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1214\/15-AOAS848","volume":"9","author":"B Letham","year":"2015","unstructured":"Letham B, Rudin C, Mccormick TH et al (2015) Interpretable classifiers using rules and bayesian analysis: Building a better stroke prediction model. Ann Appl Statist 9(3):1350\u20131371","journal-title":"Ann Appl Statist"},{"key":"10664_CR25","doi-asserted-by":"crossref","unstructured":"Lakkaraju H, Bach SH, et Leskovec J (2016) Interpretable decision sets: A joint framework for description and prediction. In : Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. p. 1675-1684","DOI":"10.1145\/2939672.2939874"},{"issue":"3","key":"10664_CR26","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1016\/j.eswa.2010.08.023","volume":"38","author":"W Verbeke","year":"2011","unstructured":"Verbeke W, Martens D, Mues C et al (2011) Building comprehensible customer churn prediction models with advanced rule induction techniques. Expert Syst Appl 38(3):2354\u20132364","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10664_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1162\/EVCO_a_00155","volume":"24","author":"F Otero","year":"2016","unstructured":"Otero F, EbetFreitas AA (2016) Improving the interpretability of classification rules discovered by an ant colony algorithm: extended results. Evol Comput 24(3):385\u2013409","journal-title":"Evol Comput"},{"key":"10664_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-54024-5_5","volume-title":"Learning interpretable classification rules with boolean compressed sensing Transparent Data Mining for Big and Small Data","author":"DM Malioutov","year":"2017","unstructured":"Malioutov DM, Varshney KR, Emad A et al (2017) Learning interpretable classification rules with boolean compressed sensing Transparent Data Mining for Big and Small Data. Springer, Cham, pp 95\u2013121"},{"key":"10664_CR29","doi-asserted-by":"crossref","unstructured":"Su G, Wei D, Varshney KR et\u00a0al. (2015) Interpretable two-level boolean rule learning for classification. arXiv preprint arXiv:1511.07361","DOI":"10.1109\/MLSP.2016.7738856"},{"key":"10664_CR30","doi-asserted-by":"crossref","unstructured":"HATWELL, Julian, GABER, Mohamed Medhat, et AZAD, R. CHIRPS: Explaining random forest classification. Artificial Intelligence Review, (2020)","DOI":"10.1007\/s10462-020-09833-6"},{"key":"10664_CR31","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.ins.2019.10.050","volume":"512","author":"CA Proen","year":"2020","unstructured":"Proen CA, Hugo M, Van Leeuwen M (2020) Interpretable multiclass classification by MDL-based rule lists. Inform Sci 512:1372\u20131393","journal-title":"Inform Sci"},{"issue":"1","key":"10664_CR32","first-page":"8753","volume":"18","author":"E Angelino","year":"2017","unstructured":"Angelino E, Larus-stone N, Alabi D et al (2017) Learning certifiably optimal rule lists for categorical data. J Mach Learn Res 18(1):8753\u20138830","journal-title":"J Mach Learn Res"},{"issue":"3","key":"10664_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang CC, Lin CJ (2011) LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol (TIST) 2(3):1\u201327","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"issue":"1","key":"10664_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11063-006-9007-8","volume":"24","author":"H Nunez","year":"2006","unstructured":"Nunez H, Angulo C, Catala A (2006) Rule-based learning systems for support vector machines. Neural Process Lett 24(1):1\u201318","journal-title":"Neural Process Lett"},{"issue":"2","key":"10664_CR35","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11063-011-9207-8","volume":"35","author":"MG Augasta","year":"2012","unstructured":"Augasta MG, Kathirvalavakumar T (2012) Reverse engineering the neural networks for rule extraction in classification problems. Neural Process Lett 35(2):131\u2013150","journal-title":"Neural Process Lett"},{"key":"10664_CR36","unstructured":"Hara, S., & Hayashi, K. (2018, March). Making tree ensembles interpretable: A bayesian model selection approach. In International conference on artificial intelligence and statistics (pp. 77-85). PMLR"},{"key":"10664_CR37","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.eswa.2019.02.012","volume":"126","author":"J Obregon","year":"2019","unstructured":"Obregon J, Kim A, Jung JY (2019) RuleCOSI: combination and simplification of production rules from boosted decision trees for imbalanced classification. Expert Syst Appl 126:64\u201382","journal-title":"Expert Syst Appl"},{"issue":"1","key":"10664_CR38","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TVCG.2018.2864475","volume":"25","author":"X Zhao","year":"2018","unstructured":"Zhao X, Wu Y, Lee DL, Cui W (2018) iForest: interpreting random forests via visual analytics. IEEE Trans Visual Comput Gr 25(1):407\u2013416","journal-title":"IEEE Trans Visual Comput Gr"},{"key":"10664_CR39","doi-asserted-by":"crossref","unstructured":"Vandewiele G, Lannoye K, Janssens O, Ongenae F, De Turck F, & Van Hoecke S (2017). A genetic algorithm for interpretable model extraction from decision tree ensembles. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (pp. 104-115). Springer, Cham","DOI":"10.1007\/978-3-319-67274-8_10"},{"key":"10664_CR40","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.inffus.2020.07.001","volume":"63","author":"RR Fern\u00e1ndez","year":"2020","unstructured":"Fern\u00e1ndez RR, de Diego IM, Ace\u00f1a V, Fern\u00e1ndez-Isabel A, Moguerza JM (2020) Random forest explainability using counterfactual sets. Inform Fusion 63:196\u2013207","journal-title":"Inform Fusion"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-021-10664-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-021-10664-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-021-10664-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T17:08:54Z","timestamp":1649524134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-021-10664-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,5]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10664"],"URL":"https:\/\/doi.org\/10.1007\/s11063-021-10664-x","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2021,11,5]]},"assertion":[{"value":"11 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}