Clustering with diversity

DOI10.1007/978-3-642-14165-2_17MaRDI QIDQ3587379zbMATH OpenOpenAlexFDO

Authors Jian Li, Ke Yi, Qin Zhang

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14165-2_17

zbMATH Keywords

\(k\)-anonymity\(k\)-center\(l\)-diversityapproximation algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Privacy preserving clustering with constraints
• On the complexity of the l-diversity problem
• Achieving anonymity via clustering
• Fair colorful k-center clustering
• Clustering to minimize the maximum intercluster distance

Cited in

(11)

• Bregman divergences in the (m k)-partitioning problem
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
• A unified framework for clustering constrained data without locality property
• Improved PTAS for the constrained \(k\)-means problem
• Tight FPT approximation for constrained k-center and k-supplier
• The l-diversity problem: tractability and approximability
• Privacy preserving clustering with constraints
• Fair colorful k-center clustering
• On the cost of essentially fair clusterings
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Connected k-center and k-diameter clustering

This page was built for publication: Clustering with diversity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587379)