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
CITATION STYLE
Nie, M., Wang, Z. J., Gan, C., Quan, Z., Yao, B., & Yin, J. (2019). An improved hierarchical datastructure for nearest neighbor search. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 10001–10002). AAAI Press. https://doi.org/10.1609/aaai.v33i01.330110001
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
