PIF: Anomaly detection via preference embedding

Filippo Leveni, Luca Magri, Giacomo Boracchi, Cesare Alippi
5/15/2025
cs.LGcs.AIcs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We address the problem of detecting anomalies with respect to structured patterns. To this end, we conceive a novel anomaly detection method called PIF, that combines the advantages of adaptive isolation methods with the flexibility of preference embedding. Specifically, we propose to embed the data in a high dimensional space where an efficient tree-based method, PI-Forest, is employed to compute an anomaly score. Experiments on synthetic and real datasets demonstrate that PIF favorably compares with state-of-the-art anomaly detection techniques, and confirm that PI-Forest is better at measuring arbitrary distances and isolate points in the preference space.

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. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{leveni2025pif,
  title  = {PIF: Anomaly detection via preference embedding},
  author = {Filippo Leveni and Luca Magri and Giacomo Boracchi and Cesare Alippi},
  year   = {2025},
  eprint = {2505.10441},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.10441v1}
}

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/2505.10441.svg)](https://codeofpaper.com/paper/2505.10441)

Discussion