An Efficient Hhuarl Algorithm For Hiding On Intersection Lattice

Hiding high utility sensitive association rule is a fundamental issue for protecting security knowledge from being uncovered while sharing information outside the gatherings. In any case, this issue has not been thought about attentively. This paper expects to propose a novel procedure for hiding high utility sensitive association rules in view of intersection lattice. The methodology incorporates two steps:(i) The exchanges containing the sensitive rule and having the minimum utility are chosen as casualty exchanges; (ii) The casualty things are indicated in view of a heuristic such that altering them causes minimal effect on a lattice of high exchange weighted utility itemsets. Depending on those means, the algorithm named HHUARL for hiding high utility sensitive association rules is proposed. The analysis demonstrates that symptoms caused by HHUARL algorithm are worthy.