A Constant Approximation Algorithm for Sequential No-Substitution k-Median Clustering under a Random Arrival Order.
Tom HessMichal MoshkovitzSivan SabatoPublished in: CoRR (2021)
Keyphrases
- k means
- dynamic programming
- clustering method
- detection algorithm
- cost function
- optimization algorithm
- experimental evaluation
- learning algorithm
- theoretical analysis
- expectation maximization
- worst case
- search space
- computational complexity
- closed form
- randomly generated
- approximation ratio
- clustering analysis
- randomized algorithm
- clustering algorithm
- computational cost
- evolutionary algorithm
- optimal solution
- segmentation algorithm
- probabilistic model
- matching algorithm
- significant improvement
- error bounds
- hierarchical clustering
- convergence rate
- nonnegative matrix factorization
- clustering quality
- preprocessing
- objective function
- polynomial time approximation