{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:30:07Z","timestamp":1759177807952,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["400845550"],"award-info":[{"award-number":["400845550"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["438445824"],"award-info":[{"award-number":["438445824"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005722","name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005722","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Rule learning methods have a long history of active research in the machine learning community. They are not only a common choice in applications that demand human-interpretable classification models but have also been shown to achieve state-of-the-art performance when used in ensemble methods. Unfortunately, only little information can be found in the literature about the various implementation details that are crucial for the efficient induction of rule-based models. This work provides a detailed discussion of algorithmic concepts and approximations that enable applying rule learning techniques to large amounts of data. To demonstrate the advantages and limitations of these individual concepts in a series of experiments, we rely on BOOMER\u2014a flexible and publicly available implementation for the efficient induction of gradient boosted single- or multi-label classification rules.<\/jats:p>","DOI":"10.1007\/s11634-023-00553-7","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T12:02:23Z","timestamp":1690459343000},"page":"851-892","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the efficient implementation of classification rule learning"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8570-8240","authenticated-orcid":false,"given":"Michael","family":"Rapp","sequence":"first","affiliation":[]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"key":"553_CR1","unstructured":"Alsabti K, Ranka S, Singh V (1998) CLOUDS: a decision tree classifier for large datasets. In: Proceeding international conference on knowledge discovery and data mining, p 2\u20138"},{"key":"553_CR2","doi-asserted-by":"crossref","unstructured":"Anderson E, Bai Z, Bischof C, et\u00a0al (1999) LAPACK Users\u2019 guide. SIAM","DOI":"10.1137\/1.9780898719604"},{"issue":"1","key":"553_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1214\/20-EJS1792","volume":"15","author":"C B\u00e9nard","year":"2021","unstructured":"B\u00e9nard C, Biau G, Da Veiga S et al (2021) SIRUS: Stable and interpretable RUle set for classification. Electronic J Stat 15(1):427\u2013505","journal-title":"Electronic J Stat"},{"issue":"2","key":"553_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/567806.567807","volume":"28","author":"LS Blackford","year":"2002","unstructured":"Blackford LS, Petitet A, Pozo R et al (2002) An updated set of basic linear algebra subprograms (BLAS). ACM Transact Math Softw 28(2):135\u2013151","journal-title":"ACM Transact Math Softw"},{"key":"553_CR5","doi-asserted-by":"crossref","unstructured":"Boley M, Teshuva S, Bodic PL, et\u00a0al (2021) Better short than greedy: interpretable models through optimal rule boosting. In: Proc. SIAM international conference on data mining, pp 351\u2013359","DOI":"10.1137\/1.9781611976700.40"},{"key":"553_CR6","unstructured":"Bostr\u00f6m H (1995) Covering vs. divide-and-conquer for top-down induction of logic programs. In: Proc. international joint conference on artificial intelligence (IJCAI), pp 1194\u20131200"},{"issue":"1","key":"553_CR7","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":"553_CR8","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) XGBoost: a scalable tree boosting system. In: Proc. ACM SIGKDD international conference on knowledge discovery and data mining, pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"553_CR9","doi-asserted-by":"crossref","unstructured":"Cohen WW (1995) Fast effective rule induction. In: Proc. International conference on machine learning (ICML), pp 115\u2013123","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"553_CR10","unstructured":"Cohen WW, Singer Y (1999) A simple, fast, and effective rule learner. In: Proc. AAAI conference on artificial intelligence, pp 335\u2013342"},{"key":"553_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11634-020-00404-9","volume":"15","author":"D Conde","year":"2021","unstructured":"Conde D, Fern\u00e1ndez MA, Rueda C et al (2021) Isotonic boosting classification rules. Adv Data Anal Classif 15:289\u2013313","journal-title":"Adv Data Anal Classif"},{"issue":"1","key":"553_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10618-010-0177-7","volume":"21","author":"K Dembczy\u0144ski","year":"2010","unstructured":"Dembczy\u0144ski K, Kot\u0142owski W, S\u0142owi\u0144ski R (2010) ENDER: a statistical framework for boosting decision rules. Data Min Knowl Disc 21(1):52\u201390","journal-title":"Data Min Knowl Disc"},{"issue":"1\u20132","key":"553_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10994-012-5285-8","volume":"88","author":"K Dembczy\u0144ski","year":"2012","unstructured":"Dembczy\u0144ski K, Waegeman W, Cheng W et al (2012) On label dependence and loss minimization in multi-label classification. Mach Learn 88(1\u20132):5\u201345","journal-title":"Mach Learn"},{"issue":"1","key":"553_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/3359786","volume":"63","author":"M Du","year":"2019","unstructured":"Du M, Liu N, Hu X (2019) Techniques for interpretable machine learning. Commun ACM 63(1):68\u201377","journal-title":"Commun ACM"},{"issue":"3","key":"553_CR15","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"JH Friedman","year":"2008","unstructured":"Friedman JH, Popescu BE (2008) Predictive learning via rule ensembles. Annals Appl Stat 2(3):916\u2013954","journal-title":"Annals Appl Stat"},{"issue":"4","key":"553_CR16","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/s11634-021-00455-6","volume":"16","author":"S Friedrich","year":"2022","unstructured":"Friedrich S, Antes G, Behr S et al (2022) Is there a role for statistics in artificial intelligence? Adv Data Anal Classif 16(4):823\u2013846","journal-title":"Adv Data Anal Classif"},{"issue":"1","key":"553_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1006524209794","volume":"13","author":"J F\u00fcrnkranz","year":"1999","unstructured":"F\u00fcrnkranz J (1999) Separate-and-conquer rule learning. Artif Intell Rev 13(1):3\u201354","journal-title":"Artif Intell Rev"},{"key":"553_CR18","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz J (2005) From local to global patterns: evaluation issues in rule learning algorithms. In: Local pattern detection. Springer, p 20\u201338","DOI":"10.1007\/11504245_2"},{"key":"553_CR19","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz J, Gamberger D, Lavra\u010d N (2012) Foundations of rule learning. Springer Science & Business Media","DOI":"10.1007\/978-3-540-75197-7"},{"key":"553_CR20","doi-asserted-by":"crossref","unstructured":"Gamberger D, Lavra\u010d N (2000) Confirmation rule sets. In: Proc. European conference on principles of data mining and knowledge discovery (PKDD), pp 34\u201343","DOI":"10.1007\/3-540-45372-5_4"},{"issue":"6","key":"553_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/widm.1139","volume":"4","author":"E Gibaja","year":"2014","unstructured":"Gibaja E, Ventura S (2014) Multi-label learning: a review of the state of the art and ongoing research. Wiley Interdiscip Rev Data Mining Knowl Discov 4(6):411\u2013444","journal-title":"Wiley Interdiscip Rev Data Mining Knowl Discov"},{"issue":"1","key":"553_CR22","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G et al (2009) The WEKA data mining software: an update. SIGKDD Explor 11(1):10\u201318","journal-title":"SIGKDD Explor"},{"key":"553_CR23","doi-asserted-by":"crossref","unstructured":"H\u00fcllermeier E, F\u00fcrnkranz J, Loza\u00a0Menc\u00eda E, et\u00a0al (2020) Rule-based multi-label classification: challenges and opportunities. In: International joint conference on rules and reasoning, pp 3\u201319","DOI":"10.1007\/978-3-030-57977-7_1"},{"key":"553_CR24","doi-asserted-by":"crossref","unstructured":"Jin R, Agrawal G (2003) Communication and memory efficient parallel decision tree construction. In: Proc. SIAM international conference on data mining, pp 119\u2013129","DOI":"10.1137\/1.9781611972733.11"},{"key":"553_CR25","doi-asserted-by":"crossref","unstructured":"Kamath C, Cant\u00fa-Paz E, Littau D (2002) Approximate splitting for ensembles of trees using histograms. In: Proc. SIAM international conference on data mining, pp 370\u2013383","DOI":"10.1137\/1.9781611972726.22"},{"key":"553_CR26","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke G, Meng Q, Finley T et al (2017) LightGBM: a highly efficient gradient boosting decision tree. Adv Neural Inf Process Syst 30:3146\u20133154","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"553_CR27","first-page":"47","volume":"32","author":"SB Kotsiantis","year":"2006","unstructured":"Kotsiantis SB, Kanellopoulos D (2006) Discretization techniques: a recent survey. GESTS Int Transact Comput Sci Eng 32(1):47\u201358","journal-title":"GESTS Int Transact Comput Sci Eng"},{"key":"553_CR28","doi-asserted-by":"crossref","unstructured":"Lakkaraju H, Bach SH, Leskovec J (2016) Interpretable decision sets: a joint framework for description and prediction. In: Proc. ACM SIGKDD international conference on knowledge discovery and data mining, pp 1675\u20131684","DOI":"10.1145\/2939672.2939874"},{"key":"553_CR29","unstructured":"Langley P (1996) Elements of machine learning. Morgan Kaufmann"},{"key":"553_CR30","unstructured":"Li P, Wu Q, Burges C (2007) McRank: Learning to rank using multiple classification and gradient boosting. Adv Neural Inform Process Syst 20"},{"key":"553_CR31","doi-asserted-by":"crossref","unstructured":"Loza\u00a0Menc\u00eda E, F\u00fcrnkranz J, H\u00fcllermeier E, et\u00a0al (2018) Learning interpretable rules for multi-label classification. In: Explainable and interpretable models in computer vision and machine learning. Springer, p 81\u2013113","DOI":"10.1007\/978-3-319-98131-4_4"},{"key":"553_CR32","doi-asserted-by":"crossref","unstructured":"Mehta M, Agrawal R, Rissanen J (1996) SLIQ: a fast scalable classifier for data mining. In: Proc. International conference on extending database technology, pp 18\u201332","DOI":"10.1007\/BFb0014141"},{"key":"553_CR33","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.127","volume":"3","author":"R Mitchell","year":"2017","unstructured":"Mitchell R, Frank E (2017) Accelerating the XGBoost algorithm using GPU computing. PeerJ Comput Sci 3:e127","journal-title":"PeerJ Comput Sci"},{"key":"553_CR34","unstructured":"Mitchell TM (1997) Machine learning. McGraw Hill"},{"key":"553_CR35","doi-asserted-by":"crossref","unstructured":"Molnar C, Casalicchio G, Bischl B (2020) Interpretable machine learning \u2013 a brief history, state-of-the-art and challenges. In: Proc. European conference on machine learning and knowledge discovery in databases (ECML-PKDD), pp 417\u2013431","DOI":"10.1007\/978-3-030-65965-3_28"},{"issue":"44","key":"553_CR36","doi-asserted-by":"publisher","first-page":"22,071","DOI":"10.1073\/pnas.1900654116","volume":"116","author":"WJ Murdoch","year":"2019","unstructured":"Murdoch WJ, Singh C, Kumbier K et al (2019) Definitions, methods, and applications in interpretable machine learning. Proc Natl Acad Sci 116(44):22,071-22,080","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"553_CR37","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1022611825350","volume":"5","author":"G Pagallo","year":"1990","unstructured":"Pagallo G, Haussler D (1990) Boolean feature discovery in empirical learning. Mach Learn 5(1):71\u201399","journal-title":"Mach Learn"},{"issue":"100","key":"553_CR38","first-page":"137","volume":"10","author":"M Rapp","year":"2021","unstructured":"Rapp M (2021) BOOMER-an algorithm for learning gradient boosted multi-label classification rules. Softw Impacts 10(100):137","journal-title":"Softw Impacts"},{"key":"553_CR39","doi-asserted-by":"crossref","unstructured":"Rapp M, Loza\u00a0Menc\u00eda E, F\u00fcrnkranz J, et\u00a0al (2020) Learning gradient boosted multi-label classification rules. In: Proc. european conference on machine learning and knowledge discovery in databases (ECML-PKDD), pp 124\u2013140","DOI":"10.1007\/978-3-030-67664-3_8"},{"key":"553_CR40","doi-asserted-by":"crossref","unstructured":"Rapp M, Loza\u00a0Menc\u00eda E, F\u00fcrnkranz J, et\u00a0al (2021) Gradient-based label binning in multi-label classification. In: Proc. european conference on machine learning and knowledge discovery in databases (ECML-PKDD), pp 462\u2013477","DOI":"10.1007\/978-3-030-86523-8_28"},{"key":"553_CR41","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2016) \u201cwhy should i trust you?\u201d explaining the predictions of any classifier. In: Proc. ACM SIGKDD international conference on knowledge discovery and data mining, pp 1135\u20131144","DOI":"10.1145\/2939672.2939778"},{"issue":"3","key":"553_CR42","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00058680","volume":"2","author":"RL Rivest","year":"1987","unstructured":"Rivest RL (1987) Learning decision lists. Mach Learn 2(3):229\u2013246","journal-title":"Mach Learn"},{"key":"553_CR43","unstructured":"Shafer JC, Agrawal R, Mehta M (1996) SPRINT: a scalable parallel classifier for data mining. In: Proc. international conference on very large data bases, pp 544\u2013555"},{"key":"553_CR44","unstructured":"Shi H (2007) Best-first decision tree learning. PhD thesis, University of Waikato"},{"issue":"61","key":"553_CR45","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.21105\/joss.03192","volume":"6","author":"C Singh","year":"2021","unstructured":"Singh C, Nasseri K, Tan YS et al (2021) imodels: a python package for fitting interpretable models. J Open Source Softw 6(61):3192","journal-title":"J Open Source Softw"},{"issue":"4","key":"553_CR46","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s11634-020-00419-2","volume":"14","author":"S Voj\u00ed\u0159","year":"2020","unstructured":"Voj\u00ed\u0159 S, Kliegr T (2020) Editable machine learning models? A rule-based framework for user studies of explainability. Adv Data Anal Classif 14(4):785\u2013799","journal-title":"Adv Data Anal Classif"},{"key":"553_CR47","unstructured":"Weiss SM, Indurkhya N (2000) Lightweight rule induction. In: Proc. international conference on machine learning (ICML), pp 1135\u20131142"},{"issue":"1","key":"553_CR48","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10844-010-0121-8","volume":"36","author":"L Wohlrab","year":"2011","unstructured":"Wohlrab L, F\u00fcrnkranz J (2011) A review and comparison of strategies for handling missing values in separate-and-conquer rule learning. J Intell Inform Syst 36(1):73\u201398","journal-title":"J Intell Inform Syst"},{"key":"553_CR49","doi-asserted-by":"crossref","unstructured":"Zilke JR, Loza\u00a0Menc\u00eda E, Janssen F (2016) DeepRED \u2013 rule extraction from deep neural networks. In: Proc. international conference on discovery science, pp 457\u2013473","DOI":"10.1007\/978-3-319-46307-0_29"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-023-00553-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-023-00553-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-023-00553-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T08:14:35Z","timestamp":1732176875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-023-00553-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,27]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s11634-023-00553-7","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"type":"print","value":"1862-5347"},{"type":"electronic","value":"1862-5355"}],"subject":[],"published":{"date-parts":[[2023,7,27]]},"assertion":[{"value":"2 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}