The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the design and quantification of privacy preserving data mining algorithms
Abstract
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms which preserve user privacy. A recently proposed technique addresses the issue of privacy preservation by perturbing the data and reconstructing distributions at an aggregate level in order to perform the mining. This method is able to retain privacy while accessing the information implicit in the original attributes. The distribution reconstruction process naturally leads to some loss of information which is acceptable in many practical situations. This paper discusses an Expectation Maximization (EM) algorithm for distribution reconstruction which is more effective than the currently available method in terms of the level of information loss. Specifically, we prove that the EM algorithm converges to the maximum likelihood estimate of the original distribution based on the perturbed data. We show that when a large amount of data is available, the EM algorithm provides robust estimates of the original distribution. We propose metrics for quantification and measurement of privacy-preserving data mining algorithms. Thus, this paper provides the foundations for measurement of the effectiveness of privacy preserving data mining algorithms. Our privacy metrics illustrate some interesting results on the relative effectiveness of different perturbing distributions.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Trees, H. L. V. (1992) · Cited by 511
SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING
Clifton, C., & Marks, D. G. (1996) · Cited by 271
TRUSTe: an online privacy seal program
Benassi, P. (1999) · Communications of the ACM · doi:10.1145/293411.293461 · Cited by 267
A data distortion by probability distribution
Liew, C. K., Choi, U. J., & Liew, C. J. (1985) · ACM Transactions on Database Systems · doi:10.1145/3979.4017 · Cited by 202
Cited by
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
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
“One privacy metric [Agrawal and Aggarwal 2001] is based on the conditional differential entropy between the original and perturbed data.”
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
“release of tabular data, contingency tables, and cell suppression), and from such diverse branches of computer science as algorithms, database theory, and cryptography, for example as in [3, 4, 21, 22, 23, 33, 34, 41, 48], [1, 24, 25, 31], and [6, 9, 11, 12, 13, 18, 7, 19]; see also the survey [2] for a summary of the…”
The rise of big data on cloud computing: Review and open research issues
Hashem, I. A. T., Yaqoob, I., Anuar, N. B., Mokhtar, S., Gani, A., & Ullah Khan, S. (2015) · Information Systems · doi:10.1016/j.is.2014.07.006 · Cited by 2,656
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
“accurate statistics about a population while preserving the privacy of individuals [1, 2, 15, 11, 14, 5, 6, 4, 13].”
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
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
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
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898
“The difficulty of constructing private learners lies in finding a good hypothesis in what is typically an exponentially large space.”
Backstrom, L., Dwork, C., & Kleinberg, J. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242598 · Cited by 850
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
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., & Srikant, R. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773174 · Cited by 815
Practical privacy: the SuLQ framework
Blum, A., Dwork, C., McSherry, F., & Nissim, K. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065184 · Cited by 797
Privacy preserving mining of association rules
Evfimievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775080 · Cited by 768
Sharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Privacy-preserving k -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626
On the privacy preserving properties of random data perturbation techniques
Kargupta, H., Datta, S., Wang, Q., & Sivakumar, K. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250908 · Cited by 618
Preserving privacy by de-identifying face images
Newton, E. M., Sweeney, L., & Malin, B. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.32 · Cited by 615
Liu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554
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
Enhancing Source-Location Privacy in Sensor Network Routing
Kamat, P., Zhang, Y., Trappe, W., & Ozturk, C. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.31 · Cited by 530
Verykios, V. S., Elmagarmid, A. K., Bertino, E., Saygin, Y., & Dasseni, E. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269668 · Cited by 518
Maintaining Data Privacy in Association Rule Mining
Rizvi, S. J., & Haritsa, J. R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50066-4 · Cited by 485
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
Self-citationPrivacy, 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
A survey on privacy in mobile participatory sensing applications
Christin, D., Reinhardt, A., Kanhere, S. S., & Hollick, M. (2011) · Journal of Systems and Software · doi:10.1016/j.jss.2011.06.073 · Cited by 427
Deriving private information from randomized data
Huang, Z., Du, W., & Chen, B. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066163 · Cited by 404
Airavat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 393
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2017) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v7i3.405 · Cited by 390
Protecting Location Privacy Through Path Confusion
Hoh, B., & Gruteser, M. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.33 · Cited by 386
Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach
Sankar, L., Rajagopalan, S. R., & Poor, H. V. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2253320 · Cited by 371
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Du, W., Han, Y. S., & Chen, S. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.21 · Cited by 366
A Condensation Approach to Privacy Preserving Data Mining
Aggarwal, C. C., & Yu, P. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24741-8_12 · Cited by 364
Self-citationVirtual trip lines for distributed privacy-preserving traffic monitoring
Hoh, B., Gruteser, M., Herring, R., Ban, J., Work, D., Herrera, J.-C., Bayen, A. M., Annavaram, M., & Jacobson, Q. (2008) · Proceedings of the 6th international conference on Mobile systems, applications, and services · doi:10.1145/1378600.1378604 · Cited by 351
Privacy-Preserving Datamining on Vertically Partitioned Databases
Dwork, C., & Nissim, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_32 · Cited by 348
Technical Privacy Metrics: A Systematic Survey
Wagner, I., & Eckhoff, D. (2019) · ACM Computing Surveys · doi:10.1145/3168389 · Cited by 346
Preserving privacy in gps traces via uncertainty-aware path cloaking
Hoh, B., Gruteser, M., Xiong, H., & Alrabady, A. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315266 · Cited by 345
Using unknowns to prevent discovery of association rules
Saygin, Y., Verykios, V. S., & Clifton, C. (2001) · ACM SIGMOD Record · doi:10.1145/604264.604271 · Cited by 338
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.27 · Cited by 334
Injecting utility into anonymized datasets
Kifer, D., & Gehrke, J. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142499 · Cited by 296
Privacy Preserving Clustering by Data Transformation
Oliveira, S. R. D. M., & Zai͏̈ane, O. R. (2003) · Journal of Information and Data Management · doi:10.5753/jidm.2010.940 · Cited by 294
Privacy-Preserving Data Mining: Methods, Metrics, and Applications
Mendes, R., & Vilela, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2706947 · Cited by 294
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., & Zhu, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30570-5_17 · Cited by 292
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
Privacy Preserving Data Classification with Rotation Perturbation
Chen, K., & Liu, L. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.121 · Cited by 270
The inference problem: a survey
Farkas, C., & Jajodia, S. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772864 · Cited by 267
Toward Privacy in Public Databases
Chawla, S., Dwork, C., McSherry, F., Smith, A., & Wee, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_20 · Cited by 264
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
Privacy Preserving Naïve Bayes Classifier for Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.59 · Cited by 262
Abdelzaher, T., Anokwa, Y., Boda, P., Burke, J., Estrin, D., Guibas, L., Kansal, A., Madden, S., & Reich, J. (2007) · IEEE Pervasive Computing · doi:10.1109/mprv.2007.38 · Cited by 258
Privacy-preserving SVM classification
Vaidya, J., Yu, H., & Jiang, X. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0073-7 · Cited by 178
Privacy-Preserving Decision Trees over Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535706_11 · Cited by 144
A Privacy-Preserving Querying Mechanism with High Utility for Electric Vehicles
Atmaca, U. I., Biswas, S., Maple, C., & Palamidessi, C. (2024) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2024.3360302 · Cited by 9
“6 and (cid:2) = 2 and IBU was run for 100 iterations.”
MethodInfluential
Metadata
- Authors
- Agrawal, D., & Aggarwal, C. C.
- Venue
- Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2001-05
- Pages
- 247-255
- OpenAlex
- W1999602050
- Cited by
- 1,006
- References
- 14
- FWCI
- 14.74
- 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.