Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70's. This algorithm uses a tree that is traversed on search time and uses some elimination rules to avoid the full exploration of the tree. This paper proposes two main contributions: two new ways for constructing the tree and two new elimination rules. As shown in the experiment section, both techniques reduce significantly the number of distance computations.
展开▼
