Achieving Anonymity via Clustering

Summary: Propose clustering-based anonymization: publish cluster centers with each cluster containing ≥k records, offering richer generalization and lower distortion than k-anonymity. Provide constant-factor approximation algorithms independent of k and an ε-outlier deletion variant. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1386
Venue: PODS
Year: 2006
Pagerank: 7.7477034e-05
Overall Rank: 3,110 | 78.67%
DOI: 10.1145/1142351.1142374

Incoming Non-self Citations Over Time

Authors

1. Gagan Aggarwal (Google)
2. Tomas Feder (Stanford University)
3. Krishnaram Kenthapadi (Stanford University)
4. Samir Khuller (University of Maryland)
5. Rina Panigrahy (Stanford University)
6. Dilys Thomas (Stanford University)
7. An Zhu (Google)

BibTeX Citation

@inproceedings{aggarwal_pods06,
        address = {New York, NY, USA},
        series = {{PODS} '06},
        title = {{Achieving Anonymity via Clustering}},
        url = {https://dl.acm.org/doi/10.1145/1142351.1142374},
        doi = {10.1145/1142351.1142374},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Aggarwal, Gagan and Feder, Tomas and Kenthapadi, Krishnaram and Khuller, Samir and Panigrahy, Rina and Thomas, Dilys and Zhu, An},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,010	m-Invariance: Towards Privacy Preserving Re-publication of Dynamic Datasets	2007	SIGMOD	0.00012684067
3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB	7.6179491e-05
4,526	Hiding the Presence of Individuals from Shared Databases	2007	SIGMOD	6.6452861e-05
4,699	Fast Data Anonymization with Low Information Loss	2007	VLDB	6.5560796e-05
6,554	Approximate Algorithms for k-Anonymity	2007	SIGMOD	5.8416386e-05
9,487	Preservation of Proximity Privacy in Publishing Numerical Sensitive Data	2008	SIGMOD	5.2634238e-05

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
384	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00019510305
450	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD	0.00018155142

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	384	On the Complexity of Optimal K-Anonymity	2004	PODS
2	12,537	Distribution-based Microdata Anonymization	2009	VLDB
3	12,424	Non-homogeneous Generalization in Privacy Preserving Data Publishing	2010	SIGMOD
4	7,875	Privacy-Enhancing k-Anonymization of Customer Data	2005	PODS
5	450	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD
6	9,086	Privacy Preservation by Disassociation	2012	VLDB
7	6,554	Approximate Algorithms for k-Anonymity	2007	SIGMOD
8	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB
9	338	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS
10	4,699	Fast Data Anonymization with Low Information Loss	2007	VLDB