Cited by 50Explainable Artificial Intelligence (XAI)Anomaly Detection Techniques and ApplicationsData Mining Algorithms and Applications

Sequential Feature Explanations for Anomaly Detection

Open access
Siddiqui, Md Amran, Fern, Alan, Dietterich, Thomas G., Wong, Weng-Keen·2019·ACM Transactions on Knowledge Discovery from Data

Abstract

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’s 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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3230666

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Christopher M. Bishop. 2006. Pattern Recognition and Machine Learning, Vol. 4. Springer, New York.
  2. 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.
  3. Andreas Krause and Daniel Golovin. 2014. Submodular function maximization. In Tractability: Practical Approaches to Hard Problems, Lucas Bordeaux, Youssef Hamadi, and Pushmeet Kohli (Eds.). Cambridge University Press, 71-104.
  4. Nguyen Xuan Vinh, Jeffrey Chan, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, and Jian Pei. 2015. Scalable outlying-inlying aspects discovery via feature ranking. In Advances in Knowledge Discovery and Data Mining. Springer, 422-434.

Cited by

Sorted by citations

Authors
Siddiqui, M. A., Fern, A., Dietterich, T. G., & Wong, W.-K.
Affiliations
  • Oregon State University, Corvallis, Oregon
  • Oregon State University (US)
Venue
ACM Transactions on Knowledge Discovery from Data
Published
2019-01-09
Volume
13
Issue
1
Pages
1-22
ISSN
  • 1556-4681 (ISSN-L)
  • 1556-472X
OpenAlex
W2155255700
Cited by
50
References
12
Citations by year
2026: 1 · 2025: 4 · 2024: 5 · 2023: 3 · 2022: 6 · 2021: 13 · 2020: 9 · 2019: 5 · 2018: 1 · 2017: 1 · 2016: 2
FWCI
3.76
Type
journal article
Language
en
Open access
Locations
  • ACM Transactions on Knowledge Discovery from Data (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • DARPA (N66001-17-2-4030 and FA8650-15-C7557)
  • Future of Life Institute (W911NF-11-C-0088)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
anomaly detection, explainable AI, density-based anomaly detection, explanation evaluation, branch and bound, greedy algorithm

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review