Achieving anonymity via clustering

DOI10.1145/1798596.1798602zbMath1300.68023OpenAlexW2069845605MaRDI QIDQ2930330

Rina Panigrahy, Gagan Aggarwal, Samir Khuller, Dilys Thomas, An Zhu, Krishnaram Kenthapadi, Tomás Feder

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.8529

zbMATH Keywords

clusteringprivacyapproximation algorithmsanonymity

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Approximation algorithms (68W25)

Related Items

Parameterized complexity of categorical clustering with size constraints, Towards the evaluation of time series protection methods, Matroid and knapsack center problems, Attribute association based privacy preservation for multi trust level environment, On r-Gatherings on the Line, Parameterized complexity of \(k\)-anonymity: hardness and tractability, A linear time algorithm for the \(r\)-gathering problem on the line, r-Gatherings on a star and uncertain r-gatherings on a line, Improved PTAS for the constrained \(k\)-means problem, On min-max \(r\)-gatherings, Unnamed Item, Unnamed Item, The effect of homogeneity on the computational complexity of combinatorial data anonymization, Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier, On the cost of essentially fair clusterings, Parameterized Complexity of k-Anonymity: Hardness and Tractability, Parameterized complexity of categorical clustering with size constraints, \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes, FPT Approximation for Constrained Metric k-Median/Means, Faster balanced clusterings in high dimension, Anonymizing binary and small tables is hard to approximate, Approximation algorithms for the lower-bounded \(k\)-median and its generalizations, On Min-Max r-Gatherings, Clustering with lower-bounded sizes. A general graph-theoretic framework, A unified framework for clustering constrained data without locality property, Generalized Center Problems with Outliers, The Effect of Homogeneity on the Complexity of k-Anonymity, A Simple Algorithm for $r$-gatherings on the Line, Using patterns to form homogeneous teams, A refined complexity analysis of degree anonymization in graphs