On the Lower Bound of Local Optimums in K-Means Algorithm.
Zhenjie ZhangBing Tian DaiAnthony K. H. TungPublished in: ICDM (2006)
Keyphrases
- k means
- clustering method
- lower bound
- experimental evaluation
- optimal solution
- np hard
- theoretical analysis
- cost function
- dynamic programming
- computational cost
- matching algorithm
- times faster
- optimization algorithm
- expectation maximization
- simulated annealing
- high accuracy
- recognition algorithm
- search space
- computational complexity
- objective function
- learning algorithm
- hierarchical clustering
- randomized algorithm
- cluster analysis
- clustering algorithm
- detection algorithm
- significant improvement
- preprocessing
- segmentation algorithm
- spectral clustering
- scheduling problem