The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Efficient k-Anonymization Using Clustering Techniques
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.
Integrity signals
Registry
Cites
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.
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
(1967) · Cited by 23,719
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
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
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Huang, Z. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009769707641 · Cited by 2,505
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Cited by
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Abul, O., Bonchi, F., & Nanni, M. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497446 · Cited by 506
Security services using blockchains: a state of the art survey
Salman, T., Zolanvari, M., Erbad, A., Jain, R., & Samaka, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863956 · Cited by 502
Bhaladhare, P. R., & Jinwala, D. C. (2014) · Advances in Computer Engineering · doi:10.1155/2014/396529 · Cited by 286
A Review of Anonymization for Healthcare Data
Olatunji, I. E., Rauch, J., Katzensteiner, M., & Khosla, M. (2024) · Big Data · doi:10.1089/big.2021.0169 · Cited by 101
Metadata
- Authors
- Byun, J.-W., Kamra, A., Bertino, E., & Li, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 188-200
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2142291269
- Cited by
- 329
- References
- 32
- FWCI
- 13.44
- 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: Efficient k-Anonymization Using Clustering Techniques. https://app.cochat.ai/papers/10.1007/978-3-540-71703-4_18
- The paper
- Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007). Efficient k-Anonymization Using Clustering Techniques. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-71703-4_18
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.