Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement

Nico Hezel, Kai Uwe Barthel, Konstantin Schall +1

For approximate nearest neighbor search, graph-based algorithms have shown to offer the best trade-off between accuracy and search time. We propose the Dynamic Exploration Graph (D…