The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Differentially private data release for data mining
Abstract
Privacy-preserving data publishing addresses the problem of disclosing sensitive data when mining for useful information. Among the existing privacy models, ∈-differential privacy provides one of the strongest privacy guarantees and has no assumptions about an adversary's background knowledge. Most of the existing solutions that ensure ∈-differential privacy are based on an interactive model, where the data miner is only allowed to pose aggregate queries to the database. In this paper, we propose the first anonymization algorithm for the non-interactive setting based on the generalization technique. The proposed solution first probabilistically generalizes the raw data and then adds noise to guarantee ∈-differential privacy. As a sample application, we show that the anonymized data can be used effectively to build a decision tree induction classifier. Experimental results demonstrate that the proposed non-interactive anonymization algorithm is scalable and performs better than the existing solutions for classification analysis.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
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
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
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
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
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
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 · cited 2×
“Many algorithms have been proposed to preserve privacy, but only a few have considered the goal for classification [12].”
BackgroundSelf-citationTowards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
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
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559850 · Cited by 1,124
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
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
A firm foundation for private data analysis
Dwork, C. (2011) · Communications of the ACM · doi:10.1145/1866739.1866758 · Cited by 841
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
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
Differentially private recommender systems: Building privacy into the Netflix Prize contenders
McSherry, F., & Mironov, I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557090 · Cited by 664
(α, 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
Boosting the accuracy of differentially private histograms through consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920970 · Cited by 528
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., & Talwar, K. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265569 · Cited by 468
Data mining with differential privacy
Friedman, A., & Schuster, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835868 · Cited by 461
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
Self-citationOptimizing linear counting queries under differential privacy
Li, C., Hay, M., Rastogi, V., Miklau, G., & McGregor, A. (2010) · Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1807085.1807104 · Cited by 319
On the geometry of differential privacy
Hardt, M., & Talwar, K. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806786 · Cited by 314
Minimality Attack in Privacy Preserving Data Publishing
Wong, R. C.-W., Fu, A. W.-C., Wang, K., & Pei, J. (2006) · Cited by 281
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Martin, D. J., Kifer, D., Machanavajjhala, A., Gehrke, J., & Halpern, J. Y. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367858 · Cited by 263
Discovering frequent patterns in sensitive data
Bhaskar, R., Laxman, S., Smith, A., & Thakurta, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835869 · Cited by 227
Interactive privacy via the median mechanism
Roth, A., & Roughgarden, T. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806794 · Cited by 226
Differential privacy via wavelet transforms
Xiao, X., Wang, G., & Gehrke, J. (2010) · 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) · doi:10.1109/icde.2010.5447831 · Cited by 178
Private record matching using differential privacy
Inan, A., Kantarcioglu, M., Ghinita, G., & Bertino, E. (2010) · Proceedings of the 13th International Conference on Extending Database Technology · doi:10.1145/1739041.1739059 · Cited by 162
Attacks on privacy and deFinetti's theorem
Kifer, D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559861 · Cited by 162
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-citationWorkload-aware anonymization techniques for large-scale datasets
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2008) · ACM Transactions on Database Systems · doi:10.1145/1386118.1386123 · Cited by 121
Towards an axiomatization of statistical privacy and utility
Kifer, D., & Lin, B.-R. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807106 · Cited by 114
Anonymizing healthcare data: a case study on the blood transfusion service
Mohammed, N., Fung, B. C. M., Hung, P. C. K., & Lee, C.-K. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557157 · Cited by 110
Self-citationPersonalized Privacy Preservation
Tao, Y., & Xiao, X. (2008) · The Kluwer international series on advances in database systems · doi:10.1007/978-0-387-70992-5_19 · Cited by 108
Kasiviswanathan, S. P., Rudelson, M., Smith, A., & Ullman, J. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806795 · Cited by 107
Can the Utility of Anonymized Data be Used for Privacy Breaches?
Wong, R. C.-W., Fu, A. W.-C., Wang, K., Yu, P. S., & Pei, J. (2011) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1993077.1993080 · Cited by 92
Self-citationInformation disclosure under realistic assumptions
Zhang, L., Jajodia, S., & Brodsky, A. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315316 · Cited by 74
McSherry, F. (2009) · Cited by 55
Minimizing minimality and maximizing utility
Cormode, G., Srivastava, D., Li, N., & Li, T. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920972 · Cited by 54
Data publishing against realistic adversaries
Machanavajjhala, A., Gehrke, J. E., & Götz, M. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687717 · Cited by 53
Xiao, X., Tao, Y., & Koudas, N. (2010) · ACM Transactions on Database Systems · doi:10.1145/1735886.1735887 · Cited by 36
Algorithm-safe privacy-preserving data publishing
Jin, X., Zhang, N., & Das, G. (2010) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1739041.1739116 · Cited by 25
Cited by
Data synthesis based on generative adversarial networks
Park, N., Mohammadi, M., Gorde, K., Jajodia, S., Park, H., & Kim, Y. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3231751.3231757 · Cited by 531
Security and privacy challenges in smart cities
Braun, T., Fung, B. C. M., Iqbal, F., & Shah, B. (2018) · Sustainable Cities and Society · doi:10.1016/j.scs.2018.02.039 · Cited by 352
Self-citationDifferentially Private Data Publishing and Analysis: A Survey
Zhu, T., Li, G., Zhou, W., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2697856 · Cited by 330
Self-citationAnonymization 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
Differentially private sequential data publication via variable-length n-grams
Chen, R., Acs, G., & Castelluccia, C. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382263 · Cited by 274
Self-citation
Metadata
- Authors
- Mohammed, N., Chen, R., Fung, B. C. M., & Yu, P. S.
- Venue
- Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2011-08-21
- Pages
- 493-501
- OpenAlex
- W2005107218
- Cited by
- 325
- References
- 46
- FWCI
- 18.84
- 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.