A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering.
Tom HessMichal MoshkovitzSivan SabatoPublished in: NeurIPS (2021)
Keyphrases
- k means
- clustering method
- synthetic and real datasets
- experimental evaluation
- dynamic programming
- randomly generated
- preprocessing
- probabilistic model
- convergence rate
- np hard
- error bounds
- linear programming
- synthetic datasets
- clustering analysis
- hierarchical clustering
- matching algorithm
- clustering algorithm
- optimization algorithm
- segmentation algorithm
- expectation maximization
- worst case
- computational cost
- cost function
- significant improvement
- computational complexity
- optimal solution
- learning algorithm
- closed form
- weighted distance
- polynomial time approximation