Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
The HNSW paper describing graph-based approximate nearest-neighbor search.
arXiv30 March 2016Public source
Read the paper
In this reference
The HNSW paper describing graph-based approximate nearest-neighbor search.
Cite the original work
Yu. A. Malkov & D. A. Yashunin (30 March 2016). Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs [Research paper]. arXiv. https://arxiv.org/abs/1603.09320
View BibTeX
@misc{efficient_and_robust_approximate_nearest_neighbor_search_using_hierarchical_navigable,
author = {Yu. A. Malkov and D. A. Yashunin},
title = {{Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs}},
howpublished = {arXiv},
url = {https://arxiv.org/abs/1603.09320},
year = {2016}
}
