A computational study of several relocation methods for k-means algorithms.
Agostino TarsitanoPublished in: Pattern Recognit. (2003)
Keyphrases
- computational cost
- significant improvement
- complexity analysis
- computationally expensive
- benchmark datasets
- empirical studies
- methods outperform
- methods require
- problems in computer vision
- k means
- machine learning algorithms
- computationally demanding
- statistical methods
- data mining techniques
- heuristic methods
- high computational complexity
- computationally intensive
- computer vision algorithms
- optimization methods
- machine learning methods
- qualitative and quantitative
- theoretical analysis
- computational complexity
- hierarchical clustering
- spectral clustering
- neural network
- evaluation metrics
- np hard
- preprocessing
- data structure
- objective function
- decision trees
- learning algorithm
- machine learning