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)
Incoming Non-self Citations Over Time
Authors
- 1. Gagan Aggarwal
- 2. Tomas Feder
- 3. Krishnaram Kenthapadi
- 4. Samir Khuller
- 5. Rina Panigrahy
- 6. Dilys Thomas
- 7. An Zhu
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 634 | m-Invariance: Towards Privacy Preserving Re-publication of Dynamic Datasets | 2007 | SIGMOD | 0.00018895628 |
| 3,381 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB | 7.1604078e-05 |
| 4,790 | Hiding the Presence of Individuals from Shared Databases | 2007 | SIGMOD | 5.9192267e-05 |
| 4,979 | Fast Data Anonymization with Low Information Loss | 2007 | VLDB | 5.7878768e-05 |
| 6,482 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD | 5.045711e-05 |
| 9,338 | Preservation of Proximity Privacy in Publishing Numerical Sensitive Data | 2008 | SIGMOD | 4.3556432e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 304 | On the Complexity of Optimal K-Anonymity | 2004 | PODS | 0.00028290121 |
| 455 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD | 0.00022717354 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 304 | On the Complexity of Optimal K-Anonymity | 2004 | PODS | 0.00028290121 |
| 12,343 | Distribution-based Microdata Anonymization | 2009 | VLDB | 4.1945683e-05 |
| 12,229 | Non-homogeneous Generalization in Privacy Preserving Data Publishing | 2010 | SIGMOD | 4.1945683e-05 |
| 7,541 | Privacy-Enhancing k-Anonymization of Customer Data | 2005 | PODS | 4.7157092e-05 |
| 455 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD | 0.00022717354 |
| 8,930 | Privacy Preservation by Disassociation | 2012 | VLDB | 4.427232e-05 |
| 6,482 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD | 5.045711e-05 |
| 3,381 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB | 7.1604078e-05 |
| 225 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS | 0.00032707646 |
| 4,979 | Fast Data Anonymization with Low Information Loss | 2007 | VLDB | 5.7878768e-05 |