PARs: Predicate-based Association Rules for Efficient and Accurate Model-Agnostic Anomaly Explanation
While new and effective methods for anomaly detection are frequently introduced, many studies prioritize the detection task without considering the need for explainability. Yet, in real-world applications, anomaly explanation, which aims to provide explanation of why specific data instances are identified as anomalies, is an equally important task. In this work, we present a novel approach for efficient and accurate model-agnostic anomaly explanation for tabular data using Predicate-based Association Rules (PARs). PARs can provide intuitive explanations not only about which features of the anomaly instance are abnormal, but also the reasons behind their abnormality. Our user study indicates that the anomaly explanation form of PARs is better comprehended and preferred by regular users of anomaly detection systems as compared to existing model-agnostic explanation options. Furthermore, we conduct extensive experiments on various benchmark datasets, demonstrating that PARs compare favorably to state-of-the-art model-agnostic methods in terms of computing efficiency and explanation accuracy on anomaly explanation tasks. The code for PARs tool is available at https://github.com/NSIBF/PARs-EXAD.
Code (1)
Tasks
Anomaly DetectionSimilar Papers 제목 키워드 기반
Graph Pattern-based Association Rules Evaluated Under No-repeated-anything Semantics in the Graph Transactional Setting
We introduce graph pattern-based association rules (GPARs) for directed labeled multigraphs such as RDF graphs. GPARs support both generative tasks, where a graph is extended, and evaluative tasks, where the plausibility…
Context-Sensitive Inference Rule Discovery: A Graph-Based Method
Inference rule discovery aims to identify entailment relations between predicates, e.g., {`}X acquire Y {--}{\textgreater} X purchase Y{'} and {`}X is author of Y {--}{\textgreater} X write Y{'}. Traditional methods dis-…
Natural Language InferenceQuestion AnsweringCan predicate-argument relationships be extracted from UD trees?
In this paper we investigate the possibility of extracting predicate-argument relations from UD trees (and enhanced UD graphs). Con- cretely, we apply UD parsers on an En- glish question answering/semantic-role label- in…
Question AnsweringSemantic Role LabelingRDF2Rules: Learning Rules from RDF Knowledge Bases by Mining Frequent Predicate Cycles
Recently, several large-scale RDF knowledge bases have been built and applied in many knowledge-based applications. To further increase the number of facts in RDF knowledge bases, logic rules can be used to predict new f…
Tabular Foundation Models Can Learn Association Rules
Association Rule Mining (ARM) is a fundamental task for knowledge discovery in tabular data and is widely used in high-stakes decision-making. Classical ARM methods rely on frequent itemset mining, leading to rule explos…