Isolation Forest
Isolation Forest (Anomaly Detection via Random Partitioning) · Also known as: Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+24 more
When to use it
Use Isolation Forest to detect anomalies or outliers in continuous, possibly high-dimensional, cross-sectional or time-series data with at least about 50 observations, especially when you have no labelled anomalies to learn from. It needs no labelled anomaly data and scales well as the number of features grows; you supply a contamination parameter expressing the expected anomaly rate. With fewer than about 50 observations the boundary between normal and anomalous points becomes unreliable and statistical outlier methods or PCA are safer.
Strengths & limitations
- Unsupervised: requires no labelled anomaly data to flag outliers.
- Scales well to high-dimensional data.
- Isolates anomalies directly rather than modelling the whole normal distribution, which keeps it efficient.
- A single contamination parameter expresses the expected anomaly rate and sets the flagging threshold.
- On small samples (n below about 50) the boundary between normal and anomalous points is unclear and the false-positive rate is high.
- Without enough genuine anomalies the contamination parameter becomes meaningless, and statistical outlier methods are preferable.
- It returns anomaly scores rather than interpretable coefficients or explicit rules.
- Results depend on the chosen contamination value, which must be set from domain knowledge.
Frequently asked
Do I need labelled anomalies to use Isolation Forest?
No. It is an unsupervised method that isolates anomalies through random partitioning, so it needs no labelled anomaly data to operate.
What does the contamination parameter do?
It expresses the expected proportion of anomalies in the data and sets the threshold that decides which points are finally flagged as outliers. Without enough genuine anomalies in the data, this parameter becomes meaningless.
Why does it struggle on small samples?
With fewer than about 50 observations the boundary between normal and anomalous points is unclear and the false-positive rate is high. In that case statistical outlier methods or PCA are safer alternatives.
How are anomalies scored?
Each point's average path length across the random trees — how many splits it took to isolate — is turned into an anomaly score. Short average paths indicate likely anomalies; long paths indicate likely normal points.
Sources
- Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI: 10.1109/ICDM.2008.17 ↗
How to cite this page
ScholarGate. (2026, June 1). Isolation Forest (Anomaly Detection via Random Partitioning). ScholarGate. https://scholargate.app/en/machine-learning/isolation-forest
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Decision TreeMachine learning↔ compare
- Gaussian Mixture ModelMachine learning↔ compare
- Principal Component AnalysisMachine learning↔ compare
- Random ForestMachine learning↔ compare
- t-SNEMachine learning↔ compare