k-Anonymous patterns

29Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. In this paper we show that this belief is ill-founded. By shifting the concept of k-anonymity from data to patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery, and provide a methodology to efficiently and effectively identify all possible such threats that might arise from the disclosure of a set of extracted patterns. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Atzori, M., Bonchi, F., Giannotti, F., & Pedreschi, D. (2005). k-Anonymous patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3721 LNAI, pp. 10–21). Springer Verlag. https://doi.org/10.1007/11564126_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free