The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Anonymization of set-valued data via top-down, local generalization
Abstract
Set-valued data, in which a set of values are associated with an individual, is common in databases ranging from market basket data, to medical databases of patients' symptoms and behaviors, to query engine search logs. Anonymizing this data is important if we are to reconcile the conflicting demands arising from the desire to release the data for study and the desire to protect the privacy of individuals represented in the data. Unfortunately, the bulk of existing anonymization techniques, which were developed for scenarios in which each individual is associated with only one sensitive value, are not well-suited for set-valued data. In this paper we propose a top-down, partition-based approach to anonymizing set-valued data that scales linearly with the input size and scores well on an information-loss data quality metric. We further note that our technique can be applied to anonymize the infamous AOL query logs, and discuss the merits and challenges in anonymizing query logs using our approach.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Cited by
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“Specific DA methods have also been designed for relational data [262], set-valued data [151, 320], and image data [97, 239].”
BackgroundSlicing: A New Approach for Privacy Preserving Data Publishing
Li, T., Li, N., Zhang, J., & Molloy, I. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.236 · Cited by 312
Privacy-preserving trajectory data publishing by local suppression
Chen, R., Fung, B. C. M., Mohammed, N., Desai, B. C., & Wang, K. (2013) · Information Sciences · doi:10.1016/j.ins.2011.07.035 · Cited by 252
Metadata
- Authors
- He, Y., & Naughton, J. F.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 1
- Pages
- 934-945
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2132223977
- Cited by
- 211
- References
- 3
- FWCI
- 25.66
- 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: Anonymization of set-valued data via top-down, local generalization. https://app.cochat.ai/papers/10.14778/1687627.1687733
- The paper
- He, Y., & Naughton, J. F. (2009). Anonymization of set-valued data via top-down, local generalization. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1687627.1687733
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.