The Computational Complexity Of Partitioning

Isolation Forest - nju.edu.cn

linear time complexity with a low constant and a low mem-ory requirement. Our empirical evaluation shows that iFor- ... and small data size because of their high computational complexity. ... In a data-induced random tree, partitioning of instances are repeated recursively until all instances are iso-lated. This random partitioning produces ...

  Computational, Isolation, Forest, Partitioning, Complexity, Computational complexity, Isolation forest