Online Isolation Forest

Filippo Leveni, Guilherme Weigert Cassales, Bernhard Pfahringer, Albert Bifet, Giacomo Boracchi
5/14/2025
cs.LGcs.AIstat.ML

No official code found. Best implementation: ineveLoppiliF/Online-Isolation-Forest (16 stars, MIT, last commit 2025-01-16).

Abstract

The anomaly detection literature is abundant with offline methods, which require repeated access to data in memory, and impose impractical assumptions when applied to a streaming context. Existing online anomaly detection methods also generally fail to address these constraints, resorting to periodic retraining to adapt to the online context. We propose Online-iForest, a novel method explicitly designed for streaming conditions that seamlessly tracks the data generating process as it evolves over time. Experimental validation on real-world datasets demonstrated that Online-iForest is on par with online alternatives and closely rivals state-of-the-art offline anomaly detection techniques that undergo periodic retraining. Notably, Online-iForest consistently outperforms all competitors in terms of efficiency, making it a promising solution in applications where fast identification of anomalies is of primary importance such as cybersecurity, fraud and fault detection.

View on arXivView PDF

Code Implementations(1)

MIT
164PythonMay 21, 20241 years agoMIT

Similar Papers

Cite this paper

@article{leveni2025online,
  title  = {Online Isolation Forest},
  author = {Filippo Leveni and Guilherme Weigert Cassales and Bernhard Pfahringer and Albert Bifet and Giacomo Boracchi},
  year   = {2025},
  eprint = {2505.09593},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.09593v1},
  journal = {ICML 2025 2025}
}

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

Discussion