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 con...

Full description

Saved in:
Bibliographic Details
Published in:Indian journal of science and technology 2014-06, Vol.7 (6), p.826-832
Main Author: Ramezani, Atefe
Format: Article
Language:English
Subjects:
Algorithms
Confidence
Data mining
Preserving
Privacy
Thresholds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0974-6846
0974-5645
DOI:10.17485/ijst/2014/v7i6.17