{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T16:40:55Z","timestamp":1776098455703,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARO"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chan-Zuckerberg BIohub"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,20]]},"DOI":"10.1145\/3336191.3372191","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"4-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Veridical Data Science"],"prefix":"10.1145","author":[{"given":"Bin","family":"Yu","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"iterative Random Forests to discover predictive and stable high-order interactions PNAS, 115 (8)","author":"Kumbier K.","year":"2018","unstructured":"Basu, K. Kumbier , J. B. Brown , and B. Yu ( 2018 ) iterative Random Forests to discover predictive and stable high-order interactions PNAS, 115 (8) , 1943--1948. Basu, K. Kumbier, J. B. Brown, and B. Yu (2018) iterative Random Forests to discover predictive and stable high-order interactions PNAS, 115 (8), 1943--1948."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1900654116"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. ICLR. https:\/\/arxiv.org\/abs\/1705","author":"Murdoch J.","year":"2018","unstructured":"J. Murdoch , P. Liu , and B. Yu ( 2018 ). Beyond word importance: contextual decomposition to extract interactions from LSTMs . Proc. ICLR. https:\/\/arxiv.org\/abs\/1705 .07356 J. Murdoch, P. Liu, and B. Yu (2018). Beyond word importance: contextual decomposition to extract interactions from LSTMs. Proc. ICLR. https:\/\/arxiv.org\/abs\/1705.07356"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. ICLR. https:\/\/arxiv.org\/abs\/1806","author":"Singh C.","year":"2019","unstructured":"C. Singh , W. J. Murdoch , and B. Yu ( 2019 ) Hierarchical interpretations for neural network predictions . Proc. ICLR. https:\/\/arxiv.org\/abs\/1806 .05337 C. Singh, W. J. Murdoch, and B. Yu (2019) Hierarchical interpretations for neural network predictions. Proc. ICLR. https:\/\/arxiv.org\/abs\/1806.05337"},{"key":"e_1_3_2_1_5_1","volume-title":"Refining interaction search through signed iterative Random Forests. https:\/\/arxiv.org\/abs\/1810.07287","author":"Kumbier K.","year":"2018","unstructured":"K. Kumbier , S. Sumanta , J. B. Brown , S. Celniker , and B. Yu ( 2018 ) Refining interaction search through signed iterative Random Forests. https:\/\/arxiv.org\/abs\/1810.07287 K. Kumbier, S. Sumanta, J. B. Brown, S. Celniker, and B. Yu (2018) Refining interaction search through signed iterative Random Forests. https:\/\/arxiv.org\/abs\/1810.07287"},{"key":"e_1_3_2_1_6_1","volume-title":"Oct. 4","author":"Yu B.","year":"2019","unstructured":"B. Yu and K. Kumbier ( 2019 ) Three principles of data science: predictability, computability, and stability (PCS) https:\/\/arxiv.org\/abs\/1901.08152 Dahshu Journal Club talk slides , Oct. 4 , 2019 B. Yu and K. Kumbier (2019) Three principles of data science: predictability, computability, and stability (PCS) https:\/\/arxiv.org\/abs\/1901.08152 Dahshu Journal Club talk slides, Oct. 4, 2019"}],"event":{"name":"WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining","location":"Houston TX USA","acronym":"WSDM '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 13th International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3372191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3372191","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3372191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:15Z","timestamp":1750202595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3372191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":6,"alternative-id":["10.1145\/3336191.3372191","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3372191","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}