An Improved Hierarchical Datastructure for Nearest Neighbor Search
Abstract
Nearest neighbor search is a fundamental computational tool and has wide applications. In past decades, many datastructures have been developed to speed up this operation. In this paper, we propose a novel hierarchical datastructure for nearest neighbor search in moderately high dimension. Our proposed method maintains good run time guarantees, and it outperforms several state-of-the-art methods in practice.
Cite
Text
Nie et al. "An Improved Hierarchical Datastructure for Nearest Neighbor Search." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.330110001Markdown
[Nie et al. "An Improved Hierarchical Datastructure for Nearest Neighbor Search." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/nie2019aaai-improved/) doi:10.1609/AAAI.V33I01.330110001BibTeX
@inproceedings{nie2019aaai-improved,
title = {{An Improved Hierarchical Datastructure for Nearest Neighbor Search}},
author = {Nie, Mengdie and Wang, Zhi-Jie and Gan, Chunjing and Quan, Zhe and Yao, Bin and Yin, Jian},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {10001-10002},
doi = {10.1609/AAAI.V33I01.330110001},
url = {https://mlanthology.org/aaai/2019/nie2019aaai-improved/}
}