The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Secure set intersection cardinality with application to association rule mining
Abstract
There has been concern over the apparent conflict between privacy and data mining. There is no inherent conflict, as most types of data mining produce summary results that do not reveal information about individuals. The process of data mining may use private data, leading to the potential for priv acy breaches. Secure Multiparty Computation shows that results can be produced without revealing the data used to generate them. The problem is that general techniques for secure multiparty computation do not scale to data-mining size computations. This paper presents an efficient protocol for securely determining the size of set intersection, and shows how this can be used to generate association rules where multiple parties have different (and private) information about the same set of individuals.
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.
Integrity signals
Registry
Cites
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.
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×
“The association rule mining problem can be formally stated as follows[2]: Let I = {i1, i2, · · · , im} be a set of literals, called items.”
BackgroundHandbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
Self-citation
Cited by
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Privacy-Preserving Data Mining: Methods, Metrics, and Applications
Mendes, R., & Vilela, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2706947 · Cited by 294
Privacy Preserving Naïve Bayes Classifier for Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.59 · Cited by 262
Self-citationPrivacy-preserving SVM classification
Vaidya, J., Yu, H., & Jiang, X. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0073-7 · Cited by 178
Self-citationPrivacy-Preserving Decision Trees over Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535706_11 · Cited by 144
Self-citationPrivacy-Preserving Gradient-Descent Methods
Han, S., Ng, W. K., Wan, L., & Lee, V. C. S. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.153 · Cited by 70
(2017) · IACR Cryptology ePrint Archive · Cited by 67
A Survey of Privacy-Preserving Methods Across Vertically Partitioned Data
Vaidya, J. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_14 · Cited by 46
Self-citation
Metadata
- Authors
- Vaidya, J., & Clifton, C.
- Venue
- Journal of Computer Security
- Publisher
- SAGE Publications
- Published
- 2005-10-04
- Volume
- 13
- Issue
- 4
- Pages
- 593-622
- ISSN
- 0926-227X (ISSN-L)
- 1875-8924
- OpenAlex
- W2145341289
- Cited by
- 222
- References
- 5
- FWCI
- 11.34
- 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.