The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Privacy-preserving anonymization of set-valued data
Abstract
In this paper we study the problem of protecting privacy in the publication of set-valued data. Consider a collection of transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve as links to his identity, the publication of such data is still subject to privacy attacks from adversaries who have partial knowledge about the set. Unlike most previous works, we do not distinguish data as sensitive and non-sensitive, but we consider them both as potential quasi-identifiers and potential sensitive data, depending on the point of view of the adversary. We define a new version of the k -anonymity guarantee, the k m -anonymity, to limit the effects of the data dimensionality and we propose efficient algorithms to transform the database. Our anonymization model relies on generalization instead of suppression, which is the most common practice in related works on such data. We develop an algorithm which finds the optimal solution, however, at a high cost which makes it inapplicable for large, realistic problems. Then, we propose two greedy heuristics, which scale much better and in most of the cases find a solution close to the optimal. The proposed algorithms are experimentally evaluated using real datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 3×
“Unlike the k -anonymity problem in relational databases [18, 19], there is no fixed, well-defined set of quasi-identifier attributes and sensitive data.”
BackgroundMethodMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Incognito: efficient full-domain K-anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066164 · Cited by 1,070
On the complexity of optimal K-anonymity
Meyerson, A., & Williams, R. (2004) · Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1055558.1055591 · Cited by 821
Transforming data to satisfy privacy constraints
Iyengar, V. S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775089 · Cited by 790
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
Verykios, V. S., Elmagarmid, A. K., Bertino, E., Saygin, Y., & Dasseni, E. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269668 · Cited by 518
Real world performance of association rule algorithms
Zheng, Z., Kohavi, R., & Mason, L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502572 · Cited by 488
Utility-based anonymization using local recoding
Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., & Fu, A. W.-C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150504 · Cited by 424
Aggregate Query Answering on Anonymized Tables
Zhang, Q., Koudas, N., Srivastava, D., & Yu, T. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367857 · Cited by 357
Fast data anonymization with low information loss
Ghinita, G., Karras, P., Kalnis, P., & Mamoulis, N. (2007) · Cited by 289
Self-citationAchieving anonymity via clustering
Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., & Zhu, A. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142374 · Cited by 271
Approximation Algorithms for k-Anonymity
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., & Zhu, A. (2005) · Cited by 231
On the Anonymization of Sparse High-Dimensional Data
Ghinita, G., Tao, Y., & Kalnis, P. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497480 · Cited by 188
Self-citationNergiz, M. E., & Clifton, C. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.009 · Cited by 142
Approximate algorithms for K-anonymity
Park, H.-M., & Shim, K. (2007) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1247480.1247490 · Cited by 135
Anonymity preserving pattern discovery
Atzori, M., Bonchi, F., Giannotti, F., & Pedreschi, D. (2006) · The VLDB Journal · doi:10.1007/s00778-006-0034-x · Cited by 119
Nergiz, M. E., Clifton, C., & Nergiz, A. E. (2007) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2007.369025 · Cited by 67
Cited by
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“Specific DA methods have also been designed for relational data [262], set-valued data [151, 320], and image data [97, 239].”
BackgroundA Survey on Differential Privacy for Unstructured Data Content
Zhao, Y., & Chen, J. (2022) · ACM Computing Surveys · doi:10.1145/3490237 · Cited by 313
Slicing: A New Approach for Privacy Preserving Data Publishing
Li, T., Li, N., Zhang, J., & Molloy, I. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.236 · Cited by 312
Privacy-Preserving Data Mining: Methods, Metrics, and Applications
Mendes, R., & Vilela, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2706947 · Cited by 294
Metadata
- Authors
- Terrovitis, M., Mamoulis, N., & Kalnis, P.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2008-08
- Volume
- 1
- Issue
- 1
- Pages
- 115-125
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2123453946
- Cited by
- 326
- References
- 24
- FWCI
- 34.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.