Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions

2009

23 citations recorded by the source corpus.

Citations in the corpus

• Maximum inner-product search using cone trees (2012, neutral): “Trees have been widely used for nearest-neighbor search [13, 4, 29, 8, 32].”
• Learning to Prune in Metric and Non-Metric Spaces (2013, unknown): “This observation about the LSH is in line with previous findings [26].”
• Efficient retrieval of recommendations in a matrix factorization framework (2012, unknown): “For example, the system can approximate the retrieval task to obtain any K -recommendations from among the best τ -recommendations where K < τ (similar to the approximation of the nearest-neighbor search problem in [18]).”
• Fast Exact Max-Kernel Search (2012, unknown): “These hierarchical indexing schemes lend easily to intuitive branch-and-bound algorithms for efficient solutions (especially approximate solutions [18, 19]).”