{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:32:52Z","timestamp":1778661172856,"version":"3.51.4"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T00:00:00Z","timestamp":1546992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["N66001-17-2-4030 and FA8650-15-C7557"],"award-info":[{"award-number":["N66001-17-2-4030 and FA8650-15-C7557"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100017561","name":"Future of Life Institute","doi-asserted-by":"crossref","award":["W911NF-11-C-0088"],"award-info":[{"award-number":["W911NF-11-C-0088"]}],"id":[{"id":"10.13039\/100017561","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>In many applications, an anomaly detection system presents the most anomalous data instance to a human analyst, who then must determine whether the instance is truly of interest (e.g., a threat in a security setting). Unfortunately, most anomaly detectors provide no explanation about why an instance was considered anomalous, leaving the analyst with no guidance about where to begin the investigation. To address this issue, we study the problems of computing and evaluating sequential feature explanations (SFEs) for anomaly detectors. An SFE of an anomaly is a sequence of features, which are presented to the analyst one at a time (in order) until the information contained in the highlighted features is enough for the analyst to make a confident judgement about the anomaly. Since analyst effort is related to the amount of information that they consider in an investigation, an explanation\u2019s quality is related to the number of features that must be revealed to attain confidence. In this article, we first formulate the problem of optimizing SFEs for a particular density-based anomaly detector. We then present both greedy algorithms and an optimal algorithm, based on branch-and-bound search, for optimizing SFEs. Finally, we provide a large scale quantitative evaluation of these algorithms using a novel framework for evaluating explanations. The results show that our algorithms are quite effective and that our best greedy algorithm is competitive with optimal solutions.<\/jats:p>","DOI":"10.1145\/3230666","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T15:53:12Z","timestamp":1546962792000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Sequential Feature Explanations for Anomaly Detection"],"prefix":"10.1145","volume":"13","author":[{"given":"Md Amran","family":"Siddiqui","sequence":"first","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Fern","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas G.","family":"Dietterich","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weng-Keen","family":"Wong","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859912"},{"key":"e_1_2_1_2_1","unstructured":"Christopher M. Bishop. 2006. Pattern Recognition and Machine Learning Vol. 4. Springer New York.   Christopher M. Bishop. 2006. Pattern Recognition and Machine Learning Vol. 4. Springer New York."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the IEEE 30th International Conference on Data Engineering (ICDE\u201914)","author":"Dang Xuan Hong","year":"2014"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_20"},{"key":"e_1_2_1_5_1","unstructured":"Houtao Deng. 2013. Guided random forest in the RRF package. arXiv:1306.0237.  Houtao Deng. 2013. Guided random forest in the RRF package. arXiv:1306.0237."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0398-2"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500853.2500858"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2697065"},{"key":"e_1_2_1_9_1","unstructured":"Seth Hettich and S. D. Bay. 1999. The UCI KDD Archive. Department of Information and Computer Science University of California Irvine CA. Retrieved from http:\/\/kdd.ics.uci.edu.  Seth Hettich and S. D. Bay. 1999. The UCI KDD Archive. Department of Information and Computer Science University of California Irvine CA. Retrieved from http:\/\/kdd.ics.uci.edu."},{"key":"e_1_2_1_10_1","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Krause Andreas"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.132"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190734"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756007"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0679-x"},{"key":"e_1_2_1_15_1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Vinh Nguyen Xuan"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230666","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:47Z","timestamp":1750210787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3230666"],"URL":"https:\/\/doi.org\/10.1145\/3230666","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,9]]},"assertion":[{"value":"2016-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}