Tree-based Methods

Each leaf in the tree corresponds to a subregion of the d-dimensional space

Parent nodes correspond to union of subregions in children

Partitioned space containing data points:

[Diagram:pic/space]

Tree that induced above partitioning:

[Diagram:pic/tree]

Above has no overlap among subregions; some partitioning schemes permit overlap.

Above uses hyper-rectangles for partitioning; other shapes (e.g. spheres, convex polyhedra) have been used.

Detailed summary/comparison of tree methods can be found in [White & Jain] , [Kurniawati et al.]