k-Tree: Crossing sharp boundaries in regression trees to find neighbors

Abstract

<p>Traditional classification and regression trees (CARTs) utilize a top-down, greedy approach to split the feature space into sharply defined, axis-aligned sub-regions (leaves). Each leaf treats all of the samples therein uniformly during the prediction process, leading to a constant predictor. Although this approach is well known for its interpretability and efficiency, it overlooks the complex local distributions within and across leaves. As the number of features increases, this limitation becomes more pronounced, often resulting in a concentration of samples near the boundaries of the leaves. Such clustering suggests that there is potential in identifying closer neighbors in adjacent leaves, a phenomenon that is unexplored in the literature. Our study addresses this gap by introducing the -Tree methodology, a novel method that extends the search for nearest neighbors beyond a single leaf to include adjacent leaves. This approach has two key innovations: (1) establishing an adjacency relationship between leaves across the tree space and (2) designing novel intra-leaf and inter-leaf distance metrics through an optimization lens, which are tailored to local data distributions within the tree. We explore three implementations of the -Tree methodology: (1) the Post-hoc -Tree (P-Tree), which integrates the -Tree methodology into constructed decision trees, (2) the Advanced -Tree, which seamlessly incorporates the -Tree methodology during the tree construction process, and (3) the P-random forest, which integrates the P-Tree principles with the random forest framework. The results of empirical evaluations conducted on a variety of real-world and synthetic datasets demonstrate that the -Tree methods have greater prediction accuracy over the traditional models. These results highlight the potential of the -Tree methodology in enhancing predictive analytics by providing a deeper insight into the relationships between samples within the tree space.<br></p>