A unified framework for clustering constrained data without locality property
DOI10.1137/1.9781611973730.97zbMATH Open1371.68291OpenAlexW2596841574MaRDI QIDQ5363012FDOQ5363012
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.97
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (13)
- A unified framework for clustering constrained data without locality property
- A unified framework of FPT approximation algorithms for clustering problems
- Faster balanced clusterings in high dimension
- Faster algorithms for the constrained \(k\)-means problem
- FPT Approximation for Constrained Metric k-Median/Means
- Connected \(k\)-center and \(k\)-diameter clustering
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Improved PTAS for the constrained \(k\)-means problem
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- On geometric prototype and applications
- Learning the truth vector in high dimensions
- An approximation algorithm for the uniform capacitated \(k\)-means problem
- Privacy preserving clustering with constraints
This page was built for publication: A unified framework for clustering constrained data without locality property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363012)
