Nearly-Tight and Oblivious Algorithms for Explainable Clustering.
Buddhima GamlathXinrui JiaAdam PolakOla SvenssonPublished in: NeurIPS (2021)
Keyphrases
- worst case
- computational complexity
- nearest neighbor
- recently developed
- data clustering
- upper bound
- computational cost
- orders of magnitude
- theoretical analysis
- computationally efficient
- data mining tasks
- feature space
- data structure
- clustering algorithm
- nonnegative matrix factorization
- clustering quality
- synthetic and real datasets
- clustering approaches
- agglomerative hierarchical clustering
- optimization problems
- combinatorial optimization
- machine learning algorithms
- high dimensional data
- neural network
- evolutionary algorithm
- lower bound
- objective function
- bayesian networks
- data mining