A local search approximation algorithm for k-means clustering.
Tapas KanungoDavid M. MountNathan S. NetanyahuChristine D. PiatkoRuth SilvermanAngela Y. WuPublished in: Comput. Geom. (2004)
Keyphrases
- search space
- cost function
- computational complexity
- preprocessing
- k means
- np hard
- times faster
- experimental evaluation
- optimization algorithm
- optimal solution
- worst case
- objective function
- global search
- approximation algorithms
- combinatorial optimization
- expectation maximization
- learning algorithm
- error tolerance
- detection algorithm
- recognition algorithm
- dynamic programming
- linear programming
- error bounds
- significant improvement
- multimodal function optimization
- explore the search space
- approximation ratio
- search algorithm
- data clustering
- closed form
- matching algorithm
- monte carlo
- probabilistic model
- theoretical analysis
- simulated annealing
- input data