{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T17:00:23Z","timestamp":1793206823151,"version":"4.5.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10489-022-04180-1","type":"journal-article","created":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T11:03:11Z","timestamp":1666695791000},"page":"14371-14382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Extracting optimal explanations for ensemble trees via automated reasoning"],"prefix":"10.1007","volume":"53","author":[{"given":"Gelin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zh\u00e9","family":"H\u00f3u","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanhong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianqi","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hadrien","family":"Bride","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin Song","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongsheng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,25]]},"reference":[{"key":"4180_CR1","unstructured":"Ho TK (1995) Random decision forests. In: Proceedings of 3rd International conference on document analysis and recognition. IEEE, vol 1, pp 278\u2013282"},{"issue":"1","key":"4180_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(1):5\u201332","journal-title":"Mach Learn"},{"key":"4180_CR3","first-page":"771","volume":"14","author":"Y Freund","year":"1999","unstructured":"Freund Y, E Schapire R (1999) A short introduction to boosting. Trans Jpn Soc Artif Intell 14:771\u2013780","journal-title":"Trans Jpn Soc Artif Intell"},{"issue":"4","key":"4180_CR4","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 Stat Data Anal 38(4):367\u2013378","journal-title":"Comput Stat Data Anal"},{"key":"4180_CR5","unstructured":"Pafka S (2018) A minimal benchmark for scalability, speed and accuracy of commonly used open source implementations of the top machine learning algorithms for binary classification. https:\/\/github.com\/szilard\/benchm-ml. Accessed 28 Sept 2022"},{"key":"4180_CR6","doi-asserted-by":"crossref","unstructured":"Bride H, Dong J, Dong JS, H\u00f3u Z (2018) Towards dependable and explainable machine learning using automated reasoning. In: Formal methods and software engineering - 20th international conference on formal engineering methods, ICFEM 2018, gold coast, QLD, Australia, November 12-16, 2018, Proceedings, pp 412\u2013416","DOI":"10.1007\/978-3-030-02450-5_25"},{"key":"4180_CR7","unstructured":"Ltd DIP (2018) Silas. https:\/\/depintel.com\/silas\/. Accessed 28 Sept 2022"},{"key":"4180_CR8","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2016) Why should I trust you? : Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International conference on knowledge discovery and data mining, San Francisco, CA, USA, August 13-17, 2016, pp 1135\u20131144","DOI":"10.1145\/2939672.2939778"},{"key":"4180_CR9","unstructured":"Lundberg SM, Lee S-I (2017) A unified approach to interpreting model predictions. In: NIPS"},{"key":"4180_CR10","unstructured":"Hinton G, Frosst N (2017) Distilling a neural network into a soft decision tree. https:\/\/arxiv.org\/pdf\/1711.09784.pdf"},{"key":"4180_CR11","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2018) Anchors: High-precision model-agnostic explanations. In: Proceedings of the AAAI Conference on artificial intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"4180_CR12","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 RMA (2020) Chirps: Explaining random forest classification. Artif Intell Rev 53:5747\u2013 5788","journal-title":"Artif Intell Rev"},{"key":"4180_CR13","unstructured":"Hara S, Hayashi K (2018) Making tree ensembles interpretable: a bayesian model selection approach. In: International Conference on Artificial Intelligence and Statistics, pp 77\u201385. PMLR"},{"issue":"4","key":"4180_CR14","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"},{"issue":"1","key":"4180_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106. https:\/\/doi.org\/10.1023\/A:1022643204877","journal-title":"Mach Learn"},{"key":"4180_CR16","doi-asserted-by":"publisher","unstructured":"Cui Z, Chen W, He Y, Chen Y (2015) Optimal action extraction for random forests and boosted trees. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201915, pp 179\u2013188. ACM. https:\/\/doi.org\/10.1145\/2783258.2783281","DOI":"10.1145\/2783258.2783281"},{"key":"4180_CR17","first-page":"1189","volume":"29","author":"JH Friedman","year":"2000","unstructured":"Friedman JH (2000) Greedy function approximation: a gradient boosting machine. Ann Stat 29:1189\u20131232","journal-title":"Ann Stat"},{"key":"4180_CR18","unstructured":"Kullback S (1959) Information theory and statistics. Wiley"},{"key":"4180_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C Shannon","year":"1948","unstructured":"Shannon C (1948) A mathematical theory of communication. Bell Syst Tech J 27:379\u2013423","journal-title":"Bell Syst Tech J"},{"key":"4180_CR20","unstructured":"Papenmeier A, Englebienne G, Seifert C (2019) How model accuracy and explanation fidelity influence user trust. arXiv:1907.12652"},{"key":"4180_CR21","doi-asserted-by":"publisher","unstructured":"Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol 3, pp 1945\u201319503. https:\/\/doi.org\/10.1109\/CEC.1999.785511","DOI":"10.1109\/CEC.1999.785511"},{"key":"4180_CR22","doi-asserted-by":"crossref","unstructured":"de Moura L, Bj\u00f8rner N (2008) Z3: An efficient smt solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) tools and algorithms for the construction and analysis of systems, pp 337\u2013340. Springer","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"4180_CR23","unstructured":"Du D, Gu J, Pardalos PM et al (1997) Satisfiability problem: theory and applications: DIMACS Workshop, March 11\u201313, 1996, vol 35. American Mathematical Soc."},{"key":"4180_CR24","unstructured":"OpenML (2022) openml.org. https:\/\/www.openml.org. Accessed 28 Sept 2022"},{"key":"4180_CR25","unstructured":"Dua D, Graff C (2017) UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml. Accessed 28 Sept 2022"},{"issue":"2","key":"4180_CR26","first-page":"4","volume":"1","author":"L Breiman","year":"1996","unstructured":"Breiman L, Shang N (1996) Born again trees. University of California, Berkeley, Berkeley, CA, Technical Report 1(2):4","journal-title":"University of California, Berkeley, Berkeley, CA, Technical Report"},{"key":"4180_CR27","doi-asserted-by":"crossref","unstructured":"Meinshausen N (2010) Node harvest, vol 4. http:\/\/www.jstor.org\/stable\/23362459","DOI":"10.1214\/10-AOAS367"},{"key":"4180_CR28","unstructured":"Wan A, Dunlap L, Ho D, Yin J, Lee S, Jin H, Petryk S, Bargal SA, Gonzalez JE (2020) NBDT: Neural-Backed Decision Trees. arXiv:2004.00221"},{"key":"4180_CR29","doi-asserted-by":"crossref","unstructured":"T\u00f6rnblom J, Nadjm-Tehrani S (2019) Formal verification of random forests in safety-critical applications: 6th International Workshop, FTSCS 2018, Gold Coast, Australia, November 16, 2018, Revised Selected Papers. pp 55\u201371","DOI":"10.1007\/978-3-030-12988-0_4"},{"key":"4180_CR30","doi-asserted-by":"crossref","unstructured":"Wang B, H\u00f3u Z, Zhang G, Shi J, Huang Y (2021) Tree ensemble property verification from a testing perspective. In: Accepted by the 33rd international conference on software engineering and knowledge engineering (SEKE), pittsburgh, USA","DOI":"10.18293\/SEKE2021-087"},{"key":"4180_CR31","doi-asserted-by":"publisher","first-page":"114806","DOI":"10.1016\/j.eswa.2021.114806","volume":"176","author":"H Bride","year":"2021","unstructured":"Bride H, Cai C, Dong J, Dong JS, H\u00f3u Z, Mirjalili S, Sun J (2021) Silas: a high-performance machine learning foundation for logical reasoning and verification. Expert Syst Appl 176:114806. https:\/\/doi.org\/10.1016\/j.eswa.2021.114806","journal-title":"Expert Syst Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04180-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-04180-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04180-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T10:38:17Z","timestamp":1685529497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-04180-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,25]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["4180"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-04180-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,25]]},"assertion":[{"value":"13 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}