Isolation forest

On this page 7

Isolation forest is an unsupervised anomaly detection algorithm that scores each observation by how easily it can be separated from the rest of the data with random axis-parallel splits. In machine learning, it belongs to the family of tree ensembles, yet it inverts the usual goal: instead of modeling what normal data looks like, it measures how quickly a point becomes isolated, on the premise that anomalies are few and different and therefore end up alone after only a handful of cuts.

The method was introduced in 2008 by Fei Tony Liu, Kai Ming Ting and Zhi-Hua Zhou and has become a default baseline for tabular outlier detection because it runs in near-linear time, needs no distance metric and no labels, and copes reasonably well with high-dimensional data.

How isolation forest separates anomalies

An isolation forest works by building many isolation trees (iTrees) on small random subsamples and recording the path length each point needs to reach a leaf. To grow one tree, the algorithm picks a random feature, then a random split value between that feature’s minimum and maximum in the current node, and repeats recursively until every point is alone or a depth limit is reached.

Because the cuts are random, a point that sits in a sparse region is usually cut off early, while a point inside a dense cluster needs many cuts before it is separated. Averaging the path length over hundreds of trees removes most of the randomness and leaves a stable signal: short average paths indicate anomalies, long paths indicate normal observations.

The raw path length is normalized into an anomaly score between 0 and 1 using the expected path length of an unsuccessful search in a binary search tree, written c(n). The score is s(x, n) = 2^(-E(h(x)) / c(n)), where E(h(x)) is the average path length of point x across the forest. The following table shows how the score is usually read.

Score rangeAverage path lengthUsual interpretation
Close to 1Much shorter than c(n)Strong anomaly candidate
Around 0.5Close to c(n)No distinct anomaly signal
Well below 0.5Longer than c(n)Typical, normal observation
Interpreting the isolation forest anomaly score

Key parameters of an isolation forest

Isolation forest has few hyperparameters, and their defaults work surprisingly well, which is a large part of its popularity. The most influential setting is the subsample size, because isolation depends on sparsity, and large samples crowd anomalies with normal points, an effect known as swamping and masking.

ParameterTypical valueWhat it controls
Number of trees100 to 300Stability of the averaged score
Subsample size256 pointsIsolation contrast and training cost
Maximum tree depthAbout log2 of subsample sizeEarly stop for normal points
ContaminationExpected outlier share, for example 0.01Threshold that turns scores into labels
Max featuresAll features by defaultDiversity of trees in wide data
Main hyperparameters and their effect

The depth limit of roughly log2(256) = 8 levels is deliberate: anomalies are isolated well before that depth, so growing deeper trees only adds cost without improving separation. The contamination parameter does not change the scores at all; it only sets the decision threshold, so a wrong guess shifts how many points are labeled anomalous but leaves the ranking intact.

How isolation forest compares with other detectors

Isolation forest differs from most outlier detectors because it never computes distances or densities. That gives it a clear speed advantage on large tabular data, but it also means it sees the data only through axis-aligned cuts, which shapes what it can and cannot detect.

MethodCore ideaStrengthWeakness
Isolation forestShort random isolation pathsFast, scalable, few settingsMisses local anomalies inside clusters
Local outlier factorDensity relative to neighborsFinds local anomaliesQuadratic cost, needs a distance metric
One-class SVMBoundary around normal dataFlexible kernelsSensitive to scaling and kernel choice
AutoencoderHigh reconstruction errorHandles images and sequencesNeeds tuning and more training data
DBSCAN noise pointsPoints outside dense clustersCombines clustering and detectionDepends on the epsilon radius
Isolation forest versus common anomaly detection methods

Compared with a random forest, the similarity is mostly structural: both are ensembles of trees grown on random subsets, but a random forest chooses splits that reduce Gini impurity or another supervised criterion, while an isolation forest chooses completely random splits and uses no target variable.

Using isolation forest in practice

Isolation forest fits best when the data is tabular, mostly numeric and largely unlabeled, and anomalies are expected to be rare global deviations. Typical applications include fraud screening, sensor and infrastructure monitoring, network intrusion triage and cleaning training data before another model is fitted.

SituationRecommended approachReason
Large table, no labelsUse isolation forest as a baselineLinear cost and robust defaults
Anomalies hidden in local clustersCombine with local outlier factorGlobal isolation misses local deviations
Many categorical columnsEncode carefully or use another methodRandom cuts on codes are not meaningful
Some confirmed labels availableValidate the threshold on labelsContamination guesses are often wrong
Data distribution shifts over timeRetrain on a rolling windowOld trees describe old normality
Decision guide for applying isolation forest

A practical workflow is to fit the forest on recent data, rank observations by score, and route only the top fraction to human review. Because no labels exist, quality should be measured on a small manually verified sample, using precision at the top of the ranking rather than overall accuracy, which is misleading under class imbalance.

Limitations and common mistakes

The main weakness of the standard algorithm is the axis-parallel bias: because every cut is perpendicular to one feature axis, the score map contains artificial rectangular artifacts, and anomalies that differ only in a combination of features can look normal. The Extended Isolation Forest variant addresses this with random hyperplane cuts.

  • Irrelevant features dilute the signal, because random cuts on noise columns waste tree depth; feature selection often helps more than extra trees.
  • Large subsamples reduce contrast, so raising the subsample size to the full dataset frequently makes results worse, not better.
  • Duplicate or discrete values create many ties, which can make common values look isolated or hide rare ones.
  • Scores are relative to the training data, so a score from one model is not comparable with a score from another model trained on a different period.
  • Explanations need extra work; feature-level attributions such as SHAP values or path statistics are required to tell analysts why a point was flagged.

Explained without jargon

Imagine a crowded room. You draw random lines on the floor to fence people off one by one. Someone alone in a corner is fenced off after one or two lines. A person in the middle of a group needs many lines. Isolation forest plays this game with data, many times over, and remembers how quickly each record ended up alone.

Records that are separated very quickly are unusual, so the method marks them as possible anomalies. It does not need examples of fraud or faults in advance. That makes it a practical first tool for spotting the odd one out in large tables of numbers.

A typical use case

A payments team at a mid-sized online retailer processes about two million card transactions per month and has only a few hundred confirmed fraud cases. The analysts build features such as order value, distance between billing and shipping addresses, account age in days and the number of orders in the past hour, then train an isolation forest with 200 trees and a subsample of 256 on the last thirty days of data.

Each new transaction receives a score in milliseconds, and the top 0.5 percent goes to a manual review queue. After two weeks, reviewers confirm that roughly one flagged order in eight is fraudulent, far above the base rate of about one in a thousand. The team then retrains the forest weekly and adds a supervised gradient boosting model once enough confirmed labels have accumulated, keeping the isolation forest as an early warning layer for new fraud patterns.