Privacy-preserving data mining
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
A fruitful direction for future data mining research will be the development of techniques that incorporate privacy concerns. Specifically, we address the following question. Since the primary task in data mining is the development of models about aggregated data, can we develop accurate models without access to precise information in individual data records? We consider the concrete case of building a decision-tree classifier from training data in which the values of individual records have been perturbed. The resulting data records look very different from the original records and the distribution of data values is also very different from the original distribution. While it is not possible to accurately estimate original values in individual data records, we propose a novel reconstruction procedure to accurately estimate the distribution of original data values. By using these reconstructed distributions, we are able to build classifiers whose accuracy is comparable to the accuracy of classifiers built with the original data.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Regularization of Inverse Problems
Engl, H. W., Hanke, M., & Neubauer, A. (1996) · Springer eBooks · doi:10.1007/978-94-009-1740-8 · Cited by 5,275
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
Warner, S. L. (1965) · Journal of the American Statistical Association · doi:10.1080/01621459.1965.10480775 · Cited by 3,255
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Self-citationSLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
Self-citationBeyond Concern: Understanding Net Users' Attitudes about Online Privacy
Cranor, L. F., Reagle, J., & Ackerman, M. S. (2000) · The Internet Upheaval · doi:10.7551/mitpress/3874.003.0008 · Cited by 381
An Interval Classifier for Database Mining Applications
Agrawal, R., Ghosh, S. P., Imieliński, T., Iyer, B. R., & Swami, A. K. (1992) · Very Large Data Bases · Cited by 294
Self-citation
Research works printed but not linked: 25
- Agrawal Rakesh, 1992, Proc. of the VLDB Conference, 560
- Agrawal Rakesh, 1999, 5th Int'l Con}erence on Knowledge Discovery in Databases and Data Mining
- Barbara D., 1997, Jagadish, T. Johnson, R.Ng, V. Poosala, and K, Sevcik. The New Jersey Data Reduction Report. Data Bngrg. Bull., 20, 3
- Breiman L., 1984, Wadsworth
- Clifton C., 1996, ACId SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 15
- Cramer H., 1946, Mathematical Methods o{ Statistics
- Brankovic V., 1999, Data Warehousing and Knowledge Discovery Da WaK-99, 389
- Economist The, 1999, May
- Fisz Marek, 1963, Probability #heory and Mathematical Statistics
- Faloutsos C., 1997, Proc. of the Z3rd fat'{ Conference on Very Large Databases, 36
- Hine C., 1998, L42(2):#6-59
- Hagel John, 1999, Harvard Business School Press
- Lotspiech J.B., 1999, Method and system for client/server communications with user information revealed as a function of willingness to reveal and whether the information is required. U.S. Patent No
- 10.5555/645911.673617 · doi:10.5555/645911.673617
- Mehta Manish, 1996, Avignon
- Michie D., 1994, Machine Learning, Neural and Statiatical Claasificatior# Ellis Horwood
- Office of the Information and Privacy Commission, 1998, Your Privacy
- Quinlan J. Ross, 1993, Morgan Kaufman
- Sharer John, 1996, Proc. ojf the #2nd lnt'l Conforesee on Very Large Databases
- Shoshani A., 1982, Proceedings of the Eighth International Conference on Very Large Databases (VLDB), 208
- Thearling Kurt, 1998, March
- 1997, August
- Westin A.F., 1998, Louis Harris &
- Westin A.F., 1998, Priwcy concerns &
- Westin A.F., 1999, Freebies and privacy: What net users think. Technical report
Cited by
Items 101–127 of 127
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
Hazay, C., & Lindell, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_10 · Cited by 267
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
How To Break Anonymity of the Netflix Prize Dataset
Narayanan, A., & Shmatikov, V. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0610105 · 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
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2018) · Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems · doi:10.1145/3219617.3219655 · Cited by 228
Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks
Wu, Z., Ling, Q., Chen, T., & Giannakis, G. B. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3012952 · Cited by 226
Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics
Wood, A., Najarian, K., & Kahrobaei, D. (2021) · ACM Computing Surveys · doi:10.1145/3394658 · Cited by 179
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
Himeur, Y., Sohail, S. S., Bensaali, F., Amira, A., & Alazab, M. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102746 · Cited by 139
Fairness in Machine Learning: A Survey
Caton, S., & Haas, C. (2020) · arXiv · doi:10.48550/arxiv.2010.04053 · Cited by 646
A Survey of Privacy Risks and Mitigation Strategies in the Artificial Intelligence Life Cycle
Shahriar, S., Allana, S., Hazratifard, S. M., & Dara, R. (2023) · IEEE Access · doi:10.1109/access.2023.3287195 · Cited by 114
InPrivate Digging: Enabling Tree-based Distributed Data Mining with Differential Privacy
Zhao, L., Ni, L., Hu, S., Chen, Y., Zhou, P., Xiao, F., & Wu, L. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486352 · Cited by 108
Discrimination- and privacy-aware patterns
Hajian, S., Domingo-Ferrer, J., Monreale, A., Pedreschi, D., & Giannotti, F. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0393-7 · Cited by 93
Learning about the world through long-term query logs
Richardson, M. (2008) · ACM Transactions on the Web · doi:10.1145/1409220.1409224 · Cited by 77
Real-time big data processing framework: Challenges and solutions
(2015) · Applied Mathematics & Information Sciences · doi:10.12785/amis/090646 · Cited by 74
Veale, M., & Binns, R. (2017) · doi:10.31235/osf.io/ustxg · Cited by 512
(2011) · Cited by 34
Antwi-Boasiako, E., Zhou, S., Liao, Y., Liu, Q., Wang, Y., & Owusu-Agyemang, K. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102949 · Cited by 31
Making Machine Learning Forget
Shintre, S., Roundy, K. A., & Dhaliwal, J. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-21752-5_6 · Cited by 13
Zhou, J., Gao, G., Cao, Z., Choo, K.-K. R., & Dong, X. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3243598 · Cited by 8
Privacy and Security in Ubiquitous Knowledge Discovery
Giannotti, F., & Saygin, Y. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16392-0_5 · Cited by 4
Metadata
- Authors
- Agrawal, R., & Srikant, R.
- Venue
- ACM SIGMOD Record
- Published
- 2000-05-16
- Volume
- 29
- Issue
- 2
- Pages
- 439-450
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2128906841
- Cited by
- 2,961
- References
- 38
- FWCI
- 32.07
- 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.