An Improved Hierarchical Datastructure for Nearest Neighbor Search
DOI:
https://doi.org/10.1609/aaai.v33i01.330110001Abstract
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.
Downloads
Published
2019-07-17
How to Cite
Nie, M., Wang, Z.-J., Gan, C., Quan, Z., Yao, B., & Yin, J. (2019). An Improved Hierarchical Datastructure for Nearest Neighbor Search. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 10001-10002. https://doi.org/10.1609/aaai.v33i01.330110001
Issue
Section
Student Abstract Track