The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Framework for Evaluating Privacy Preserving Data Mining Algorithms*
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
Beyond Accuracy: What Data Quality Means to Data Consumers
Wang, R. Y., & Strong, D. M. (1996) · Journal of Management Information Systems · doi:10.1080/07421222.1996.11518099 · Cited by 4,672
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
Cited by
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Self-citationA General Survey of Privacy-Preserving Data Mining Models and Algorithms
Aggarwal, C. C., & Yu, P. S. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_2 · Cited by 469
Kashani, S. M. Z., & Hamidzadeh, J. (2020) · Soft Computing · doi:10.1007/s00500-019-04605-z · Cited by 25
Data Integration Issues and Opportunities in Biological XML Data Management
Mesiti, M., Ruiz, E. J., Sanz, I., Llavori, R. B., Valentini, G., Perlasca, P., & Manset, D. (2010) · Open and Novel Issues in XML Database Applications · doi:10.4018/978-1-60566-308-1.ch012 · Cited by 4
Metadata
- Authors
- Bertino, E., Fovino, I. N., & Provenza, L. P.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2005-08-18
- Volume
- 11
- Issue
- 2
- Pages
- 121-154
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1971196771
- Cited by
- 174
- References
- 2
- FWCI
- 12.02
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Framework for Evaluating Privacy Preserving Data Mining Algorithms*. https://app.cochat.ai/papers/10.1007/s10618-005-0006-6
- The paper
- Bertino, E., Fovino, I. N., & Provenza, L. P. (2005). A Framework for Evaluating Privacy Preserving Data Mining Algorithms*. Data Mining and Knowledge Discovery. https://doi.org/10.1007/s10618-005-0006-6
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.