Efficient k-nearest neighbor graph construction for generic similarity measures

Abstract

K-Nearest Neighbor Graph (K-NNG) construction is an important operation with many web related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Existing methods for K-NNG construction either do not scale, or are specific to certain similarity measures. We present NN-Descent, a simple yet… (More)
DOI: 10.1145/1963405.1963487

13 Figures and Tables

Topics

Statistics

020402009201020112012201320142015201620172018
Citations per Year

166 Citations

Semantic Scholar estimates that this publication has 166 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics