An O(n log n) Algorithm for the All-nearest.Neighbors Problem.
Pravin M. VaidyaPublished in: Discret. Comput. Geom. (1989)
Keyphrases
- learning algorithm
- preprocessing
- computational cost
- optimal solution
- improved algorithm
- times faster
- theoretical analysis
- worst case
- nearest neighbor
- computational complexity
- experimental evaluation
- convergence rate
- k means
- linear programming
- recognition algorithm
- optimization algorithm
- computationally efficient
- dynamic programming
- high accuracy
- cost function
- np hard
- simulated annealing
- k nearest neighbor
- evolutionary algorithm
- support vector machine
- knn
- search algorithm