{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:09:34Z","timestamp":1764266974641,"version":"3.46.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2002393"],"award-info":[{"award-number":["IIS-2002393"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["Minerva FA9550-19-1-039","Minerva FA9550-19-1-039"],"award-info":[{"award-number":["Minerva FA9550-19-1-039","Minerva FA9550-19-1-039"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2010224","CNS-1941892"],"award-info":[{"award-number":["W911NF2010224","CNS-1941892"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2210251"],"award-info":[{"award-number":["W911NF2210251"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10994-023-06463-1","type":"journal-article","created":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T13:02:13Z","timestamp":1701262933000},"page":"1303-1328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Explainable models via compression of tree ensembles"],"prefix":"10.1007","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1706-2921","authenticated-orcid":false,"given":"Siwen","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriraam","family":"Natarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Joshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Tadepalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,29]]},"reference":[{"key":"6463_CR1","volume-title":"The architecture of cognition","author":"J Anderson","year":"1983","unstructured":"Anderson, J. (1983). The architecture of cognition. Cambridge, MA: Harvard University Press."},{"key":"6463_CR2","first-page":"549","volume":"8","author":"M Arias","year":"2007","unstructured":"Arias, M., Khardon, R., & Maloberti, J. (2007). Learning horn expressions with LOGAN-H. Journal of Machine Learning Research, 8, 549\u2013587.","journal-title":"Journal of Machine Learning Research"},{"key":"6463_CR3","unstructured":"Assche, A.V., & Blockeel, H. (2007). Seeing the forest through the trees: Learning a comprehensible model from an ensemble. Ecml."},{"key":"6463_CR4","unstructured":"Bastani, O., Kim, C., & Bastani, H. (2017). Interpreting blackbox models via model extraction. arXiv:1705.08504 ."},{"key":"6463_CR5","doi-asserted-by":"crossref","unstructured":"Blockeel, H., & De Raedt, L. (1998). Top-down induction of first-order logical decision trees. AI.","DOI":"10.1016\/S0004-3702(98)00034-4"},{"key":"6463_CR6","unstructured":"Craven, M., & Shavlik, J. (1995). Extracting tree-structured representations of trained networks. NeurIPS."},{"key":"6463_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01574-8","volume-title":"Statistical relational artificial intelligence logic, probability, and computation","author":"L De Raedt","year":"2016","unstructured":"De Raedt, L., Kersting, K., Natarajan, S., & Poole, D. (2016). Statistical relational artificial intelligence logic, probability, and computation. San Rafael: Morgan & Claypool."},{"key":"6463_CR8","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Idestam-Almquist, P., & Sablon, G. (1997). ?-subsumption for structural matching. Ecml.","DOI":"10.1007\/3-540-62858-4_73"},{"key":"6463_CR9","doi-asserted-by":"crossref","unstructured":"Dhami, D.S., Yan, S., Kunapuli, G., & Natarajan, S. (2021). Non-parametric learning of embeddings for relational data using gaifman locality theorem. Ilp.","DOI":"10.1007\/978-3-030-97454-1_7"},{"key":"6463_CR10","doi-asserted-by":"crossref","unstructured":"Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics.","DOI":"10.1214\/aos\/1013203451"},{"key":"6463_CR11","unstructured":"Hara, S., & Hayashi, K. (2018). Making tree ensembles interpretable: A bayesian model selection approach. Aistats."},{"key":"6463_CR12","unstructured":"Hinton, G., Vinyals, O., & Dean, J. (2015). Distilling the knowledge in a neural network."},{"key":"6463_CR13","unstructured":"Joly, A., Schnitzler, F., Geurts, P., & Wehenkel, L. (2012). L1-based compression of random forest models. Esann."},{"issue":"18","key":"6463_CR14","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.1016\/j.artint.2011.09.001","volume":"175","author":"S Joshi","year":"2011","unstructured":"Joshi, S., Kersting, K., & Khardon, R. (2011). Decision-theoretic planning with generalized first-order decision diagrams. Artificial Intelligence, 175(18), 2198\u20132222.","journal-title":"Artificial Intelligence"},{"key":"6463_CR15","doi-asserted-by":"crossref","unstructured":"Kersting, K., Otterlo, M.V., & De Raedt, L. (2004). Bellman goes relational. Proceedings of the twenty-first international conference on machine learning, pp. 59).","DOI":"10.1145\/1015330.1015401"},{"key":"6463_CR16","doi-asserted-by":"crossref","unstructured":"Khot, T., Natarajan, S., Kersting, K., & Shavlik, J. (2015). Gradient-based boosting for statistical relational learning: The markov logic network and missing data cases. MLJ .","DOI":"10.1007\/s10994-015-5481-4"},{"key":"6463_CR17","volume-title":"Production system models of learning and development","author":"D Klahr","year":"1986","unstructured":"Klahr, D., Langley, P., & Neches, R. (1986). Production system models of learning and development. Cambridge, MA: MIT press."},{"key":"6463_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00116249","volume":"1","author":"J Laird","year":"1986","unstructured":"Laird, J., Rosenbloom, P., & Newell, A. (1986). Chunking in Soar: The anatomy of a general learning mechanism. Machine Learning, 1, 11\u201346.","journal-title":"Machine Learning"},{"key":"6463_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7688.001.0001","volume-title":"The soar cognitive architecture","author":"JE Laird","year":"2012","unstructured":"Laird, J. E. (2012). The soar cognitive architecture. Cambridge: MIT Press."},{"key":"6463_CR20","doi-asserted-by":"crossref","unstructured":"Mihalkova, L., & Mooney, R.J. (2007). Bottom-up learning of markov logic network structure. Icml.","DOI":"10.1145\/1273496.1273575"},{"key":"6463_CR21","doi-asserted-by":"crossref","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., & Shavlik, J. (2012). Gradient-based boosting for statistical relational learning: The relational dependency network case. MLJ .","DOI":"10.1007\/s10994-011-5244-9"},{"key":"6463_CR22","volume-title":"Boosted statistical relational learners: From benchmarks to data-driven medicine","author":"S Natarajan","year":"2015","unstructured":"Natarajan, S., Khot, T., Kersting, K., & Shavlik, J. (2015). Boosted statistical relational learners: From benchmarks to data-driven medicine. New York: Springer."},{"key":"6463_CR23","volume-title":"Unified theories of cognition","author":"A Newell","year":"1990","unstructured":"Newell, A. (1990). Unified theories of cognition. Cambridge, MA: Harvard University Press."},{"key":"6463_CR24","unstructured":"Plotkin, G.D. (1970). A note on inductive generalization. Machine Intelligence."},{"key":"6463_CR25","unstructured":"Quinlan, J.R. (1987). Generating production rules from decision trees. Ijcai."},{"key":"6463_CR26","doi-asserted-by":"crossref","unstructured":"Richardson, M., & Domingos, P. (2006). Markov logic networks. ML.","DOI":"10.1007\/s10994-006-5833-1"},{"key":"6463_CR27","volume-title":"The Soar papers : Research on integrated intelligence","author":"PS Rosenbloom","year":"1993","unstructured":"Rosenbloom, P. S., Laird, J. E., & Newell, A. (1993). The Soar papers\u202f: Research on integrated intelligence. Cambridge, MA: MIT Press."},{"issue":"5\u20136","key":"6463_CR28","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.artint.2008.11.003","volume":"173","author":"S Sanner","year":"2009","unstructured":"Sanner, S., & Boutilier, C. (2009). Practical solution techniques for first-order mdps. Artificial Intelligence, 173(5\u20136), 748\u2013788.","journal-title":"Artificial Intelligence"},{"key":"6463_CR29","doi-asserted-by":"crossref","unstructured":"Sinha, A., Shen, Z., Song, Y., Ma, H., Eide, D., Hsu, B., & Wang, K. (2015). An overview of microsoft academic service (mas) and applications. Www.","DOI":"10.1145\/2740908.2742839"},{"key":"6463_CR30","unstructured":"Sirikulviriya, N., & Sinthupinyo, S. (2011). Integration of rules from a random forest. Iciee."},{"key":"6463_CR31","doi-asserted-by":"crossref","unstructured":"Slattery, S., & Craven, M. (1998). Combining statistical and relational methods for learning in hypertext domains. Ilp.","DOI":"10.1007\/BFb0027309"},{"key":"6463_CR32","doi-asserted-by":"crossref","unstructured":"Stickel, M.E. (1992). A prolog technology theorem prover: A new exposition and implementation in prolog. TCS.","DOI":"10.1016\/0304-3975(92)90168-F"},{"key":"6463_CR33","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. Pakdd.","DOI":"10.1007\/978-3-319-67274-8_10"},{"key":"6463_CR34","unstructured":"Vidal, T., & Schiffer, M. (2020). Born-again tree ensembles. Icml."},{"key":"6463_CR35","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1613\/jair.2489","volume":"31","author":"C Wang","year":"2008","unstructured":"Wang, C., Joshi, S., & Khardon, R. (2008). First order decision diagrams for relational mdps. Journal of Artificial Intelligence Research, 31, 431\u2013472.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6463_CR36","unstructured":"Zhou, Y., & Hooker, G. (2016). Interpreting models via single tree approximation. arXiv:1610.09036."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06463-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06463-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06463-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:07:37Z","timestamp":1764266857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06463-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,29]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["6463"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06463-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2023,11,29]]},"assertion":[{"value":"26 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 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":"oregonstate.edu, dallas.edu, indiana.edu.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Yes.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}