Sciweavers

Share
DKE
2008

A MaxMin approach for hiding frequent itemsets

8 years 3 months ago
A MaxMin approach for hiding frequent itemsets
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. Experimental results indicate the effectiveness of the proposed methodology both with respect to the hiding results as well as with respect to the time performance compared to similar state of the art approaches.
George V. Moustakides, Vassilios S. Verykios
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DKE
Authors George V. Moustakides, Vassilios S. Verykios
Comments (0)
books