Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
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.

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/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.

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

  • Mining association rules between sets of items in large databases

    Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 1×

    “Patterns (e.g. itemsets [4] and sequential patterns [5] in transactions data, subgraphs [26] in graphical data, episodes in event streams [20]) are local structures in data that capture correlations among a small number of attributes or variables.”
    Background
  • k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY

    SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×

    “While there is extensive work on privacy breach when the complete data set is published [25, 3, 7], studying privacy breach when only certain statistics about data are revealed is relatively new [11, 10].”
    Background
  • 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

    Self-citation
  • Top 10 algorithms in data mining

    Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667 · cited 1×

    “The Apriori algorithm [2, 15] for FIM is regarded as one of the most successful of techniques in data mining [25].”
    Method

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

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.