The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Anonymizing Classification Data for Privacy Preservation
Abstract
Classification is a fundamental problem in data analysis. Training a classifier requires accessing a large collection of data. Releasing person-specific data, such as customer data or patient records, may pose a threat to an individual's privacy. Even after removing explicit identifying information such as Name and SSN, it is still possible to link released records back to their identities by matching some combination of nonidentifying attributes such as {Sex, Zip, Birthdate}. A useful approach to combat such linking attacks, called k-anonymization, is anonymizing the linking attributes so that at least k released records match each value combination of the linking attributes. Previous work attempted to find an optimal k-anonymization that minimizes some data distortion metric. We argue that minimizing the distortion to the training data is not relevant to the classification goal that requires extracting the structure of predication on the "future" data. In this paper, we propose a k-anonymization solution for classification. Our goal is to find a k-anonymization, not necessarily optimal in the sense of minimizing data distortion, which preserves the classification structure. We conducted intensive experiments to evaluate the impact of anonymization on the classification on future data. Experiments on real-life data show that the quality of classification can be preserved even for highly restrictive anonymity requirements
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
(1992) · Cited by 23,431
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
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
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
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
Weiss, S. M., & Kulikowski, C. A. (1991) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 898
UCI Repository of Machine Learning Database
Newman, D. J. (1998) · Medical Entomology and Zoology · Cited by 824
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
Generalizing data to provide anonymity when disclosing information (abstract)
Samarati, P., & Sweeney, L. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275508 · Cited by 779
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
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Wong, R. C.-W., Li, J., Fu, A. W.-C., & Wang, K. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150499 · Cited by 625
Self-citationTop-Down Specialization for Information and Privacy Preservation
Fung, B. C. M., Wang, K., & Yu, P. S. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.143 · Cited by 576
Self-citationUtility-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
Bottom-Up Generalization: A Data Mining Solution to Privacy Protection
Wang, K., Yu, P. S., & Chakraborty, S. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10110 · Cited by 311
Self-citationAnonymizing 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
Self-citationApproximation Algorithms for k-Anonymity
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., & Zhu, A. (2005) · Cited by 231
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150435 · Cited by 215
Datafly: a system for providing anonymity in medical data
Sweeney, L. (1998) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35285-5_22 · Cited by 145
Handicapping attacker's confidence: an alternative to k-anonymization
Wang, K., Fung, B. C. M., & Yu, P. S. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0035-5 · Cited by 123
Self-citationTemplate-Based Privacy Preservation in Classification Problems
Wang, K., Fung, B. C. M., & Yu, P. S. (2006) · Proceedings · doi:10.1109/icdm.2005.142 · Cited by 115
Self-citationThe Personal Information Protection and Electronic Documents ActPreprint
Elsheshtawy, H. (2009) · SSRN Electronic Journal · Cited by 64
Integrating Private Databases for Data Analysis
Wang, K., Fung, B. C. M., & Dong, G. (2005) · Lecture notes in computer science · doi:10.1007/11427995_14 · Cited by 30
Self-citation
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
Self-citationA 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
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
Self-citationEvaluating re-identification risks with respect to the HIPAA privacy rule
Benitez, K., & Malin, B. (2010) · Journal of the American Medical Informatics Association · doi:10.1136/jamia.2009.000026 · Cited by 301
Anonymization Techniques for Privacy Preserving Data Publishing: A Comprehensive Survey
Majeed, A., & Lee, S. (2021) · IEEE Access · doi:10.1109/access.2020.3045700 · Cited by 287
Metadata
- Authors
- Fung, B. C. M., Wang, K., & Yu, P. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-05
- Volume
- 19
- Issue
- 5
- Pages
- 711-725
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2118944554
- Cited by
- 349
- References
- 28
- FWCI
- 19.31
- 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.