most citedEfficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

187 citations · 187 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2016★ 187 cited

Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

Yu. A. Malkov, D. A. Yashunin

We present a new approach for the approximate K-nearest neighbor search based on navigable small world graphs with controllable hierarchy (Hierarchical NSW, HNSW). The proposed sol…