A max-min approach for hiding frequent itemsets
Ημερομηνία
2006Λέξη-κλειδί
Επιτομή
In this paper we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) relies on the maxmin criterion which is a method in decision theory for maximizing the minimum gain and (b) builds upon the border theory of frequent itemsets. © 2006 IEEE.