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,410
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 6×
“To limit such disclosure, Samarati and Sweeney [36, 37] propose the k-anonymity privacy model, which requires that an individual should not be identifiable from a group of size smaller than k based on the QID.”
BackgroundMethodInfluentialCalibrating 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 · cited 3×
“We employ the publicly available Adult [10] data set, a real-life census data set that has been used for testing many anonymization algorithms [2, 13, 18, 28, 38, 33].”
BackgroundMethodt-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
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-citationA Trustworthy Privacy Preserving Framework for Machine Learning in Industrial IoT Systems
Arachchige, P. C. M., Bertok, P., Khalil, I., Liu, D., Camtepe, S., & Atiquzzaman, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2974555 · Cited by 236
Enhancing data utility in differential privacy via microaggregation-based $$k$$ k -anonymity
Soria-Comas, J., Domingo-Ferrer, J., Sánchez, D., & Martínez, S. (2014) · The VLDB Journal · doi:10.1007/s00778-014-0351-4 · Cited by 149
Improved collaborative filtering recommendation algorithm based on differential privacy protection
Yin, C., Shi, L., Sun, R., & Wang, J. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-019-02751-7 · Cited by 90
Kim, J., Koo, D., Kim, Y., Yoon, H., Shin, J., & Kim, S. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3212509 · Cited by 74
Privacy-Preserving Federated Learning Model for Healthcare Data
Islam, T. U., Ghasemi, R., & Mohammed, N. (2022) · 2022 IEEE 12th Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc54503.2022.9720752 · Cited by 56
Self-citationLi, X., Wang, Y., Song, J., Liu, Y., Zhang, X., Zhou, K., & Li, C. (2020) · World Wide Web · doi:10.1007/s11280-019-00769-8 · Cited by 7
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.