{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T09:01:28Z","timestamp":1773824488006,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T00:00:00Z","timestamp":1602979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["DMS-171255"],"award-info":[{"award-number":["DMS-171255"]}]},{"name":"National Institutes of Health","award":["R01 GM135926"],"award-info":[{"award-number":["R01 GM135926"]}]},{"name":"National Institutes of Health","award":["U19 AI111143"],"award-info":[{"award-number":["U19 AI111143"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3412815.3416893","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T23:37:54Z","timestamp":1602805074000},"page":"23-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Tree Space Prototypes"],"prefix":"10.1145","author":[{"given":"Sarah","family":"Tan","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Matvey","family":"Soloviev","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Giles","family":"Hooker","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Martin T.","family":"Wells","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,10,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Jose MF Moura, and Peter Eckersley","author":"Bhatt Umang","year":"2020","unstructured":"Umang Bhatt , Alice Xiang , Shubham Sharma , Adrian Weller , Ankur Taly , Yunhan Jia , Joydeep Ghosh , Ruchir Puri , Jose MF Moura, and Peter Eckersley . 2020 . Explainable machine learning in deployment. In FAT * . Umang Bhatt, Alice Xiang, Shubham Sharma, Adrian Weller, Ankur Taly, Yunhan Jia, Joydeep Ghosh, Ruchir Puri, Jose MF Moura, and Peter Eckersley. 2020. Explainable machine learning in deployment. In FAT* ."},{"key":"e_1_3_2_1_2_1","volume-title":"Prototype selection for interpretable classification. The Annals of Applied Statistics","author":"Bien Jacob","year":"2011","unstructured":"Jacob Bien and Robert Tibshirani . 2011. Prototype selection for interpretable classification. The Annals of Applied Statistics ( 2011 ). Jacob Bien and Robert Tibshirani. 2011. Prototype selection for interpretable classification. The Annals of Applied Statistics (2011)."},{"key":"e_1_3_2_1_3_1","volume-title":"Machine Learning","volume":"45","author":"Breiman Leo","year":"2001","unstructured":"Leo Breiman . 2001 . Random forests . Machine Learning , Vol. 45 , 1 (2001). Leo Breiman. 2001. Random forests. Machine Learning , Vol. 45, 1 (2001)."},{"key":"e_1_3_2_1_4_1","volume-title":"Random Forests Manual. https:\/\/www.stat.berkeley.edu\/ breiman\/RandomForests . Accessed","author":"Breiman Leo","year":"2019","unstructured":"Leo Breiman and Adele Cutler . 2002. Random Forests Manual. https:\/\/www.stat.berkeley.edu\/ breiman\/RandomForests . Accessed July 6, 2019 . Year 2002 based on copyright year indicated in the authors' Fortran code. Leo Breiman and Adele Cutler. 2002. Random Forests Manual. https:\/\/www.stat.berkeley.edu\/ breiman\/RandomForests . Accessed July 6, 2019. Year 2002 based on copyright year indicated in the authors' Fortran code."},{"key":"e_1_3_2_1_5_1","volume-title":"The Balanced Accuracy and Its Posterior Distribution. In International Conference on Pattern Recognition .","author":"Brodersen Kay Henning","year":"2010","unstructured":"Kay Henning Brodersen , Cheng Soon Ong , Klaas Enno Stephan , and Joachim M Buhmann . 2010 . The Balanced Accuracy and Its Posterior Distribution. In International Conference on Pattern Recognition . Kay Henning Brodersen, Cheng Soon Ong, Klaas Enno Stephan, and Joachim M Buhmann. 2010. The Balanced Accuracy and Its Posterior Distribution. In International Conference on Pattern Recognition ."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the AMIA Symposium . American Medical Informatics Association.","author":"Caruana Rich","year":"1999","unstructured":"Rich Caruana , Hooshang Kangarloo , John David Dionisio , Usha Sinha , and David Johnson . 1999 . Case-based explanation of non-case-based learning methods .. In Proceedings of the AMIA Symposium . American Medical Informatics Association. Rich Caruana, Hooshang Kangarloo, John David Dionisio, Usha Sinha, and David Johnson. 1999. Case-based explanation of non-case-based learning methods.. In Proceedings of the AMIA Symposium . American Medical Informatics Association."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Rich Caruana and Alexandru Niculescu-Mizil. 2006. An Empirical Comparison of Supervised Learning Algorithms. In ICML .  Rich Caruana and Alexandru Niculescu-Mizil. 2006. An Empirical Comparison of Supervised Learning Algorithms. In ICML .","DOI":"10.1145\/1143844.1143865"},{"key":"e_1_3_2_1_8_1","volume-title":"Towards A Rigorous Science of Interpretable Machine Learning. arXiv preprint arXiv:1702.08608","author":"Doshi-Velez Finale","year":"2017","unstructured":"Finale Doshi-Velez and Been Kim . 2017. Towards A Rigorous Science of Interpretable Machine Learning. arXiv preprint arXiv:1702.08608 ( 2017 ). Finale Doshi-Velez and Been Kim. 2017. Towards A Rigorous Science of Interpretable Machine Learning. arXiv preprint arXiv:1702.08608 (2017)."},{"key":"e_1_3_2_1_9_1","volume-title":"The accuracy, fairness, and limits of predicting recidivism. Science Advances","author":"Dressel Julia","year":"2018","unstructured":"Julia Dressel and Hany Farid . 2018. The accuracy, fairness, and limits of predicting recidivism. Science Advances ( 2018 ). Data accessed from www.cs.dartmouth.edu\/farid\/downloads\/publications\/scienceadvances17. Julia Dressel and Hany Farid. 2018. The accuracy, fairness, and limits of predicting recidivism. Science Advances (2018). Data accessed from www.cs.dartmouth.edu\/farid\/downloads\/publications\/scienceadvances17."},{"key":"e_1_3_2_1_10_1","volume-title":"Comprehensible classification models: a position paper. ACM SIGKDD Explorations","author":"Freitas Alex A","year":"2014","unstructured":"Alex A Freitas . 2014. Comprehensible classification models: a position paper. ACM SIGKDD Explorations ( 2014 ). Alex A Freitas. 2014. Comprehensible classification models: a position paper. ACM SIGKDD Explorations (2014)."},{"key":"e_1_3_2_1_11_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of Statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of Statistics ( 2001 ). Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of Statistics (2001)."},{"key":"e_1_3_2_1_12_1","volume-title":"Jose Ramon Cano, and Francisco Herrera","author":"Garcia Salvador","year":"2011","unstructured":"Salvador Garcia , Joaquin Derrac , Jose Ramon Cano, and Francisco Herrera . 2011 . Prototype selection for nearest neighbor classification: Taxonomy and empirical study. TPAMI ( 2011). Salvador Garcia, Joaquin Derrac, Jose Ramon Cano, and Francisco Herrera. 2011. Prototype selection for nearest neighbor classification: Taxonomy and empirical study. TPAMI (2011)."},{"key":"e_1_3_2_1_13_1","unstructured":"Ryan Gomes and Andreas Krause. 2010. Budgeted Nonparametric Learning from Data Streams. In ICML .  Ryan Gomes and Andreas Krause. 2010. Budgeted Nonparametric Learning from Data Streams. In ICML ."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/bdm.1753"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Ben Green and Yiling Chen. 2019. Disparate interactions: An algorithm-in-the-loop analysis of fairness in risk assessments. In FAT* .  Ben Green and Yiling Chen. 2019. Disparate interactions: An algorithm-in-the-loop analysis of fairness in risk assessments. In FAT* .","DOI":"10.1145\/3287560.3287563"},{"key":"e_1_3_2_1_16_1","volume-title":"Caltech-256 Object Category Dataset","author":"Griffin Gregory","year":"2006","unstructured":"Gregory Griffin , Alex Holub , and Pietro Perona . 2006. Caltech-256 Object Category Dataset . Technical Report , California Institute of Technology ( 2006 ). Gregory Griffin, Alex Holub, and Pietro Perona. 2006. Caltech-256 Object Category Dataset. Technical Report, California Institute of Technology (2006)."},{"key":"e_1_3_2_1_17_1","unstructured":"Raia Hadsell Sumit Chopra and Yann LeCun. 2006. Dimensionality Reduction by Learning an Invariant Mapping. In CVPR .  Raia Hadsell Sumit Chopra and Yann LeCun. 2006. Dimensionality Reduction by Learning an Invariant Mapping. In CVPR ."},{"key":"e_1_3_2_1_18_1","unstructured":"Satoshi Hara and Kohei Hayashi. 2018. Making tree ensembles interpretable: A Bayesian Model Selection Approach. In AISTATS .  Satoshi Hara and Kohei Hayashi. 2018. Making tree ensembles interpretable: A Bayesian Model Selection Approach. In AISTATS ."},{"key":"e_1_3_2_1_19_1","volume-title":"The condensed nearest neighbor rule","author":"Hart Peter","year":"1968","unstructured":"Peter Hart . 1968. The condensed nearest neighbor rule . IEEE Transactions on Information Theory ( 1968 ). Peter Hart. 1968. The condensed nearest neighbor rule. IEEE Transactions on Information Theory (1968)."},{"key":"e_1_3_2_1_20_1","volume-title":"Variable importance in binary regression trees and forests. Electronic Journal of Statistics","author":"Ishwaran Hemant","year":"2007","unstructured":"Hemant Ishwaran . 2007. Variable importance in binary regression trees and forests. Electronic Journal of Statistics ( 2007 ). Hemant Ishwaran. 2007. Variable importance in binary regression trees and forests. Electronic Journal of Statistics (2007)."},{"key":"e_1_3_2_1_21_1","volume":"198","author":"Kaufman Leonard","unstructured":"Leonard Kaufman and Peter J Rousseeuw. 198 7. Clustering by means of medoids. In Statistical Data Analysis Based on the L1 Norm. Birkh\u00e4user Basel. Leonard Kaufman and Peter J Rousseeuw. 1987. Clustering by means of medoids. In Statistical Data Analysis Based on the L1 Norm. Birkh\u00e4user Basel.","journal-title":"Peter J Rousseeuw."},{"key":"e_1_3_2_1_22_1","unstructured":"Rajiv Khanna Been Kim Joydeep Ghosh and Oluwasanmi Koyejo. 2019. Interpreting black box predictions using fisher kernels. In AISTATS .  Rajiv Khanna Been Kim Joydeep Ghosh and Oluwasanmi Koyejo. 2019. Interpreting black box predictions using fisher kernels. In AISTATS ."},{"key":"e_1_3_2_1_23_1","unstructured":"Been Kim Rajiv Khanna and Oluwasanmi O Koyejo. 2016. Examples are not enough learn to criticize! criticism for interpretability. In NIPS .  Been Kim Rajiv Khanna and Oluwasanmi O Koyejo. 2016. Examples are not enough learn to criticize! criticism for interpretability. In NIPS ."},{"key":"e_1_3_2_1_24_1","unstructured":"Been Kim Cynthia Rudin and Julie A Shah. 2014. The Bayesian Case Model: A generative approach for case-based reasoning and prototype classification. In NIPS .  Been Kim Cynthia Rudin and Julie A Shah. 2014. The Bayesian Case Model: A generative approach for case-based reasoning and prototype classification. In NIPS ."},{"key":"e_1_3_2_1_25_1","unstructured":"Pang Wei Koh and Percy Liang. 2017. Understanding black-box predictions via influence functions. In ICML .  Pang Wei Koh and Percy Liang. 2017. Understanding black-box predictions via influence functions. In ICML ."},{"key":"e_1_3_2_1_26_1","unstructured":"Vivian Lai and Chenhao Tan. 2019. On human predictions with explanations and predictions of machine learning models: A case study on deception detection. In FAT* .  Vivian Lai and Chenhao Tan. 2019. On human predictions with explanations and predictions of machine learning models: A case study on deception detection. In FAT* ."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Himabindu Lakkaraju and Osbert Bastani. 2020. \" How do I fool you?\" Manipulating User Trust via Misleading Black Box Explanations. In AIES .  Himabindu Lakkaraju and Osbert Bastani. 2020. \" How do I fool you?\" Manipulating User Trust via Misleading Black Box Explanations. In AIES .","DOI":"10.1145\/3375627.3375833"},{"key":"e_1_3_2_1_28_1","unstructured":"Jeff Larson Surya Mattu Lauren Kirchner and Julia Angwin. 2016. How We Analyzed the COMPAS Recidivism Algorithm. ProPublica.  Jeff Larson Surya Mattu Lauren Kirchner and Julia Angwin. 2016. How We Analyzed the COMPAS Recidivism Algorithm. ProPublica."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_1_30_1","unstructured":"Oscar Li Hao Liu Chaofan Chen and Cynthia Rudin. 2018. Deep learning for case-based reasoning through prototypes: A neural network that explains its predictions. In AAAI .  Oscar Li Hao Liu Chaofan Chen and Cynthia Rudin. 2018. Deep learning for case-based reasoning through prototypes: A neural network that explains its predictions. In AAAI ."},{"key":"e_1_3_2_1_31_1","volume-title":"Classification and regression by randomForest. R News","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw and Matthew Wiener . 2002. Classification and regression by randomForest. R News ( 2002 ). Andy Liaw and Matthew Wiener. 2002. Classification and regression by randomForest. R News (2002)."},{"key":"e_1_3_2_1_32_1","unstructured":"Hui Lin and Jeff Bilmes. 2011. A class of submodular functions for document summarization. In ACL .  Hui Lin and Jeff Bilmes. 2011. A class of submodular functions for document summarization. In ACL ."},{"key":"e_1_3_2_1_33_1","unstructured":"Yi Lin and Yongho Jeon. 2006. Random forests and adaptive nearest neighbors. J. Amer. Statist. Assoc. (2006).  Yi Lin and Yongho Jeon. 2006. Random forests and adaptive nearest neighbors. J. Amer. Statist. Assoc. (2006)."},{"key":"e_1_3_2_1_34_1","volume-title":"The Mythos of Model Interpretability. arXiv preprint arXiv:1606.03490","author":"Lipton Zachary C.","year":"2016","unstructured":"Zachary C. Lipton . 2016. The Mythos of Model Interpretability. arXiv preprint arXiv:1606.03490 ( 2016 ). Zachary C. Lipton. 2016. The Mythos of Model Interpretability. arXiv preprint arXiv:1606.03490 (2016)."},{"key":"e_1_3_2_1_35_1","volume-title":"Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502","author":"Louppe Gilles","year":"2014","unstructured":"Gilles Louppe . 2014. Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502 ( 2014 ). Gilles Louppe. 2014. Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502 (2014)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0138-9"},{"key":"e_1_3_2_1_37_1","unstructured":"Scott M Lundberg and Su-In Lee. 2017. A Unified Approach to Interpreting Model Predictions. In NIPS .  Scott M Lundberg and Su-In Lee. 2017. A Unified Approach to Interpreting Model Predictions. In NIPS ."},{"key":"e_1_3_2_1_38_1","volume-title":"Visualizing data using t-SNE. JMLR","author":"van der Maaten Laurens","year":"2008","unstructured":"Laurens van der Maaten and Geoffrey Hinton . 2008. Visualizing data using t-SNE. JMLR ( 2008 ). Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. JMLR (2008)."},{"key":"e_1_3_2_1_39_1","unstructured":"Baharan Mirzasoleiman Amin Karbasi Rik Sarkar and Andreas Krause. 2013. Distributed submodular maximization: Identifying representative elements in massive data. In NIPS .  Baharan Mirzasoleiman Amin Karbasi Rik Sarkar and Andreas Krause. 2013. Distributed submodular maximization: Identifying representative elements in massive data. In NIPS ."},{"key":"e_1_3_2_1_40_1","volume-title":"An analysis of approximations for maximizing submodular set functions?I. Mathematical Programming","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . 1978. An analysis of approximations for maximizing submodular set functions?I. Mathematical Programming ( 1978 ). George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions?I. Mathematical Programming (1978)."},{"key":"e_1_3_2_1_41_1","series-title":"SIAM J. Comput. (1981)","volume-title":"Worst-Case and Probabilistic Analysis of a Geometric Location Problem","author":"Papadimitriou Christos H","unstructured":"Christos H Papadimitriou . 1981. Worst-Case and Probabilistic Analysis of a Geometric Location Problem . SIAM J. Comput. (1981) . Christos H Papadimitriou. 1981. Worst-Case and Probabilistic Analysis of a Geometric Location Problem. SIAM J. Comput. (1981)."},{"key":"e_1_3_2_1_42_1","volume-title":"Jennifer Wortman Vaughan, and Hanna Wallach","author":"Poursabzi-Sangdeh Forough","year":"2018","unstructured":"Forough Poursabzi-Sangdeh , Daniel G Goldstein , Jake M Hofman , Jennifer Wortman Vaughan, and Hanna Wallach . 2018 . Manipulating and measuring model interpretability. arXiv preprint arXiv:1802.07810 (2018). Forough Poursabzi-Sangdeh, Daniel G Goldstein, Jake M Hofman, Jennifer Wortman Vaughan, and Hanna Wallach. 2018. Manipulating and measuring model interpretability. arXiv preprint arXiv:1802.07810 (2018)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Marco Tulio Ribeiro Sameer Singh and Carlos Guestrin. 2016. \u201cWhy Should I Trust You?\": Explaining the Predictions of Any Classifier. In KDD .  Marco Tulio Ribeiro Sameer Singh and Carlos Guestrin. 2016. \u201cWhy Should I Trust You?\": Explaining the Predictions of Any Classifier. In KDD .","DOI":"10.18653\/v1\/N16-3020"},{"key":"e_1_3_2_1_44_1","volume-title":"Case-based reasoning foundations. The Knowledge Engineering Review","author":"Richter Michael M","year":"2005","unstructured":"Michael M Richter and Agnar Aamodt . 2005. Case-based reasoning foundations. The Knowledge Engineering Review ( 2005 ). Michael M Richter and Agnar Aamodt. 2005. Case-based reasoning foundations. The Knowledge Engineering Review (2005)."},{"key":"e_1_3_2_1_45_1","volume-title":"Random forests and kernel methods","author":"Scornet Erwan","year":"2016","unstructured":"Erwan Scornet . 2016. Random forests and kernel methods . IEEE Transactions on Information Theory ( 2016 ). Erwan Scornet. 2016. Random forests and kernel methods. IEEE Transactions on Information Theory (2016)."},{"key":"e_1_3_2_1_46_1","volume-title":"Unsupervised learning with random forest predictors. Journal of Computational and Graphical Statistics","author":"Shi Tao","year":"2006","unstructured":"Tao Shi and Steve Horvath . 2006. Unsupervised learning with random forest predictors. Journal of Computational and Graphical Statistics ( 2006 ). Tao Shi and Steve Horvath. 2006. Unsupervised learning with random forest predictors. Journal of Computational and Graphical Statistics (2006)."},{"key":"e_1_3_2_1_47_1","unstructured":"Daniel J Stekhoven. 201"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3063289"},{"key":"e_1_3_2_1_49_1","volume-title":"Asymptotic properties of nearest neighbor rules using edited data sets. Transactions on Systems, Man and Cybernetics","author":"Wilson Dennis L","year":"1972","unstructured":"Dennis L Wilson . 1972. Asymptotic properties of nearest neighbor rules using edited data sets. Transactions on Systems, Man and Cybernetics ( 1972 ). Dennis L Wilson. 1972. Asymptotic properties of nearest neighbor rules using edited data sets. Transactions on Systems, Man and Cybernetics (1972)."},{"key":"e_1_3_2_1_50_1","volume":"201","author":"Xiong Caiming","unstructured":"Caiming Xiong , David Johnson , Ran Xu , and Jason J Corso. 201 2. Random forests for metric learning with implicit pairwise position dependence. In KDD . Caiming Xiong, David Johnson, Ran Xu, and Jason J Corso. 2012. Random forests for metric learning with implicit pairwise position dependence. In KDD .","journal-title":"Jason J Corso."},{"key":"e_1_3_2_1_51_1","volume-title":"Ian En-Hsu Yen, and Pradeep K Ravikumar","author":"Yeh Chih-Kuan","year":"2018","unstructured":"Chih-Kuan Yeh , Joon Kim , Ian En-Hsu Yen, and Pradeep K Ravikumar . 2018 . Representer point selection for explaining deep neural networks. In NeurIPS . Chih-Kuan Yeh, Joon Kim, Ian En-Hsu Yen, and Pradeep K Ravikumar. 2018. Representer point selection for explaining deep neural networks. In NeurIPS ."},{"key":"e_1_3_2_1_52_1","volume-title":"Propensity score and proximity matching using random forest. Contemporary Clinical Trials","author":"Zhao Peng","year":"2016","unstructured":"Peng Zhao , Xiaogang Su , Tingting Ge , and Juanjuan Fan . 2016. Propensity score and proximity matching using random forest. Contemporary Clinical Trials ( 2016 ). Peng Zhao, Xiaogang Su, Tingting Ge, and Juanjuan Fan. 2016. Propensity score and proximity matching using random forest. Contemporary Clinical Trials (2016)."},{"key":"e_1_3_2_1_53_1","volume-title":"Two approaches for novelty detection using random forest. Expert Systems with Applications","author":"Zhou Qi-Feng","year":"2015","unstructured":"Qi-Feng Zhou , Hao Zhou , Yong-Peng Ning , Fan Yang , and Tao Li. 2015. Two approaches for novelty detection using random forest. Expert Systems with Applications ( 2015 ). Qi-Feng Zhou, Hao Zhou, Yong-Peng Ning, Fan Yang, and Tao Li. 2015. Two approaches for novelty detection using random forest. Expert Systems with Applications (2015)."},{"key":"e_1_3_2_1_54_1","volume-title":"Approximation trees: Statistical stability in model distillation. arXiv preprint arXiv:1808.07573","author":"Zhou Yichen","year":"2018","unstructured":"Yichen Zhou , Zhengze Zhou , and Giles Hooker . 2018. Approximation trees: Statistical stability in model distillation. arXiv preprint arXiv:1808.07573 ( 2018 ). Yichen Zhou, Zhengze Zhou, and Giles Hooker. 2018. Approximation trees: Statistical stability in model distillation. arXiv preprint arXiv:1808.07573 (2018)."}],"event":{"name":"FODS '20: ACM-IMS Foundations of Data Science Conference","location":"Virtual Event USA","acronym":"FODS '20"},"container-title":["Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3412815.3416893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:02Z","timestamp":1750195502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416893"}},"subtitle":["Another Look at Making Tree Ensembles Interpretable"],"short-title":[],"issued":{"date-parts":[[2020,10,18]]},"references-count":54,"alternative-id":["10.1145\/3412815.3416893","10.1145\/3412815"],"URL":"https:\/\/doi.org\/10.1145\/3412815.3416893","relation":{},"subject":[],"published":{"date-parts":[[2020,10,18]]},"assertion":[{"value":"2020-10-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}