Introducing an algorithm for use to hide sensitive association rules through perturb technique

Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on...

Full description

Bibliographic Details
Main Authors: M. Sakenian Dehkordi, M. Naderi Dehkordi
Format: Article
Language:English
Published: Shahrood University of Technology 2016-07-01
Series:Journal of Artificial Intelligence and Data Mining
Subjects:
Online Access:http://jad.shahroodut.ac.ir/article_572_7982a87c25f836a0f73892d7d914e195.pdf
_version_ 1818008798582800384
author M. Sakenian Dehkordi
M. Naderi Dehkordi
author_facet M. Sakenian Dehkordi
M. Naderi Dehkordi
author_sort M. Sakenian Dehkordi
collection DOAJ
description Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the association rules is one of the methods to preserve privacy and it is a main subject in the field of data mining and database security, for which several algorithms with different approaches are presented so far. An algorithm to hide sensitive association rules with a heuristic approach is presented in this article, where the Perturb technique based on reducing confidence or support rules is applied with the attempt to remove the considered item from a transaction with the highest weight by allocating weight to the items and transactions. Efficiency is measured by the failure criteria of hiding, number of lost rules and ghost rules, and execution time. The obtained results of this study are assessed and compared with two known FHSAR and RRLR algorithms, based on two real databases (dense and sparse). The results indicate that the number of lost rules in all experiments are reduced by 47% in comparison with RRLR and reduced by 23% in comparison with FHSAR. Moreover, the other undesirable side effects, in this proposed algorithm in the worst case are equal to that of the base algorithms.
first_indexed 2024-04-14T05:34:47Z
format Article
id doaj.art-6bdf247e70e84f83b6b369cb95e6d464
institution Directory Open Access Journal
issn 2322-5211
2322-4444
language English
last_indexed 2024-04-14T05:34:47Z
publishDate 2016-07-01
publisher Shahrood University of Technology
record_format Article
series Journal of Artificial Intelligence and Data Mining
spelling doaj.art-6bdf247e70e84f83b6b369cb95e6d4642022-12-22T02:09:42ZengShahrood University of TechnologyJournal of Artificial Intelligence and Data Mining2322-52112322-44442016-07-014221922710.5829/idosi.JAIDM.2016.04.02.10572Introducing an algorithm for use to hide sensitive association rules through perturb techniqueM. Sakenian Dehkordi0M. Naderi Dehkordi1Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Isfahan, Iran.Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Isfahan, Iran.Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the association rules is one of the methods to preserve privacy and it is a main subject in the field of data mining and database security, for which several algorithms with different approaches are presented so far. An algorithm to hide sensitive association rules with a heuristic approach is presented in this article, where the Perturb technique based on reducing confidence or support rules is applied with the attempt to remove the considered item from a transaction with the highest weight by allocating weight to the items and transactions. Efficiency is measured by the failure criteria of hiding, number of lost rules and ghost rules, and execution time. The obtained results of this study are assessed and compared with two known FHSAR and RRLR algorithms, based on two real databases (dense and sparse). The results indicate that the number of lost rules in all experiments are reduced by 47% in comparison with RRLR and reduced by 23% in comparison with FHSAR. Moreover, the other undesirable side effects, in this proposed algorithm in the worst case are equal to that of the base algorithms.http://jad.shahroodut.ac.ir/article_572_7982a87c25f836a0f73892d7d914e195.pdfdata miningAssociation rule hidingPrivacy preserving data mining
spellingShingle M. Sakenian Dehkordi
M. Naderi Dehkordi
Introducing an algorithm for use to hide sensitive association rules through perturb technique
Journal of Artificial Intelligence and Data Mining
data mining
Association rule hiding
Privacy preserving data mining
title Introducing an algorithm for use to hide sensitive association rules through perturb technique
title_full Introducing an algorithm for use to hide sensitive association rules through perturb technique
title_fullStr Introducing an algorithm for use to hide sensitive association rules through perturb technique
title_full_unstemmed Introducing an algorithm for use to hide sensitive association rules through perturb technique
title_short Introducing an algorithm for use to hide sensitive association rules through perturb technique
title_sort introducing an algorithm for use to hide sensitive association rules through perturb technique
topic data mining
Association rule hiding
Privacy preserving data mining
url http://jad.shahroodut.ac.ir/article_572_7982a87c25f836a0f73892d7d914e195.pdf
work_keys_str_mv AT msakeniandehkordi introducinganalgorithmforusetohidesensitiveassociationrulesthroughperturbtechnique
AT mnaderidehkordi introducinganalgorithmforusetohidesensitiveassociationrulesthroughperturbtechnique