Hashing For Structure-based Anomaly Detection | Awesome Learning to Hash Add your paper to Learning2Hash

Hashing For Structure-based Anomaly Detection

Filippo Leveni, Luca Magri, Cesare Alippi, Giacomo Boracchi . Lecture Notes in Computer Science 2025 – 0 citations

[Code] [Paper]   Search on Google Scholar   Search on Semantic Scholar
Efficiency Evaluation Hashing Methods Locality-Sensitive-Hashing Tree Based ANN

We focus on the problem of identifying samples in a set that do not conform to structured patterns represented by low-dimensional manifolds. An effective way to solve this problem is to embed data in a high dimensional space, called Preference Space, where anomalies can be identified as the most isolated points. In this work, we employ Locality Sensitive Hashing to avoid explicit computation of distances in high dimensions and thus improve Anomaly Detection efficiency. Specifically, we present an isolation-based anomaly detection technique designed to work in the Preference Space which achieves state-of-the-art performance at a lower computational cost. Code is publicly available at https://github.com/ineveLoppiliF/Hashing-for-Structure-based-Anomaly-Detection.

Similar Work