Nearly-Tight and Oblivious Algorithms for Explainable Clustering.
Buddhima GamlathXinrui JiaAdam PolakOla SvenssonPublished in: CoRR (2021)
Keyphrases
- worst case
- optimization problems
- computational complexity
- data clustering
- orders of magnitude
- data structure
- graph theoretic
- theoretical analysis
- lower bound
- synthetic and real datasets
- learning algorithm
- cluster analysis
- times faster
- information theoretic
- machine learning algorithms
- generalization error bounds
- self organizing maps
- benchmark datasets
- computationally efficient
- computational cost
- pairwise
- clustering algorithm