Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
Hajebi, Kiana (University of Alberta) | Abbasi-Yadkori, Yasin (University of Alberta) | Shahbazi, Hossein (University of Alberta) | Zhang, Hong (University of Alberta)
There are a number of papers that use hill-climbing or k-We introduce a new nearest neighbor search algorithm. NN graphs for nearest neighbor search, but to the best of our The algorithm builds a nearest neighbor knowledge, using hill-climbing on k-NN graphs is a new idea.
Jul-19-2011