摘要：Hiding high utility and frequent itemset is the method used to preserve sensitive knowledge from being revealed by pattern mining process. Its goal is to remove sensitive high utility and frequent itemsets from a database before sharing it for data mining purposes while minimizing the side effects. The current methods succeed in the hiding goal but they cause high side effects. This paper proposes a novel algorithm, named HSUFIBL, that applies a heuristic for finding victim item based on the constrained intersection lattice theory. This algorithm specifies exactly the condition that allows the application of utility reduction or support reduction method, the victim item, and the victim transaction for the hiding process so that the process needs the fewest data modifications and gives the lowest number of lost non-sensitive itemsets. The experimental results indicate that the HSUFIBL algorithm achieves better performance than previous works in minimizing the side effect.
