A unified framework for clustering constrained data without locality property

DOI10.1137/1.9781611973730.97MaRDI QIDQ5363012zbMATHOpenAlexFDO

Authors Hu Ding, Jinhui Xu

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A unified framework for clustering constrained data without locality property
• Improved PTAS for the constrained \(k\)-means problem
• Faster algorithms for the constrained \(k\)-means problem
• Faster algorithms for the constrained \(k\)-means problem
• Faster balanced clusterings in high dimension

Cited in

(13)

• Learning the truth vector in high dimensions
• Connected \(k\)-center and \(k\)-diameter clustering
• Faster balanced clusterings in high dimension
• Constrained clustering via diagrams: a unified theory and its application to electoral district design
• Improved PTAS for the constrained \(k\)-means problem
• An approximation algorithm for the uniform capacitated \(k\)-means problem
• Faster algorithms for the constrained \(k\)-means problem
• A unified framework of FPT approximation algorithms for clustering problems
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
• A unified framework for clustering constrained data without locality property
• Privacy preserving clustering with constraints
• On geometric prototype and applications
• FPT Approximation for Constrained Metric k-Median/Means

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)