Skip to main content
. 2020 Nov 18;20(22):6612. doi: 10.3390/s20226612
Algorithm 1. Isolation tree construction.
Isolation tree:iTree(X,e,l)
Inputs:X- input data, e - current tree height, l - height limit
Output: an iTree
1:  if el or |X|1 then
2:   return exNode{Size|X|}
3:  else
4:   let Q be a list of attributes in X
5:   randomly select an attribute qQ
6:   randomly draw a split value p from max and min value of q
7:   Xlfilter(X,q<p)
8:   Xrfilter(X,qp)
9:   return inNode{LeftiTree(Xl,e+1,l)
10:          RightiTree(Xr,e+1,l)
11:          SplitAttq
12:          SplitValuep}
13:  end if