Multi-criteria Similarity-based Anomaly Detection using Pareto Depth Analysis
Ko-Jen Hsiao, Kevin S. Xu, Jeff Calder, Alfred O. Hero III

TL;DR
This paper introduces a novel Pareto depth-based method for anomaly detection that effectively integrates multiple dissimilarity measures without needing multiple runs or weight tuning, outperforming traditional linear combination approaches.
Contribution
The paper proposes the Pareto depth analysis (PDA) algorithm, a new multi-criteria anomaly detection method leveraging Pareto optimality to improve detection accuracy.
Findings
PDA outperforms linear combination methods in experiments.
The approach is effective with synthetic and real datasets.
PDA avoids multiple runs with different weights.
Abstract
We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. Similarity-based anomaly detection algorithms detect abnormally large amounts of similarity or dissimilarity, e.g.~as measured by nearest neighbor Euclidean distances between a test sample and the training samples. In many application domains there may not exist a single dissimilarity measure that captures all possible anomalous patterns. In such cases, multiple dissimilarity measures can be defined, including non-metric measures, and one can test for anomalies by scalarizing using a non-negative linear combination of them. If the relative importance of the different dissimilarity measures are not known in advance, as in many anomaly detection applications, the anomaly detection algorithm may need to be executed multiple times with different choices of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
