Browsing by Subject "Constraint Satisfaction Problem"
Now showing items 1-1 of 1
-
A hybrid approach to frequent itemset hiding
(2007)In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent itemsets by (i) minimally extending the original database by a synthetically generated ...