{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T18:48:08Z","timestamp":1784054888838,"version":"3.55.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T00:00:00Z","timestamp":1674432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T00:00:00Z","timestamp":1674432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Johannes Kepler University Linz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the examples they cover. Instead, we propose an efficient algorithm that aims at finding the best rule covering each training example in a greedy optimization consisting of one specialization and one generalization loop. These locally optimal rules are collected and then filtered for a final rule set, which is much larger than the sets learned by conventional rule learning algorithms. A new example is classified by selecting the best among the rules that cover this example. In our experiments on small to very large datasets, the approach\u2019s average classification accuracy is higher than that of state-of-the-art rule learning algorithms. Moreover, the algorithm is highly efficient and can inherently be processed in parallel without affecting the learned rule set and so the classification accuracy. We thus believe that it closes an important gap for large-scale classification rule induction.<\/jats:p>","DOI":"10.1007\/s10994-022-06290-w","type":"journal-article","created":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T19:18:38Z","timestamp":1674501518000},"page":"571-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient learning of large sets of locally optimal classification rules"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7972-206X","authenticated-orcid":false,"given":"Van Quoc Phuong","family":"Huynh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Beck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,23]]},"reference":[{"key":"6290_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T. & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207\u2013216).","DOI":"10.1145\/170036.170072"},{"issue":"1","key":"6290_CR2","first-page":"35","volume":"5","author":"M Atzm\u00fcller","year":"2015","unstructured":"Atzm\u00fcller, M. (2015). Subgroup discovery. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 5(1), 35\u201349.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"6290_CR3","doi-asserted-by":"crossref","unstructured":"Atzm\u00fcller, M., & Puppe, F. (2006). SD-Map\u2014A Fast Algorithm for Exhaustive Subgroup Discovery. In J. F\u00fcrnkranz, T. Scheffer, & M. Spiliopoulou (Eds.), Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) (pp. 6\u201317). Springer.","DOI":"10.1007\/11871637_6"},{"issue":"3","key":"6290_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329.","journal-title":"Operations Research"},{"key":"6290_CR5","doi-asserted-by":"crossref","unstructured":"Boley, M., Teshuva, S., Bodic, P. L., & Webb G. I. (2021). Better short than Greedy: Interpretable models through optimal rule boosting. In C. Demeniconi & I. Davidson (Eds.), Proceedings of the 2021 SIAM International Conference on Data Mining (SDM) (pp. 351\u2013359). SIAM.","DOI":"10.1137\/1.9781611976700.40"},{"key":"6290_CR6","unstructured":"Cestnik, B. (1990). Estimating probabilities: A crucial task in machine learning. In L. Aiello (Ed.), Proceedings of the 9th European Conference on Artificial Intelligence (ECAI90) (pp. 147\u2013150). Pitman."},{"key":"6290_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., & Philip, S. Y. (2008). Direct discriminative pattern mining for effective classification. In: Proceedings of 24th IEEE International Conference on Data Engineering (ICDE) (pp. 169\u2013178). IEEE.","DOI":"10.1109\/ICDE.2008.4497425"},{"key":"6290_CR8","doi-asserted-by":"crossref","unstructured":"Clark, P., & Boswell, R. (1991). Rule induction with CN2: Some recent improvements. In Proceedings of the 5th European Working Session on Learning (EWSL-91) (pp. 151\u2013163). Springer-Verlag.","DOI":"10.1007\/BFb0017011"},{"issue":"4","key":"6290_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00116835","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark, P., & Niblett, T. (1989). The CN2 induction algorithm. Machine Learning, 3(4), 261\u2013283.","journal-title":"Machine Learning"},{"key":"6290_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, W. W. (1995). Fast effective rule induction. In A. Prieditis, & S. Russell (Eds.), Proceedings of the 12th International Conference on Machine Learning (ML-95) (pp. 115\u2013123).Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"6290_CR11","unstructured":"Cohen, W. W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI99) (pp. 335\u2013342). AAAI\/MIT Press."},{"key":"6290_CR12","first-page":"4660","volume-title":"Advances in Neural Information Processing Systems 31 (NeurIPS)","author":"S Dash","year":"2018","unstructured":"Dash, S., G\u00fcnl\u00fck, O., & Wei, D. (2018). Boolean Decision Rules via Column Generation. In S. Bengio, H. M. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds.), Advances in Neural Information Processing Systems 31 (NeurIPS) (pp. 4660\u20134670). Canada: Montr\u00e9al."},{"issue":"1","key":"6290_CR13","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 Lowski, W., & lowi\u0144ski, R. S. (2010). ENDER: a statistical framework for boosting decision rules. Data Mining and Knowledge Discovery, 21(1), 52\u201390.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6290_CR14","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1\u201330.","journal-title":"Journal of Machine Learning Research"},{"issue":"13","key":"6290_CR15","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z-H Deng","year":"2015","unstructured":"Deng, Z.-H., & Lv, S.-L. (2015). PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via children\u2013parent equivalence pruning. Expert Systems with Applications, 42(13), 5424\u20135432.","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"6290_CR16","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z-H Deng","year":"2012","unstructured":"Deng, Z.-H., Wang, Z. H., & Jiang, J. J. (2012). A new algorithm for fast mining frequent itemsets using N-lists. Science China Information Sciences, 55(9), 2008\u20132030.","journal-title":"Science China Information Sciences"},{"key":"6290_CR17","unstructured":"Dua, D., & Graff, C. (2017). UCI machine learning repository."},{"key":"6290_CR18","first-page":"37","volume":"1","author":"S D\u017eeroski","year":"1993","unstructured":"D\u017eeroski, S., Cestnik, B., & Petrovski, I. (1993). Using the m-estimate in Rule Induction. Journal of Computing and Information Technology, 1, 37\u201346.","journal-title":"Journal of Computing and Information Technology"},{"key":"6290_CR19","unstructured":"Fayyad, U., & Irani, K. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 1022\u20131029)."},{"key":"6290_CR20","doi-asserted-by":"crossref","unstructured":"Fensel, D., & Wiese, M. (1993). Refinement of rule sets with JoJo. In P. Brazdil (Ed.), Proceedings of the 6th European Conference on Machine Learning (ECML-93). Springer (pp. 378\u2013383).","DOI":"10.1007\/3-540-56602-3_154"},{"key":"6290_CR21","unstructured":"Filip, J., & Kliegr, T. (2019). PyIDS - Python Implementation of Interpretable Decision Sets Algorithm by Lakkaraju, et al. (2016). In A. Soylu, S. Moschoyiannis, G. Governatori, M. Simkus, P. Stefaneas, A. Steen, & A. Giurca (Eds.), Proceedings of the 13th RuleML+RR 2019 Doctoral Consortium and Rule Challenge. CEUR Workshop Proceedings 2438. Bolzano."},{"issue":"1","key":"6290_CR22","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. Artificial Intelligence Review, 13(1), 3\u201354.","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"6290_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10994-005-5011-x","volume":"58","author":"J F\u00fcrnkranz","year":"2005","unstructured":"F\u00fcrnkranz, J., & Flach, P. A. (2005). ROC \u2018n\u2018 rule learning - towards a better understanding of covering algorithms. Machine Learning, 58(1), 39\u201377.","journal-title":"Machine Learning"},{"key":"6290_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75197-7","volume-title":"Foundations of rule learning","author":"J F\u00fcrnkranz","year":"2012","unstructured":"F\u00fcrnkranz, J., Gamberger, D., & Lavra\u010d, N. (2012). Foundations of rule learning. Springer."},{"key":"6290_CR25","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz, J., & Widmer, G. (1994). Incremental reduced error pruning. In W. W. Cohen, & H. Hirsh (Eds.),Proceedings of the 11th International Conference on Machine Learning (ML-94) (pp. 70\u201377). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-335-6.50017-9"},{"issue":"4","key":"6290_CR26","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TKDE.2012.35","volume":"25","author":"S Garc\u00eda","year":"2013","unstructured":"Garc\u00eda, S., Luengo, J., S\u00e1ez, J. A., L\u00f3pez, V., & Herrera, F. (2013). A survey of discretization techniques: Taxonomy and empirical analysis in supervised learning. IEEE Transactions on Knowledge and Data Engineering, 25(4), 734\u2013750.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6290_CR27","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Pedreschi, D., Turini, F., & Giannotti, F. (2018). Local rule-based explanations of black box decision systems. arXiv 1805.10820."},{"issue":"1","key":"6290_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), 53\u201387.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"6290_CR29","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"Jochen Hipp","year":"2000","unstructured":"Hipp, Jochen, G\u00fcntzer, Ulrich, & Nakhaeizadeh, Gholamreza. (2000). Algorithms for association rule mining\u2014A general survey and comparison. ACM SIGKDD Explorations Newsletter, 2(1), 58\u201364.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"6290_CR30","unstructured":"Holte, R., Acker, L., & Porter, B. (1989). Concept learning and the problem of small disjuncts. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89) (pp. 813\u2013818). Morgan Kaufmann."},{"key":"6290_CR31","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.chemolab.2016.07.004","volume":"157","author":"R Huerta","year":"2016","unstructured":"Huerta, R., Mosqueiro, T., Fonollosa, J., Rulkov, N. F., & Rodriguez-Lujan, I. (2016). Online decorrelation of humidity and temperature in chemical sensors for continuous monitoring. Chemometrics and Intelligent Laboratory Systems, 157, 169\u2013176.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"6290_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112874","volume":"140","author":"VQP Huynh","year":"2020","unstructured":"Huynh, V. Q. P., & K\u00fcng, J. (2020). FPO tree and DP3 algorithm for distributed parallel Frequent Itemsets Mining. Expert Systems with Applications, 140, 112874.","journal-title":"Expert Systems with Applications"},{"key":"6290_CR33","doi-asserted-by":"crossref","unstructured":"Janssen, F., & F\u00fcrnkranz, J. (2009). A re-evaluation of the over-searching phenomenon in inductive rule learning. In H. Park, S. Parthasarathy, H. Liu, & Z. Obradovic (Eds.), Proceedings of the SIAM International Conference on Data Mining (SDM-09) (pp. 329\u2013340). Sparks, Nevada.","DOI":"10.1137\/1.9781611972795.29"},{"issue":"3","key":"6290_CR34","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10994-009-5162-2","volume":"78","author":"F Janssen","year":"2010","unstructured":"Janssen, F., & F\u00fcrnkranz, J. (2010). On the quest for optimal rule learning heuristics. Machine Learning, 78(3), 343\u2013379.","journal-title":"Machine Learning"},{"key":"6290_CR35","doi-asserted-by":"crossref","unstructured":"Kl\u00f6sgen, W. (1996). Explora: A multipattern and multistrategy discovery assistant. In Advances in knowledge discovery and data mining (pp. 249\u2013271).","DOI":"10.1007\/3-540-61286-6_186"},{"key":"6290_CR36","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S. H., & Leskovec, J. (2016). Interpretable decision sets: A joint framework for description and prediction. In B. Krishnapuram, M. Shah, A. J. Smola, C. C. Aggarwal, D. Shen, & R. Rastogi (Eds.), Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-16) (pp. 1675\u20131684). ACM.","DOI":"10.1145\/2939672.2939874"},{"issue":"3","key":"6290_CR37","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, T. H., & Madigan, D. (2015). Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model. The Annals of Applied Statistics, 9(3), 1350\u20131371.","journal-title":"The Annals of Applied Statistics"},{"key":"6290_CR38","unstructured":"Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of the IEEE Conference on Data Mining (ICDM-01) (pp. 369\u2013376)."},{"key":"6290_CR39","unstructured":"Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. In R. Agrawal, P. Stolorz, & G. Piatetsky-Shapiro (Eds.), Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98) (pp. 80\u201386)."},{"key":"6290_CR40","unstructured":"Liu, B., Ma, Y., & Wong, C.-K. (2000). Improving an exhaustive search based rule learner. In D. A. Zighed, H. J. Komorowski, & J. M. Zytkow (Eds.),Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD-2000), Lyon, France (pp. 504\u2013509)."},{"key":"6290_CR41","unstructured":"Lundberg, S. M., Erion, G. G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S. (2019). Explainable AI for trees: From local explanations to global understanding. arXiv 1905.04610."},{"key":"6290_CR42","first-page":"4765","volume-title":"Advances in neural information processing systems 30","author":"SM Lundberg","year":"2017","unstructured":"Lundberg, S. M., & Lee, S. (2017). A unified approach to interpreting model predictions. In I. Guyon, U. von Luxburg, S. Bengio, H. M. Wallach, R. Fergus, S. V. N. Vishwanathan, & R. Garnett (Eds.), Advances in neural information processing systems 30 (pp. 4765\u20134774). Long Beach."},{"key":"6290_CR43","unstructured":"Michalski, R. S. (1969). On the quasi-minimal solution of the covering problem. In Proceedings of the 5th International Symposium on Information Processing (FCIP-69) (Vol. A3, pp. 125\u2013128) (Switching Circuits)."},{"key":"6290_CR44","unstructured":"Michalski, R. S. (1973). AQVAL\/1\u2014Computer implementation of a variable-valued logic system VL1 and examples of its application to pattern recognition. In Proceedings of the 1st International Joint Conference on Pattern Recognition (pp. 3\u201317)."},{"issue":"2","key":"6290_CR45","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0004-3702(83)90016-4","volume":"20","author":"RS Michalski","year":"1983","unstructured":"Michalski, R. S. (1983). A theory and methodology of inductive learning. Artificial Intelligence, 20(2), 111\u2013162.","journal-title":"Artificial Intelligence"},{"key":"6290_CR46","doi-asserted-by":"crossref","unstructured":"Muggleton, S. H. (1995). Inverse entailment and progol. In New Generation Computing 13.3,4. Special Issue on Inductive Logic Programming, (pp. 245\u2013286).","DOI":"10.1007\/BF03037227"},{"key":"6290_CR47","volume-title":"Advances in kernel methods - support vector learning","author":"J Platt","year":"1998","unstructured":"Platt, J. (1998). Fast training of support vector machines using sequential minimal optimization. In B. Schoelkopf, C. Burges, & A. Smola (Eds.), Advances in kernel methods - support vector learning. MIT Press."},{"key":"6290_CR48","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00117105","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"key":"6290_CR49","unstructured":"Quinlan, J. R., & Cameron-Jones, R. M. (1995). Oversearching and layered search in empirical learning. In C. Mellish (Ed.), Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) (pp. 1019\u20131024). Morgan Kaufmann."},{"key":"6290_CR50","doi-asserted-by":"crossref","unstructured":"Rapp, M., Loza Menc\u00eda, E., F\u00fcrnkranz, J., Nguyen, V.-L., & H\u00fcllermeier, E. (2020). Learning gradient boosted multi-label classification rules. In F. Hutter, K. Kersting, J. Lijffijt, & I. Valera (Eds.), Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECML\/PKDD), Part III (pp. 124\u2013140). Springer-Verlag.","DOI":"10.1007\/978-3-030-67664-3_8"},{"key":"6290_CR51","doi-asserted-by":"crossref","unstructured":"Reiss, A., & Stricker, D. (2012). Introducing a new benchmarked dataset for activity monitoring. In Proceedings of the 16th IEEE International Symposium on Wearable Computers (pp. 108\u2013109). IEEE.","DOI":"10.1109\/ISWC.2012.13"},{"key":"6290_CR52","doi-asserted-by":"crossref","unstructured":"Ribeiro, M. T., S. Singh, and C. Guestrin (2016). \u2018Why Should I Trust You?\u2019: Explaining the Predictions of Any Classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Ed. by B. Krishnapuram, M. Shah, A. J. Smola, C. C. Aggarwal, D. Shen, and R. Rastogi. San Francisco, CA, USA: ACM, pp. 1135\u20131144.","DOI":"10.1145\/2939672.2939778"},{"key":"6290_CR53","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","volume":"1","author":"C Rudin","year":"2019","unstructured":"Rudin, C. (2019). Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence, 1, 206\u2013215.","journal-title":"Nature Machine Intelligence"},{"key":"6290_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103457","volume":"294","author":"M Setzu","year":"2021","unstructured":"Setzu, M., Guidotti, R., Monreale, A., Turini, F., Pedreschi, D., & Giannotti, F. (2021). GLocalX - From local to global explanations of black box AI models. Artificial Intelligence, 294, 103457.","journal-title":"Artificial Intelligence"},{"key":"6290_CR55","doi-asserted-by":"crossref","unstructured":"Su, G., Wei, D., Varshney, K. R., & Malioutov, D. M. (2016). Learning sparse twolevel boolean rules. In Proceedings of the 26th IEEE International Workshop on Machine Learning for Signal Processing (MLSP) (pp. 1\u20136). IEEE.","DOI":"10.1109\/MLSP.2016.7738856"},{"key":"6290_CR56","unstructured":"Wang, F., & Rudin, C. (2015). Falling rule lists. In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics (AISTATS) (pp. 1013\u20131022). PMLR."},{"issue":"11","key":"6290_CR57","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/TKDE.2006.179","volume":"18","author":"J Wang","year":"2006","unstructured":"Wang, J., & Karypis, G. (2006). On mining instance-centric classification rules. IEEE Transactions on Knowledge and Data Engineering, 18(11), 1497\u20131511.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"6290_CR58","first-page":"2357","volume":"18","author":"T Wang","year":"2017","unstructured":"Wang, T., Rudin, C., Doshi-Velez, F., Liu, Y., Klampfl, E., & MacNeille, P. (2017). A Bayesian framework for learning rule sets for interpretable classification. The Journal of Machine Learning Research, 18(1), 2357\u20132393.","journal-title":"The Journal of Machine Learning Research"},{"key":"6290_CR59","unstructured":"Weiss, S. M., & Indurkhya, N. (2000). Lightweight rule induction. In P. Langley (Ed.), Proceedings of the 17th International Conference on Machine Learning (ICML), Stanford, CA (pp. 1135\u20131142)."},{"issue":"1","key":"6290_CR60","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. Journal of Intelligent Information Systems, 36(1), 73\u201398.","journal-title":"Journal of Intelligent Information Systems"},{"key":"6290_CR61","unstructured":"Yang, H., Rudin, C., & Seltzer, M. (2017). Scalable Bayesian rule lists. In Proceedings of the International Conference on Machine Learning (ICML) (pp. 3921\u20133930). PMLR."},{"key":"6290_CR62","doi-asserted-by":"crossref","unstructured":"Yin, X., & Han, J. (2003). CPAR: Classification based on predictive association rules. In Proceedings of the SIAM Conference on Data Mining (SDM-03) (pp. 331\u2013335).","DOI":"10.1137\/1.9781611972733.40"},{"issue":"3","key":"6290_CR63","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0218488598000264","volume":"6","author":"DA Zighed","year":"1998","unstructured":"Zighed, D. A., Rabas\u00e9da, S., & Rakotomalala, R. (1998). FUSINTER: A method for discretization of continuous attributes. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 6(3), 307\u2013326.","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06290-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06290-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06290-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T07:07:39Z","timestamp":1692860859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06290-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,23]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["6290"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06290-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,23]]},"assertion":[{"value":"14 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All auhtor declares no conflict of Interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}