Cited by 1,719Privacy-Preserving Technologies in DataMachine Learning and Data ClassificationInternet Traffic Analysis and Secure E-voting

Privacy-preserving data mining

Agrawal, Rakesh, Srikant, Ramakrishnan·2000·Proceedings of the 2000 ACM SIGMOD international conference on Management of data

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.

Integrity signals

Registry

Crossref · 10.1145/342009.335438

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Much of the literature assumes a priori knowledge of the set of quasi-identifiers, or seeks to discover them on a case-by-case basis.

    “Yet, for correlated or otherwise related variables (often referred to as proxies or quasiidentiiers), much of the literature assumes a priori knowledge of the set of quasi-identiiers [111], or seeks to discover them on a case-by-case basis (e.g.[150,217]) towards the idea of privacy preserving data mining [6].”

    From Fairness in machine learning: A survey (2024) · cites this paper as [6]

  • Sensitive data disclosure is a long-standing challenge in protecting anonymity when data is published and/or analysed.

    “In particular, sensitive data disclosure is a long-standing challenge in protecting anonymity when data is published and/or analysed [6,111,195].”

    From Fairness in machine learning: A survey (2024) · cites this paper as [6]

  • Fairlean implements several parity-based fairness measures and algorithms for binary classification and regression, as well as a dashboard to visualize disparity in accuracy and parity.

    “Fairlean 1 Implements several parity-based fairness measures and algorithms [1,2,6] for binary classiication and regression as well as a dashboard to visualize disparity in accuracy and parity.”

    From Fairness in machine learning: A survey (2024) · cites this paper as [6]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Agrawal, R., & Srikant, R.
Affiliations
IBM Research - Almaden (US)
Venue
Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
2000-05-16
Pages
439-450
ISSN
0730-8078 (ISSN-L)
OpenAlex
W4248358572
Cited by
1,719
References
27
Citations by year
2026: 10 · 2025: 33 · 2024: 34 · 2023: 39 · 2022: 60 · 2021: 74 · 2020: 63 · 2019: 52 · 2018: 73 · 2017: 62 · 2016: 68 · 2015: 73 · 2014: 99 · 2013: 98 · 2012: 99
FWCI
10.97
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGMOD International Conference on Management of Data (SIGMOD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
privacy-preserving data mining, decision tree classification, data perturbation, data reconstruction, aggregated data, classification accuracy

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