Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 2,961

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Privacy-preserving data mining

Agrawal, Rakesh, Srikant, Ramakrishnan · 2000 · ACM SIGMOD Record

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/335191.335438

Cites

38 of 38 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 25

  1. Agrawal Rakesh, 1992, Proc. of the VLDB Conference, 560
  2. Agrawal Rakesh, 1999, 5th Int'l Con}erence on Knowledge Discovery in Databases and Data Mining
  3. Barbara D., 1997, Jagadish, T. Johnson, R.Ng, V. Poosala, and K, Sevcik. The New Jersey Data Reduction Report. Data Bngrg. Bull., 20, 3
  4. Breiman L., 1984, Wadsworth
  5. Clifton C., 1996, ACId SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 15
  6. Cramer H., 1946, Mathematical Methods o{ Statistics
  7. Brankovic V., 1999, Data Warehousing and Knowledge Discovery Da WaK-99, 389
  8. Economist The, 1999, May
  9. Fisz Marek, 1963, Probability #heory and Mathematical Statistics
  10. Faloutsos C., 1997, Proc. of the Z3rd fat'{ Conference on Very Large Databases, 36
  11. Hine C., 1998, L42(2):#6-59
  12. Hagel John, 1999, Harvard Business School Press
  13. 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
  14. 10.5555/645911.673617 · doi:10.5555/645911.673617
  15. Mehta Manish, 1996, Avignon
  16. Michie D., 1994, Machine Learning, Neural and Statiatical Claasificatior# Ellis Horwood
  17. Office of the Information and Privacy Commission, 1998, Your Privacy
  18. Quinlan J. Ross, 1993, Morgan Kaufman
  19. Sharer John, 1996, Proc. ojf the #2nd lnt'l Conforesee on Very Large Databases
  20. Shoshani A., 1982, Proceedings of the Eighth International Conference on Very Large Databases (VLDB), 208
  21. Thearling Kurt, 1998, March
  22. 1997, August
  23. Westin A.F., 1998, Louis Harris &
  24. Westin A.F., 1998, Priwcy concerns &
  25. Westin A.F., 1999, Freebies and privacy: What net users think. Technical report

Cited by

See all 2,961

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.