Key points are not available for this paper at this time.
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.
Lin et al. (Tue,) studied this question.