Monotonic anomaly detection

Oliver Urs Lenz, Matthijs van Leeuwen
10/30/2024
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Semi-supervised anomaly detection is based on the principle that potential anomalies are those records that look different from normal training data. However, in some cases we are specifically interested in anomalies that correspond to high attribute values (or low, but not both). We present two asymmetrical distance measures that take this monotonicity into account: ramp distance and signed distance. Through experiments on synthetic and real-life datasets, we show that ramp distance increases anomaly detection performance over the traditional absolute distance. While signed distance also performs well on synthetic data, it performs substantially poorer on real-life datasets. We argue that this is a consequence of the fact that when using signed distance, low values of certain attributes automatically compensate for high values of other attributes, such that anomaly detection is reduced to counting the total attribute value sum, which is too simplistic in practice.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lenz2024monotonic,
  title  = {Monotonic anomaly detection},
  author = {Oliver Urs Lenz and Matthijs van Leeuwen},
  year   = {2024},
  eprint = {2410.23158},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.23158v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.23158.svg)](https://codeofpaper.com/paper/2410.23158)

Discussion