{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T01:29:51Z","timestamp":1687397391971},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:p>Machine Learning models are prevalent in critical human-related decision making, such as resume filtering and loan applications. Refused individuals naturally ask what could change the decision, should they reapply. This question is hard for the model owner to answer: first, the model is typically complex and not easily interpretable; second, models may be updated periodically; and last, attributes of the individual seeking approval are apt to change in time. While each of these challenges have been extensively studied in isolation, their conjunction has not.<\/jats:p>\n          <jats:p>To this end, we propose a novel framework that allows users to devise a plan of action to individuals in presence of Machine Learning classification, where both the ML model and the user properties are expected to change over time. Our technical solution is currently confined to a particular yet important class of models, namely those of tree-based ensembles (Random Forests, Gradient Boosted trees). In this setting it uniquely combines state-of-the-art solutions for single model interpretation, domain adaptation techniques for predicting future models, and constraint databases to represent and query the space of possible actions. We devise efficient algorithms that leverage these foundations in a novel solution, and experimentally show that they are effective in proposing useful and actionable steps leading to the desired classification.<\/jats:p>","DOI":"10.14778\/3380750.3380752","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T21:49:08Z","timestamp":1583963348000},"page":"798-811","source":"Crossref","is-referenced-by-count":1,"title":["Personal insights for altering decisions of tree-based ensembles over time"],"prefix":"10.14778","volume":"13","author":[{"given":"Naama","family":"Boer","sequence":"first","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Daniel","family":"Deutch","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Nave","family":"Frost","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0130140"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/113413.113439"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5152-4"},{"key":"e_1_2_1_4_1","first-page":"137","volume-title":"Advances in neural information processing systems","author":"Ben-David S.","year":"2007"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Benedikt G. Dong L. Libkin and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM (JACM) 45(1):1--34 1998.  M. Benedikt G. Dong L. Libkin and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM (JACM) 45(1):1--34 1998.","DOI":"10.1145\/273865.273870"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00221"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"N. Boer D. Deutch N. Frost and T. Milo. Personal insights for altering decisions of tree-based ensembles over time (technical report). http:\/\/bit.ly\/2YCceoP 2019.  N. Boer D. Deutch N. Frost and T. Milo. Personal insights for altering decisions of tree-based ensembles over time (technical report). http:\/\/bit.ly\/2YCceoP 2019.","DOI":"10.1109\/ICDE.2019.00221"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"e_1_2_1_9_1","first-page":"68","volume-title":"ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications","author":"Byon J.-H.","year":"1995"},{"key":"e_1_2_1_10_1","first-page":"1010","volume-title":"IJCAI","volume":"5","author":"Chan Y. S.","year":"2005"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220175.1220187"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.42"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269214"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00054"},{"key":"e_1_2_1_15_1","unstructured":"F. Doshi-Velez and B. Kim. Towards a rigorous science of interpretable machine learning. 2017.  F. Doshi-Velez and B. Kim. Towards a rigorous science of interpretable machine learning. 2017."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of computer and system sciences 55(1):119--139 1997.  Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of computer and system sciences 55(1):119--139 1997.","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J. H. Friedman. Greedy function approximation: a gradient boosting machine. Annals of statistics pages 1189--1232 2001.  J. H. Friedman. Greedy function approximation: a gradient boosting machine. Annals of statistics pages 1189--1232 2001.","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8265-9_1268"},{"key":"e_1_2_1_19_1","first-page":"198","volume-title":"International Workshop on Database Programming Languages","author":"Geerts F.","year":"2001"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5587-4_13"},{"key":"e_1_2_1_21_1","first-page":"513","volume-title":"Proceedings of the 28th international conference on machine learning (ICML-11)","author":"Glorot X.","year":"2011"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/648292.754530"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00194-6"},{"key":"e_1_2_1_24_1","unstructured":"S. Grumbach J. Su and C. Tollu. Linear constraint databases. 1995.  S. Grumbach J. Su and C. Tollu. Linear constraint databases. 1995."},{"key":"e_1_2_1_25_1","first-page":"278","volume-title":"proceedings of the third international conference on","author":"Ho T. K.","year":"1995"},{"key":"e_1_2_1_26_1","unstructured":"Home credit data. https:\/\/www.kaggle.com\/c\/home-credit-default-risk\/data.  Home credit data. https:\/\/www.kaggle.com\/c\/home-credit-default-risk\/data."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"J. Huysmans B. Baesens and J. Vanthienen. Using rule extraction to improve the comprehensibility of predictive models. 2006.  J. Huysmans B. Baesens and J. Vanthienen. Using rule extraction to improve the comprehensibility of predictive models. 2006.","DOI":"10.2139\/ssrn.961358"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2010.12.003"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"N. Japkowicz and S. Stephen. The class imbalance problem: A systematic study. Intelligent data analysis 6(5):429--449 2002.  N. Japkowicz and S. Stephen. The class imbalance problem: A systematic study. Intelligent data analysis 6(5):429--449 2002.","DOI":"10.3233\/IDA-2002-6504"},{"key":"e_1_2_1_30_1","unstructured":"J. Jiang. A literature survey on domain adaptation of statistical classifiers. 3:1--12 2008. http:\/\/sifaka.es.uiuc.edu\/jiang4\/domainadaptation\/survey.  J. Jiang. A literature survey on domain adaptation of statistical classifiers. 3:1--12 2008. http:\/\/sifaka.es.uiuc.edu\/jiang4\/domainadaptation\/survey."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICHI.2018.00092"},{"key":"e_1_2_1_32_1","unstructured":"Kaggle. The state of ml and data science 2017. https:\/\/www.kaggle.com\/surveys\/2017 2017.  Kaggle. The state of ml and data science 2017. https:\/\/www.kaggle.com\/surveys\/2017 2017."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1051"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-1452-8.50131-7"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00124-7"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"B. Kuijpers and W. Othman. Trajectory databases: Data models uncertainty and complete query languages. 2010.  B. Kuijpers and W. Othman. Trajectory databases: Data models uncertainty and complete query languages. 2010.","DOI":"10.1016\/j.jcss.2009.10.002"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995702"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/3016100.3016147"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298545"},{"key":"e_1_2_1_40_1","volume-title":"Springer Science & Business Media","author":"Kuper G.","year":"2013"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298696"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"T. Laugel M.-J. Lesot C. Marsala X. Renard and M. Detyniecki. Inverse classification for comparison-based interpretability in machine learning. arXiv preprint arXiv:1712.08443 2017.  T. Laugel M.-J. Lesot C. Marsala X. Renard and M. Detyniecki. Inverse classification for comparison-based interpretability in machine learning. arXiv preprint arXiv:1712.08443 2017.","DOI":"10.1007\/978-3-319-91473-2_9"},{"key":"e_1_2_1_43_1","unstructured":"Lending club data. https:\/\/www.lendingclub.com\/info\/download-data.action.  Lending club data. https:\/\/www.lendingclub.com\/info\/download-data.action."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012406528296"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"S. M. Lundberg G. Erion H. Chen A. DeGrave J. M. Prutkin B. Nair R. Katz J. Himmelfarb N. Bansal and S.-I. Lee. Explainable ai for trees: From local explanations to global understanding. arXiv preprint arXiv:1905.04610 2019.  S. M. Lundberg G. Erion H. Chen A. DeGrave J. M. Prutkin B. Nair R. Katz J. Himmelfarb N. Bansal and S.-I. Lee. Explainable ai for trees: From local explanations to global understanding. arXiv preprint arXiv:1905.04610 2019.","DOI":"10.1038\/s42256-019-0138-9"},{"key":"e_1_2_1_46_1","unstructured":"S. M. Lundberg G. G. Erion and S.-I. Lee. Consistent individualized feature attribution for tree ensembles. arXiv preprint arXiv:1802.03888 2018.  S. M. Lundberg G. G. Erion and S.-I. Lee. Consistent individualized feature attribution for tree ensembles. arXiv preprint arXiv:1802.03888 2018."},{"key":"e_1_2_1_47_1","first-page":"4765","volume-title":"Advances in Neural Information Processing Systems","author":"Lundberg S. M.","year":"2017"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"C. Molnar. Interpretable Machine Learning. 2019. https:\/\/christophm.github.io\/interpretable-ml-book\/.  C. Molnar. Interpretable Machine Learning. 2019. https:\/\/christophm.github.io\/interpretable-ml-book\/.","DOI":"10.21105\/joss.00786"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/182591.182640"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_2_1_51_1","volume-title":"NIPS 2017 Transparent and Interpretable Machine Learning in Safety Critical Environments Workshop","author":"Poursabzi-Sangdeh F.","year":"2017"},{"key":"e_1_2_1_52_1","first-page":"209","volume-title":"International Workshop on Semantics in Databases","author":"Revesz P. Z.","year":"1995"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"M. T. Ribeiro S. Singh and C. Guestrin. Why should i trust you?: Explaining the predictions of any classifier. pages 1135--1144 2016.  M. T. Ribeiro S. Singh and C. Guestrin. Why should i trust you?: Explaining the predictions of any classifier. pages 1135--1144 2016.","DOI":"10.18653\/v1\/N16-3020"},{"key":"e_1_2_1_54_1","unstructured":"A. Shrikumar P. Greenside and A. Kundaje. Learning important features through propagating activation differences. arXiv preprint arXiv:1704.02685 2017.  A. Shrikumar P. Greenside and A. Kundaje. Learning important features through propagating activation differences. arXiv preprint arXiv:1704.02685 2017."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.463"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1455"},{"key":"e_1_2_1_57_1","first-page":"163","volume-title":"ESANN","volume":"12","author":"Vellido A.","year":"2012"},{"key":"e_1_2_1_58_1","first-page":"841","article-title":"Counterfactual explanations without opening the black box: Automated decisions and the gpdr","volume":"31","author":"Wachter S.","year":"2017","journal-title":"Harv. JL & Tech."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.083"},{"key":"e_1_2_1_60_1","first-page":"6","volume-title":"Proceedings of the 26th annual conference on learning theory (COLT 2013","volume":"8","author":"Wang Y.","year":"2013"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3380750.3380752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:29:13Z","timestamp":1672219753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3380750.3380752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":60,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.14778\/3380750.3380752"],"URL":"https:\/\/doi.org\/10.14778\/3380750.3380752","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}