DTOR: Decision Tree Outlier Regressor to explain anomalies

• URL: http://arxiv.org/abs/2403.10903v4
• Date: Sun, 12 May 2024 17:20:11 GMT
• Title: DTOR: Decision Tree Outlier Regressor to explain anomalies
• Authors: Riccardo Crupi, Daniele Regoli, Alessandro Damiano Sabatino, Immacolata Marano, Massimiliano Brinis, Luca Albertazzi, Andrea Cirillo, Andrea Claudio Cosentini,
• Abstract summary: Decision Tree Outlier Regressor (DTOR) is a technique for producing rule-based explanations for individual data points. Our results demonstrate the robustness of DTOR even in datasets with a large number of features.
• Score: 37.00322799216377
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Explaining outliers occurrence and mechanism of their occurrence can be extremely important in a variety of domains. Malfunctions, frauds, threats, in addition to being correctly identified, oftentimes need a valid explanation in order to effectively perform actionable counteracts. The ever more widespread use of sophisticated Machine Learning approach to identify anomalies make such explanations more challenging. We present the Decision Tree Outlier Regressor (DTOR), a technique for producing rule-based explanations for individual data points by estimating anomaly scores generated by an anomaly detection model. This is accomplished by first applying a Decision Tree Regressor, which computes the estimation score, and then extracting the relative path associated with the data point score. Our results demonstrate the robustness of DTOR even in datasets with a large number of features. Additionally, in contrast to other rule-based approaches, the generated rules are consistently satisfied by the points to be explained. Furthermore, our evaluation metrics indicate comparable performance to Anchors in outlier explanation tasks, with reduced execution time.

Related papers

• ARC: A Generalist Graph Anomaly Detector with In-Context Learning [62.202323209244]
  ARC is a generalist GAD approach that enables a one-for-all'' GAD model to detect anomalies across various graph datasets on-the-fly. equipped with in-context learning, ARC can directly extract dataset-specific patterns from the target dataset. Extensive experiments on multiple benchmark datasets from various domains demonstrate the superior anomaly detection performance, efficiency, and generalizability of ARC.
  arXiv  Detail & Related papers  (2024-05-27T02:42:33Z)
• Root Cause Explanation of Outliers under Noisy Mechanisms [50.59446568076628]
  Causal processes are often modelled as graphs with entities being nodes and their paths/interconnections as edge. Existing work only consider the contribution of nodes in the generative process. We consider both individual edge and node of each mechanism when identifying the root causes.
  arXiv  Detail & Related papers  (2023-12-19T03:24:26Z)
• PARs: Predicate-based Association Rules for Efficient and Accurate Model-Agnostic Anomaly Explanation [2.280762565226767]
  We present a novel approach for efficient and accurate model-agnostic anomaly explanation using Predicate-based Association Rules (PARs) Our user study indicates that the anomaly explanation form of PARs is better comprehended and preferred by regular users of anomaly detection systems.
  arXiv  Detail & Related papers  (2023-12-18T06:45:31Z)
• Interpretable Outlier Summarization [10.41121739124057]
  Outlier detection is critical in real applications to prevent financial fraud, defend network intrusions, or detecting imminent device failures. We propose STAIR which learns a compact set of human understandable rules to summarize and explain the anomaly detection results. Our experimental study on many outlier benchmark datasets shows that STAIR significantly reduces the complexity of the rules required to summarize the outlier detection results.
  arXiv  Detail & Related papers  (2023-03-11T00:53:49Z)
• Framing Algorithmic Recourse for Anomaly Detection [18.347886926848563]
  We present an approach -- Context preserving Algorithmic Recourse for Anomalies in Tabular data (CARAT) CARAT uses a transformer based encoder-decoder model to explain an anomaly by finding features with low likelihood. Semantically coherent counterfactuals are generated by modifying the highlighted features, using the overall context of features in the anomalous instance(s)
  arXiv  Detail & Related papers  (2022-06-29T03:30:51Z)
• SLA$^2$P: Self-supervised Anomaly Detection with Adversarial Perturbation [77.71161225100927]
  Anomaly detection is a fundamental yet challenging problem in machine learning. We propose a novel and powerful framework, dubbed as SLA$2$P, for unsupervised anomaly detection.
  arXiv  Detail & Related papers  (2021-11-25T03:53:43Z)
• Dependency-based Anomaly Detection: a General Framework and Comprehensive Evaluation [33.31923133201812]
  This paper introduces Dependency-based Anomaly Detection (DepAD) DepAD reframes unsupervised anomaly detection as supervised feature selection and prediction tasks. Two DepAD algorithms emerge as all-rounders and superior performers in handling a wide range of datasets.
  arXiv  Detail & Related papers  (2020-11-13T01:39:44Z)
• Self-Attentive Classification-Based Anomaly Detection in Unstructured Logs [59.04636530383049]
  We propose Logsy, a classification-based method to learn log representations. We show an average improvement of 0.25 in the F1 score, compared to the previous methods.
  arXiv  Detail & Related papers  (2020-08-21T07:26:55Z)
• Unsupervised Anomaly Detection with Adversarial Mirrored AutoEncoders [51.691585766702744]
  We propose a variant of Adversarial Autoencoder which uses a mirrored Wasserstein loss in the discriminator to enforce better semantic-level reconstruction. We put forward an alternative measure of anomaly score to replace the reconstruction-based metric. Our method outperforms the current state-of-the-art methods for anomaly detection on several OOD detection benchmarks.
  arXiv  Detail & Related papers  (2020-03-24T08:26:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.