approximate nearest neighbor search
Approximate nearest neighbor search is a technique used to efficiently find approximate closest matches to a given query point or item within a large dataset, without necessarily guaranteeing an exact match. It aims to provide a close approximation to the nearest neighbor in a computationally efficient manner, especially when the dataset is too large to perform an exhaustive search.
Requires login.
Related Concepts (1)
Similar Concepts
- approximate bayesian computation
- approximate index
- clustering algorithms
- clustering techniques
- collaborative filtering algorithms
- deterministic approximation
- k-nearest neighbors
- nearest neighbor search
- neural network-based recommender systems
- proximity
- search algorithm
- search algorithms
- similarity search
- stochastic approximation
- von neumann neighborhood