PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Atzori M., Bonchi F., Giannotti F., Pedreschi D. Towards low-perturbation anonymity preserving pattern discovery. In: ACM Symposium on Applied Computing (Dijon, France, 23-27 April 2006). Proceedings, pp. 588 - 592. ACM SAC, 2006.
 
 
Abstract
(English)
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. We have recently shown that the above belief is ill-founded: by shifting the concept of k-anonymity from data to patterns, we have formally characterized the notion of a threat to anonymity in the context of frequent itemsets mining, and provided a methodology to efficiently and effectively identify such threats that might arise from the disclosure of a set of frequent itemsets. In our previous paper we have introduced a first, naive strategy (named suppressive) to sanitize such threats. In this paper we develop a novel sanitization strategy, named additive, which outperforms the previous one in terms of the introduced distortion and has the interesting feature of maintaining the original set of frequent itemsets unchanged, while modifying only the corresponding support values.
URL: http://www.di.unipi.it/~atzori/
Subject Data mining
Frequent Patterns Mining
Data Privacy
Algorithms
H.2.8 Database Applications. Data mining


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional