Random Forests and Adaptive Nearest Neighbors

Key Points

Key points are not available for this paper at this time.

Abstract

In this paper we study random forests through their connection with a new framework of adaptive nearest neighbor methods. We first introduce a concept of potential nearest neighbors (k-PNNs) and show that random forests can be seen as adaptively weighted k-PNN methods.

Bookmark

Cite This Study

Lin et al. (Tue,) studied this question.

synapsesocial.com/papers/69da8d03387cf70698686f41 https://doi.org/https://doi.org/10.1198/016214505000001230

Bookmark