Approximate nearest neighbor algorithm based on navigable small world graphs

作者：

Highlights：

• Novel approximate k-nearest neighbor problem structure is presented.

• The structure is based on a navigable small world graph.

• The structure has weak dimensionality dependence.

• The structure has shown superior performance in simulations.

摘要

•Novel approximate k-nearest neighbor problem structure is presented.•The structure is based on a navigable small world graph.•The structure has weak dimensionality dependence.•The structure has shown superior performance in simulations.

论文关键词：Similarity search,k-Nearest neighbor,Approximate nearest neighbor,Navigable small world,Distributed data structure

论文评审过程：Available online 4 November 2013.

论文官网地址：https://doi.org/10.1016/j.is.2013.10.006