Record
- Authors
- Malkov, Y. A.; Yashunin, D. A.
- Year
- 2020
- Title
- Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
- Published in
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Volume
- 42 (4)
- Pages
- 824–836
- Type
- Journal article
- arXiv
- arXiv:1603.09320
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
malkov-2020-efficient-robust-approximate-nearest-neighbor-search
Cited on
- Hierarchical Navigable Small World Graphs read status: not stated
- Vector Search on Disk and with Filters read status: not stated
As cited
The pages cite this work in one form.
-
Malkov, Y. A., and Yashunin, D. A. (2020). Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 42(4), 824–836. arXiv:1603.09320.
BibLaTeX
@article{malkov-2020-efficient-robust-approximate-nearest-neighbor-search,
author = {Malkov, Y. A. and Yashunin, D. A.},
title = {{Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs}},
journaltitle = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
date = {2020},
volume = {42},
number = {4},
pages = {824--836},
eprint = {1603.09320},
eprinttype = {arxiv}
}