The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
PrivBayes: Private Data Release via Bayesian Networks
Open accessAbstract
Privacy-preserving data publishing is an important problem that has been the focus of extensive study. The state-of-the-art solution for this problem is differential privacy, which offers a strong degree of privacy protection without making restrictive assumptions about the adversary. Existing techniques using differential privacy, however, cannot effectively handle the publication of high-dimensional data. In particular, when the input dataset contains a large number of attributes, existing methods require injecting a prohibitive amount of noise compared to the signal in the data, which renders the published data next to useless. To address the deficiency of the existing methods, this paper presents P riv B ayes , a differentially private method for releasing high-dimensional data. Given a dataset D , P riv B ayes first constructs a Bayesian network N , which (i) provides a succinct model of the correlations among the attributes in D and (ii) allows us to approximate the distribution of data in D using a set P of low-dimensional marginals of D . After that, P riv B ayes injects noise into each marginal in P to ensure differential privacy and then uses the noisy marginals and the Bayesian network to construct an approximation of the data distribution in D . Finally, P riv B ayes samples tuples from the approximate distribution to construct a synthetic dataset, and then releases the synthetic data. Intuitively, P riv B ayes circumvents the curse of dimensionality, as it injects noise into the low-dimensional marginals in P instead of the high-dimensional dataset D . Private construction of Bayesian networks turns out to be significantly challenging, and we introduce a novel approach that uses a surrogate function for mutual information to build the model more accurately. We experimentally evaluate P riv B ayes on real data and demonstrate that it significantly outperforms existing solutions in terms of accuracy.
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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,155
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
(2009) · Cited by 6,153
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Introduction to Nonparametric Estimation
Tsybakov, A. B. (2009) · Springer Series in Statistics · doi:10.1007/b13794 · Cited by 2,486
Approximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720
Mechanism Design via Differential Privacy
McSherry, F., & Talwar, K. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.66 · Cited by 1,371
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
Smooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
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
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
Differentially private aggregation of distributed time-series with transformation and encryption
Rastogi, V., & Nath, S. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807247 · Cited by 534
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
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
Differentially Private Spatial Decompositions
Cormode, G., Procopiuc, C., Srivastava, D., Shen, E., & Yu, T. (2012) · 2012 IEEE 28th International Conference on Data Engineering · doi:10.1109/icde.2012.16 · Cited by 411
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
PrivBayes: private data release via bayesian networks
Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2588573 · Cited by 281
Self-citationLearning in a Large Function Space: Privacy-Preserving Mechanisms for SVM Learning
Rubinstein, B. I. P., Bartlett, P. L., Huang, L., & Taft, N. (2012) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v4i1.612 · Cited by 262
Privacy-preserving statistical estimation with optimal convergence rates
Smith, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993743 · Cited by 251
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
GUPT: privacy preserving data analysis made easy
Mohan, P., Thakurta, A., Shi, E., Song, D., & Culler, D. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213876 · Cited by 219
Differentially Private High-Dimensional Data Publication via Sampling-Based Inference
Chen, R., Xiao, Q., Zhang, Y., & Xu, J. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783379 · Cited by 180
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
Self-citationLi, N., Qardaji, W. H., Su, D., & Cao, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350251 · Cited by 170
Differentially private data cubes: optimizing noise sources and consistency
Ding, B., Winslett, M., Han, J., & Li, Z. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989347 · Cited by 139
Hayes, B. (2002) · American Scientist · doi:10.1511/2002.2.113 · Cited by 131
Differentially private summaries for sparse data
Cormode, G., Procopiuc, C. M., Srivastava, D., & Tran, T. T. L. (2012) · International Conference on Database Theory · doi:10.1145/2274576.2274608 · Cited by 114
Self-citationDifferentially-private network trace analysis
McSherry, F., & Mahajan, R. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851199 · Cited by 110
Feldman, D., Fiat, A., Kaplan, H. Y., & Kobbi Nissim, B. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536465 · Cited by 104
An adaptive mechanism for accurate query answering under differential privacy
Li, C., & Miklau, G. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2168651.2168653 · Cited by 103
Low-rank mechanism: optimizing batch queries under differential privacy
Yuan, G., Zhang, Z., Winslett, M., Xiao, X., Yang, Y., & Hao, Z. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350252 · Cited by 82
Self-citationZhang, J., Xiao, X., Yang, Y., Zhang, Z., & Winslett, M. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2465330 · Cited by 76
Self-citationKifer, D., Smith, A., & Thakurta, A. (2012) · Conference on Learning Theory · Cited by 45
Accurate and efficient private release of datacubes and contingency tables
Yaroslavtsev, G., Cormode, G., Procopiuc, C. M., & Srivastava, D. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544871 · Cited by 44
Self-citationOptimal error of query sets under the differentially-private matrix mechanism
Li, C., & Miklau, G. (2013) · International Conference on Database Theory · doi:10.1145/2448496.2448529 · Cited by 35
National Long Term Care Survey
Mantón, K. G. (2012) · doi:10.4135/9781412956208.n158 · Cited by 22
Cited by
Deep Neural Networks and Tabular Data: A Survey
Borisov, V., Leemann, T., Seßler, K., Haug, J., Pawelczyk, M., & Kasneci, G. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3229161 · Cited by 1,025
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
Survey on Synthetic Data Generation, Evaluation Methods and GANs
Figueira, A., & Vaz, B. (2022) · Mathematics · doi:10.3390/math10152733 · Cited by 413
Generation and evaluation of synthetic patient data
Goncalves, A., Ray, P., Soper, B., Stevens, J., Coyle, L., & Sales, A. P. (2020) · BMC Medical Research Methodology · doi:10.1186/s12874-020-00977-1 · Cited by 388
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
Metadata
- Authors
- Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X.
- Venue
- ACM Transactions on Database Systems
- Published
- 2017-10-27
- Volume
- 42
- Issue
- 4
- Pages
- 1-41
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W4234726042
- Cited by
- 399
- References
- 39
- FWCI
- 8.20
- Type
- journal article
- Language
- en
- Open access
- bronze
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.