Sign in

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search

By Kejing Lu and others
Approximate nearest neighbor search (ANNS) in high-dimensional spaces is a pivotal challenge in the field of machine learning. In recent years, graph-based methods have emerged as the superior approach to ANNS, establishing a new state of the art. Although various optimizations for graph-based ANNS have been introduced, they predominantly rely... Show more
July 10, 2024
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
Click on play to start listening