 From a mathematical point of view, recursive partitioning can be represented by a tree structure named "Isolation Tree", while the number of partitions required to isolate a point can be interpreted as the length of the path, within the tree, to reach a terminating node starting from the root.For example, the path length of point xi in Fig.2 is greater than the path length of xj in Fig.