loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Data Mining (ICDM'05)
Blocking Anonymity Threats Raised by Frequent Itemset Mining
Houston, Texas
November 27-November 30
ISBN: 0-7695-2278-5
Maurizio Atzori, ISTI - CNR and University of Pisa
Francesco Bonchi, ISTI - CNR
Fosca Giannotti, ISTI - CNR
Dino Pedreschi, University of Pisa
In this paper we study when the disclosure of datamining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty of our approach is that we focus on an objective definition of privacy compliance of patterns without any reference to a preconceived knowledge of what is sensitive and what is not, on the basis of the rather intuitive and realistic constraint that the anonymity of individuals should be guaranteed. In particular, the problem addressed here arises from the possibility of inferring from the output of frequent itemset mining (i.e., a set of itemsets with support larger than a threshold ?), the existence of patterns with very low support (smaller than an anonymity threshold k)[3]. In the following we develop a simple methodology to block such inference opportunities by introducing distortion on the dangerous patterns.
Citation:
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti, Dino Pedreschi, "Blocking Anonymity Threats Raised by Frequent Itemset Mining," icdm, pp.561-564, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.