Privacy-preserving Anonymization of Set-valued Data
Summary: Set-valued data anonymization using a generalization-based k^m-anonymity variant to bound dimensionality; items treated as quasi-identifiers and sensitive data. Optimal algorithm (costly) and two scalable greedy heuristics, evaluated on real datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Manolis Terrovitis
- 2. Nikos Mamoulis
- 3. Panos Kalnis
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,566 | PrivBasis: Frequent Itemset Mining with Differential Privacy | 2012 | VLDB | 0.00011324162 |
| 2,688 | On Differentially Private Frequent Itemset Mining | 2013 | VLDB | 8.3012815e-05 |
| 3,103 | Publishing Set-Valued Data via Differential Privacy | 2011 | VLDB | 7.5578714e-05 |
| 4,527 | Anonymization of Set-Valued Data via Top-Down, Local Generalization | 2009 | VLDB | 6.1076171e-05 |
| 5,492 | rho-uncertainty: Inference-Proof Transaction Anonymization | 2010 | VLDB | 5.4777688e-05 |
| 8,077 | Set-valued Data Publication with Local Privacy: Tight Error Bounds and Efficient Mechanisms | 2020 | VLDB | 4.5878947e-05 |
| 8,934 | Privacy Preservation by Disassociation | 2012 | VLDB | 4.4229886e-05 |
| 12,320 | Anonymized Data: Generation, Models, Usage | 2009 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 305 | On the Complexity of Optimal K-Anonymity | 2004 | PODS | 0.00028264843 |
| 458 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD | 0.00022698513 |
| 654 | Anatomy: Simple and Effective Privacy Preservation | 2006 | VLDB | 0.00018594644 |
| 2,822 | Achieving Anonymity via Clustering | 2006 | PODS | 8.0624025e-05 |
| 4,981 | Fast Data Anonymization with Low Information Loss | 2007 | VLDB | 5.7823243e-05 |
| 6,476 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD | 5.040879e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,475 | Privacy-Enhancing k-Anonymization of Customer Data | 2005 | PODS | 4.714352e-05 |
| 1,382 | Minimality Attack in Privacy Preserving Data Publishing | 2007 | VLDB | 0.00012270633 |
| 2,822 | Achieving Anonymity via Clustering | 2006 | PODS | 8.0624025e-05 |
| 12,237 | Non-homogeneous Generalization in Privacy Preserving Data Publishing | 2010 | SIGMOD | 4.1905499e-05 |
| 225 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS | 0.0003266103 |
| 4,527 | Anonymization of Set-Valued Data via Top-Down, Local Generalization | 2009 | VLDB | 6.1076171e-05 |
| 3,103 | Publishing Set-Valued Data via Differential Privacy | 2011 | VLDB | 7.5578714e-05 |
| 8,934 | Privacy Preservation by Disassociation | 2012 | VLDB | 4.4229886e-05 |
| 2,656 | Personalized Privacy Preservation | 2006 | SIGMOD | 8.3636527e-05 |
| 4,981 | Fast Data Anonymization with Low Information Loss | 2007 | VLDB | 5.7823243e-05 |