Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction

This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule for each selective transaction. Finally, they qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules.