A local search approximation algorithm for k-means clustering.
Tapas KanungoDavid M. MountNathan S. NetanyahuChristine D. PiatkoRuth SilvermanAngela Y. WuPublished in: SCG (2002)
Keyphrases
- np hard
- detection algorithm
- computational cost
- preprocessing
- experimental evaluation
- hooke jeeves
- convex hull
- high accuracy
- learning algorithm
- dynamic programming
- k means
- search space
- computational complexity
- approximation ratio
- particle swarm optimization algorithm
- data clustering
- optimal solution
- objective function
- times faster
- closed form
- convergence rate
- global search
- probabilistic model
- optimization algorithm
- theoretical analysis
- simulated annealing
- state space
- cost function
- association rules
- search algorithm
- data structure
- similarity measure