The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Top-Down Specialization for Information and Privacy Preservation
Abstract
Releasing person-specific data in its most specific state poses a threat to individual privacy. This paper presents a practical and efficient algorithm for determining a generalized version of data that masks sensitive information and remains useful for modelling classification. The generalization of data is implemented by specializing or detailing the level of information in a top-down manner until a minimum privacy requirement is violated. This top-down specialization is natural and efficient for handling both categorical and continuous attributes. Our approach exploits the fact that data usually contains redundant structures for classification. While generalization may eliminate some structures, other structures emerge to help. Our results show that quality of classification can be preserved even for highly restrictive privacy requirements. This work has great applicability to both public and private sectors that share information for mutual benefits and productivity.
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
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Transforming data to satisfy privacy constraints
Iyengar, V. S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775089 · Cited by 790
Bottom-Up Generalization: A Data Mining Solution to Privacy Protection
Wang, K., Yu, P. S., & Chakraborty, S. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10110 · Cited by 311
Self-citationDatafly: a system for providing anonymity in medical data
Sweeney, L. (1998) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35285-5_22 · Cited by 145
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
Self-citationIncognito: efficient full-domain K-anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066164 · Cited by 1,070
Personalized privacy preservation
Xiao, X., & Tao, Y. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142500 · Cited by 670
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Wong, R. C.-W., Li, J., Fu, A. W.-C., & Wang, K. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150499 · Cited by 625
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
Self-citation
Metadata
- Authors
- Fung, B. C. M., Wang, K., & Yu, P. S.
- Venue
- 21st International Conference on Data Engineering (ICDE'05)
- Publisher
- IEEE
- Published
- 2005-04-19
- Pages
- 205-216
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2162105856
- Cited by
- 576
- References
- 6
- FWCI
- 31.48
- 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: Top-Down Specialization for Information and Privacy Preservation. https://app.cochat.ai/papers/10.1109/icde.2005.143
- The paper
- Fung, B. C. M., Wang, K., & Yu, P. S. (2005). Top-Down Specialization for Information and Privacy Preservation. 21st International Conference on Data Engineering (ICDE'05). https://doi.org/10.1109/icde.2005.143
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.