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

44 code implementations • 30 Mar 2016 • 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).