Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means.
Anna ArutyunovaMelanie SchmidtPublished in: STACS (2021)
Keyphrases
- lower bound
- k means
- lower and upper bounds
- upper bound
- constrained clustering
- branch and bound
- optimal solution
- lower bounding
- semi supervised clustering
- branch and bound algorithm
- cluster analysis
- constraint satisfaction
- self organizing maps
- worst case
- np hard
- hierarchical clustering
- privacy protection
- unsupervised clustering
- special case
- pairwise
- objective function