The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Anonymization of Sparse High-Dimensional Data
Abstract
Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as k- anonymity and lscr-diversity, while minimizing the information loss incurred in the anonymizing process (i.e. maximize data utility). However, existing techniques adopt an indexing- or clustering- based approach, and work well for fixed-schema data, with low dimensionality. Nevertheless, certain applications require privacy-preserving publishing of transaction data (or basket data), which involves hundreds or even thousands of dimensions, rendering existing methods unusable. We propose a novel anonymization method for sparse high-dimensional data. We employ a particular representation that captures the correlation in the underlying data, and facilitates the formation of anonymized groups with low information loss. We propose an efficient anonymization algorithm based on this representation. We show experimentally, using real-life datasets, that our method clearly outperforms existing state-of-the-art in terms of both data utility and computational overhead.
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
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
A linear time implementation of the reverse Cuthill-McKee algorithm
Chan, W. M., & George, A. (1980) · BIT Numerical Mathematics · doi:10.1007/bf01933580 · Cited by 80
Cited by
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
k-automorphism: a general framework for privacy preserving network publication
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687734 · Cited by 409
Privacy-preserving anonymization of set-valued data
Terrovitis, M., Mamoulis, N., & Kalnis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453874 · Cited by 326
Self-citationSlicing: 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
- Ghinita, G., Tao, Y., & Kalnis, P.
- Venue
- 2008 IEEE 24th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2008-04
- Pages
- 715-724
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2084012970
- Cited by
- 188
- References
- 2
- FWCI
- 15.13
- 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: On the Anonymization of Sparse High-Dimensional Data. https://app.cochat.ai/papers/10.1109/icde.2008.4497480
- The paper
- Ghinita, G., Tao, Y., & Kalnis, P. (2008). On the Anonymization of Sparse High-Dimensional Data. 2008 IEEE 24th International Conference on Data Engineering. https://doi.org/10.1109/icde.2008.4497480
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.