Fast Algorithm for Approximate k-Nearest Neighbor Graph Construction

Abstract

The k-Nearest Neighbor (k-NN) graphs are widely used in data mining and machine learning. How to construct a high quality k-NN graph for generic similarity measures efficiently is crucial for many applications. In this paper, we propose a new approach to effectively and efficiently construct an approximate k-NN graph. Our framework is as follows: (1… (More)
DOI: 10.1109/ICDMW.2013.50

Topics

9 Figures and Tables

Slides referencing similar topics