A Simple, Efficient, Parallelizable Algorithm for Approximated Nearest Neighbors.
Sebastián FerradaBenjamin BustosNora ReyesPublished in: AMW (2018)
Keyphrases
- computationally efficient
- nearest neighbor
- k means
- np hard
- high efficiency
- detection algorithm
- experimental evaluation
- learning algorithm
- times faster
- optimization algorithm
- dynamic programming
- significant improvement
- search space
- similarity measure
- preprocessing
- computational cost
- data points
- computational complexity
- worst case
- optimal solution
- pruning strategy
- high accuracy
- simulated annealing
- search algorithm
- objective function
- convergence rate
- data sets