资源分类
》 资源 》论文》Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

2019-11-12 | |  79 |   39 |   0
Abstract We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an of?ine phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.

上一篇：Extracting Temporal Patterns from Interval-Based Sequences

下一篇：Gaussianity Measures for Detecting the Direction of Causal Time Series

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...