Proceedings

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1312-1316.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-222

Abstract

We introduce a new nearest neighbor search al-gorithm. The algorithm builds a nearest neighborgraph in an offline phase and when queried witha new point, performs hill-climbing starting froma randomly sampled node of the graph. We pro-vide theoretical guarantees for the accuracy and thecomputational complexity and empirically showthe effectiveness of this algorithm.

Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang. 2011. Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1312–1316. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-222
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards