Isolation Forest in Novelty Detection Scenario
Adam Ulrich, Jan Kr\v{n}\'avek, Roman \v{S}enke\v{r}\'ik, Zuzana Kom\'inkov\'a Oplatkov\'a, Radek Vala

TL;DR
This paper adapts the Half-Space Tree algorithm for novelty detection, providing a theoretical foundation and demonstrating its effectiveness in identifying unseen patterns in streaming data.
Contribution
It introduces a novel theoretical modification to the HST algorithm tailored for novelty detection, with analytical validation of its effectiveness.
Findings
Modified HST isolates novelties more effectively than original
Analytical results support the structural adaptation for novelty detection
HST can serve as an interpretable and efficient novelty detector
Abstract
Data mining offers a diverse toolbox for extracting meaningful structures from complex datasets, with anomaly detection emerging as a critical subfield particularly in the context of streaming or real-time data. Within anomaly detection, novelty detection focuses on identifying previously unseen patterns after training solely on regular data. While classic algorithms such as One-Class SVM or Local Outlier Factor (LOF) have been widely applied, they often lack interpretability and scalability. In this work, we explore the Half-Space Tree (HST) algorithm, originally proposed for streaming anomaly detection, and propose a novel theoretical modification to adapt it specifically for novelty detection tasks. Our approach is grounded in the idea that anomalies i.e., novelties tend to appear in the higher leaves of the tree, which are less frequently visited by regular instances. We…
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.
Taxonomy
MethodsSupport Vector Machine
