The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Mondrian Multidimensional K-Anonymity
Abstract
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving ��anonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (single-dimensional) approaches. Often this flexibility leads to higher-quality anonymizations, as measured both by general-purpose metrics and more specific notions of query answerability. Optimal multidimensional anonymization is NP-hard (like previous optimal ��-anonymity problems). However, we introduce a simple greedy approximation algorithm, and experimental results show that this greedy algorithm frequently leads to more desirable anonymizations than exhaustive optimal algorithms for two single-dimensional models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
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
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s021848850200165x · Cited by 1,976
Samarati, P., & Sweeney, L. (2018) · doi:10.1184/r1/6625469 · Cited by 1,326
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
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
Self-citationOn 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
Cited by
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
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
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
Self-citationThe new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
Big healthcare data: preserving security and privacy
Abouelmehdi, K., Beni-Hessane, A., & Khaloufi, H. (2018) · Journal of Big Data · doi:10.1186/s40537-017-0110-7 · Cited by 738
Personalized privacy preservation
Xiao, X., & Tao, Y. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142500 · Cited by 670
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
Information Security in Big Data: Privacy and Data Mining
Xu, L., Jiang, C., Wang, J., Yuan, J., & Ren, Y. (2014) · IEEE Access · doi:10.1109/access.2014.2362522 · Cited by 631
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Abul, O., Bonchi, F., & Nanni, M. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497446 · Cited by 506
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
Chow, C.-Y., Mokbel, M. F., & Liu, X. (2006) · Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems · doi:10.1145/1183471.1183500 · Cited by 506
A General Survey of Privacy-Preserving Data Mining Models and Algorithms
Aggarwal, C. C., & Yu, P. S. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_2 · Cited by 469
M-invariance: towards privacy preserving re-publication of dynamic datasets
Xiao, X., & Tao, Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247556 · Cited by 466
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
A brief survey on anonymization techniques for privacy preserving publishing of social network data
Zhou, B., Pei, J., & Luk, W. (2008) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1540276.1540279 · Cited by 420
Composition attacks and auxiliary information in data privacy
Ganta, S. R., Kasiviswanathan, S. P., & Smith, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401926 · Cited by 395
Anonymizing Classification Data for Privacy Preservation
Fung, B. C. M., Wang, K., & Yu, P. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1015 · Cited by 349
Protecting Privacy Using k-Anonymity
El Emam, K., & Dankar, F. K. (2008) · Journal of the American Medical Informatics Association · doi:10.1197/jamia.m2716 · Cited by 333
Efficient k-Anonymization Using Clustering Techniques
Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_18 · Cited by 329
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
Privacy-preserving anonymization of set-valued data
Terrovitis, M., Mamoulis, N., & Kalnis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453874 · Cited by 326
Differentially private data release for data mining
Mohammed, N., Chen, R., Fung, B. C. M., & Yu, P. S. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020487 · Cited by 325
The cost of privacy: destruction of data-mining utility in anonymized data publishing
Brickell, J., & Shmatikov, V. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401904 · Cited by 319
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
On the tradeoff between privacy and utility in data publishing
Li, T., & Li, N. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557079 · Cited by 309
Hiding the presence of individuals from shared databases
Nergiz, M. E., Atzori, M., & Clifton, C. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247554 · Cited by 304
Privacy Preservation in the Publication of Trajectories
Terrovitis, M., & Mamoulis, N. (2008) · The Ninth International Conference on Mobile Data Management (mdm 2008) · doi:10.1109/mdm.2008.29 · Cited by 289
Bhaladhare, P. R., & Jinwala, D. C. (2014) · Advances in Computer Engineering · doi:10.1155/2014/396529 · Cited by 286
Protection of Big Data Privacy
Mehmood, A., Natgunanathan, I., Xiang, Y., Hua, G., & Guo, S. (2016) · IEEE Access · doi:10.1109/access.2016.2558446 · Cited by 276
Pufferfish: A framework for mathematical privacy definitions
Kifer, D., & Machanavajjhala, A. (2014) · ACM Transactions on Database Systems · doi:10.1145/2514689 · Cited by 267
Big data security and privacy in healthcare: A Review
Abouelmehdi, K., Beni-Hssane, A., Khaloufi, H., & Saadi, M. (2017) · Procedia Computer Science · doi:10.1016/j.procs.2017.08.292 · Cited by 264
Anonymizing sequential releases
Wang, K., & Fung, B. C. M. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150449 · Cited by 253
Privacy-preserving trajectory data publishing by local suppression
Chen, R., Fung, B. C. M., Mohammed, N., Desai, B. C., & Wang, K. (2013) · Information Sciences · doi:10.1016/j.ins.2011.07.035 · Cited by 252
Privacy in Internet of Things: From Principles to Technologies
Li, C., & Palanisamy, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2864168 · Cited by 130
A Review of Anonymization for Healthcare Data
Olatunji, I. E., Rauch, J., Katzensteiner, M., & Khosla, M. (2024) · Big Data · doi:10.1089/big.2021.0169 · Cited by 101
PMC: A Privacy-preserving Deep Learning Model Customization Framework for Edge Computing
Liu, B., Li, Y., Liu, Y., Guo, Y., & Chen, X. (2020) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3432208 · Cited by 95
Improved l-diversity: scalable anonymization approach for privacy preserving big data publishing
Mehta, B. B., & Rao, U. P. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2019.08.006 · Cited by 57
Improving k-anonymity based privacy preservation for collaborative filtering
Wei, R., Tian, H., & Shen, H. (2018) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2018.02.017 · Cited by 44
Zhang, X., Yang, C., Nepal, S., Liu, C., Dou, W., & Chen, J. (2013) · 2013 International Conference on Cloud and Green Computing · doi:10.1109/cgc.2013.24 · Cited by 43
Metadata
- Authors
- LeFevre, K., DeWitt, D. J., & Ramakrishnan, R.
- Venue
- 22nd International Conference on Data Engineering (ICDE'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 25-25
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2135581534
- Cited by
- 1,124
- References
- 16
- FWCI
- 53.55
- Type
- conference paper
- 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.