Dependent randomized rounding for clustering and partition systems with knapsack constraints.
David G. HarrisThomas W. PensylAravind SrinivasanKhoa TrinhPublished in: J. Mach. Learn. Res. (2022)
Keyphrases
- management system
- clustering algorithm
- dynamic programming
- knapsack problem
- clustering method
- feasible solution
- information systems
- mixed integer
- global constraints
- k means
- constraint satisfaction
- computer systems
- neural network
- complex systems
- geometric constraints
- approximation algorithms
- unsupervised learning
- instance level constraints
- hierarchical clustering
- distance metric
- linear programming
- distributed systems
- optimal solution
- image segmentation
- information retrieval