Atefe Ramezani ¹, Mohammad Naderi Dehkordi ¹, Faramrz Safi Esfahani ¹

Affiliations
1 Department of Computer Engineering, Islamic Azad University–Najafabad Branch, IR

Abstract

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

Keywords

Association Rule Minig, Datamining, Privacy Preserving

Full Text