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

Atefe Ramezani; Mohammad Naderi Dehkordi and Faramarz Safi Esfahani

doi:10.17485/ijst/2014/v7i6.17

Article

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

VIEWS 756
PDF 346

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2014/v7i6.17

Year: 2014, Volume: 7, Issue: 6, Pages: 826–832

Original Article

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

Atefe Ramezani* , Mohammad Naderi Dehkordi and Faramarz Safi Esfahani

Department of Computer Engineering, Islamic Azad University–Najafabad Branch, Iran; ati.ram66@gmail.com, naderi@iaun.ac.ir, fsafi@iaun.ac.ir

This work is licensed under a Creative Commons Attribution 4.0 International License.

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