Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem.
Yousef M. AlhamdanAlexander V. KononovPublished in: CSR (2019)
Keyphrases
- approximation algorithms
- clustering method
- self organizing maps
- clustering algorithm
- k means
- hierarchical clustering
- categorical data
- edge detection
- document clustering
- data clustering
- graph theoretic
- unsupervised learning
- outlier detection
- unsupervised clustering
- dissimilarity measure
- worst case
- high dimensional
- lower bound