An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem.
Christian SchwarzMichiel H. M. SmidPublished in: SODA (1992)
Keyphrases
- worst case
- log log
- detection algorithm
- high accuracy
- learning algorithm
- experimental evaluation
- improved algorithm
- np hard
- computational complexity
- search space
- k means
- cost function
- theoretical analysis
- optimal solution
- particle swarm optimization
- preprocessing
- similarity measure
- significant improvement
- computationally efficient
- search algorithm
- tree structure
- neural network
- matching algorithm
- times faster
- recognition algorithm
- clustering method
- objective function
- data points
- computational cost
- data sets
- pairwise
- training set