The Community for Technology Leaders
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) (2006)
Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
ISBN: 0-7695-2702-7
pp: 502-506
George V. Moustakides , University of Thessaly, Volos, GREECE
Vassilios S. Verykios , University of Thessaly, Volos, GREECE
ABSTRACT
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.
INDEX TERMS
null
CITATION

G. V. Moustakides and V. S. Verykios, "A Max-Min Approach for Hiding Frequent Itemsets," Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)(ICDMW), Hong Kong, China, 2006, pp. 502-506.
doi:10.1109/ICDMW.2006.8
93 ms
(Ver 3.3 (11022016))