Learning To Index For Nearest Neighbor Search

Abstract

In this study, we present a novel ranking model based on learning neighborhood relationships embedded in the index space. Given a query point, conventional approximate nearest neighbor search calculates the distances to the cluster centroids, before ranking the clusters from near to far based on the distances. The data indexed in the top-ranked clusters are retrieved and treated as the nearest neighbor candidates for the query. However, the loss of quantization between the data and cluster centroids will inevitably harm the search accuracy. To address this problem, the proposed model ranks clusters based on their nearest neighbor probabilities rather than the query-centroid distances. The nearest neighbor probabilities are estimated by employing neural networks to characterize the neighborhood relationships, i.e., the density function of nearest neighbors with respect to the query. The proposed probability-based ranking can replace the conventional distance-based ranking for finding ca

Stats

• citations23
• S2 citations—
• github stars0
• HF likes0
• heat score10.35
• arxiv keychiu2018learning

Related papers

• A Learning-to-rank Formulation Of Clustering-based Approximate Nearest Neighbor Search (2024)4.52
• A Scalable Solution To The Nearest Neighbor Search Problem Through Local-search Methods On Neighbor Graphs (2017)3.58
• Associative Memories To Accelerate Approximate Nearest Neighbor Search (2016)6.34
• A Multilabel Classification Framework For Approximate Nearest Neighbor Search (2019)0.00
• Towards Non-parametric Learning To Rank (2018)0.00
• Lorann: Low-rank Matrix Factorization For Approximate Nearest Neighbor Search (2024)2.26
• Learning Nearest Neighbor Graphs From Noisy Distance Samples (2019)0.00
• A Survey On Learning To Hash (2016)21.62