The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Privacy-preserving data mining
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.
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
TRUSTe: an online privacy seal program
Benassi, P. (1999) · Communications of the ACM · doi:10.1145/293411.293461 · Cited by 267
Research works printed but not linked: 50
- 10.1145/632716.632875 · DOI
- 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
- 10.1145/76894.76895 · DOI · Paper page
- Barbara D., 1997, Jagadish, T. Johnson, R.Ng, V. Poosala, and K, Sevcik. The New Jersey Data Reduction Report. Data Bngrg. Bull., 20, 3
- 10.1145/320613.320617 · DOI
- Breiman L., 1984, Wadsworth
- 10.1145/262762.262764 · DOI
- Clifton C., 1996, ACId SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 15
- 10.1109/TSE.1982.236161 · DOI · Paper page
- 10.1080/01621459.1980.10477481 · DOI · Paper page
- Cramer H., 1946, Mathematical Methods o{ Statistics
- 10.1145/293411.293440 · DOI
- 10.1145/800191.805537 · DOI
- 10.1145/320064.320069 · DOI
- 10.1145/320613.320616 · DOI · Paper page
- Denming D.E., 1982, Cryptography and Data Security
- Dinardo C.T., 1978, Computers and Security
- 10.1145/320064.320068 · DOI · Paper page
- Brankovic V., 1999, Data Warehousing and Knowledge Discovery Da WaK-99, 389
- Economist The, 1999, May
- 10.1007/978-94-009-1740-8 · DOI · Paper page
- 10.1080/01621459.1972.10481199 · DOI · Paper page
- Fisz Marek, 1963, Probability #heory and Mathematical Statistics
- Faloutsos C., 1997, Proc. of the Z3rd fat'{ Conference on Very Large Databases, 36
- Goldberg Inn, Privacy-enhancing technologie# for the internet
- Hine C., 1998, L42(2):#6-59
- Hagel John, 1999, Harvard Business School Press
- 10.1145/3979.4017 · DOI · Paper page
- 10.1145/317665.317680 · DOI
- 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
- 10.1145/253769.253802 · DOI
- Quinlan J. Ross, 1993, Morgan Kaufman
- 10.1145/348.349 · DOI
- 10.1109/2.708448 · DOI
- 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
- 10.1109/69.54719 · DOI
- Thearling Kurt, 1998, March
- 1997, August
- 10.1145/1994.383392 · DOI
- 10.1080/01621459.1965.10480775 · DOI · Paper page
- 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
- 10.1145/509404.509432 · DOI
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Deep Learning with Differential Privacy
Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K., & Zhang, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978318 · Cited by 6,578
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Privacy-preserving data mining. https://app.cochat.ai/papers/10.1145/335191.335438
- The paper
- Agrawal, R., & Srikant, R. (2000). Privacy-preserving data mining. ACM SIGMOD Record. https://doi.org/10.1145/335191.335438
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.