ASSOCIATION RULE BIDING BASED ON DISTANCE AND INTERSECTION LATTICE

This paper proposes a novel approach for hiding a set of sensitive association rules based on intersection lattice theory and distance concepts. It aims to examine the optimal distance from the top of the intersection lattice of frequent itemsets to the sensitive association rules (SR), as well as to the nonsensitive association rules, in order to hide SR in such a way that the data modifications cause the least side effects. The experiment indicates that the proposed algorithm achieves better results in minimizing side effects and complexity compared with the previous works.