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

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

Discovering frequent patterns in sensitive data

Bhaskar, Raghav, Laxman, Srivatsan, Smith, Adam, Thakurta, Abhradeep·2010·Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

Discovering frequent patterns from data is a popular exploratory technique in datamining. However, if the data are sensitive (e.g., patient health records, user behavior records) releasing information about significant patterns or trends carries significant risk to privacy. This paper shows how one can accurately discover and release the most significant patterns along with their frequencies in a data set containing sensitive information, while providing rigorous guarantees of privacy for the individuals whose information is stored there.

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.

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

Integrity signals

Registry

Crossref · 10.1145/1835804.1835869

Cites

4 of 4 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 4 references

Cited by

See all 227

Metadata

Authors
Bhaskar, R., Laxman, S., Smith, A., & Thakurta, A.
Venue
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2010-07-25
Pages
503-512
OpenAlex
W2164778205
Cited by
227
References
4
FWCI
14.29
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Discovering frequent patterns in sensitive data. https://app.cochat.ai/papers/10.1145/1835804.1835869
The paper
Bhaskar, R., Laxman, S., Smith, A., & Thakurta, A. (2010). Discovering frequent patterns in sensitive data. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1835804.1835869

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.