Association Rule Hiding in Privacy Preserving Data Mining

2018 ◽  
Vol 12 (3) ◽  
pp. 141-163 ◽  
Author(s):  
S. Vijayarani Mohan ◽  
Tamilarasi Angamuthu

This article describes how privacy preserving data mining has become one of the most important and interesting research directions in data mining. With the help of data mining techniques, people can extract hidden information and discover patterns and relationships between the data items. In most of the situations, the extracted knowledge contains sensitive information about individuals and organizations. Moreover, this sensitive information can be misused for various purposes which violate the individual's privacy. Association rules frequently predetermine significant target marketing information about a business. Significant association rules provide knowledge to the data miner as they effectively summarize the data, while uncovering any hidden relations among items that hold in the data. Association rule hiding techniques are used for protecting the knowledge extracted by the sensitive association rules during the process of association rule mining. Association rule hiding refers to the process of modifying the original database in such a way that certain sensitive association rules disappear without seriously affecting the data and the non-sensitive rules. In this article, two new hiding techniques are proposed namely hiding technique based on genetic algorithm (HGA) and dummy items creation (DIC) technique. Hiding technique based on genetic algorithm is used for hiding sensitive association rules and the dummy items creation technique hides the sensitive rules as well as it creates dummy items for the modified sensitive items. Experimental results show the performance of the proposed techniques.

Author(s):  
S. Vijayarani Mohan ◽  
Tamilarasi Angamuthu

This article describes how privacy preserving data mining has become one of the most important and interesting research directions in data mining. With the help of data mining techniques, people can extract hidden information and discover patterns and relationships between the data items. In most of the situations, the extracted knowledge contains sensitive information about individuals and organizations. Moreover, this sensitive information can be misused for various purposes which violate the individual's privacy. Association rules frequently predetermine significant target marketing information about a business. Significant association rules provide knowledge to the data miner as they effectively summarize the data, while uncovering any hidden relations among items that hold in the data. Association rule hiding techniques are used for protecting the knowledge extracted by the sensitive association rules during the process of association rule mining. Association rule hiding refers to the process of modifying the original database in such a way that certain sensitive association rules disappear without seriously affecting the data and the non-sensitive rules. In this article, two new hiding techniques are proposed namely hiding technique based on genetic algorithm (HGA) and dummy items creation (DIC) technique. Hiding technique based on genetic algorithm is used for hiding sensitive association rules and the dummy items creation technique hides the sensitive rules as well as it creates dummy items for the modified sensitive items. Experimental results show the performance of the proposed techniques.


2014 ◽  
Vol 23 (05) ◽  
pp. 1450004 ◽  
Author(s):  
Ibrahim S. Alwatban ◽  
Ahmed Z. Emam

In recent years, a new research area known as privacy preserving data mining (PPDM) has emerged and captured the attention of many researchers interested in preventing the privacy violations that may occur during data mining. In this paper, we provide a review of studies on PPDM in the context of association rules (PPARM). This paper systematically defines the scope of this survey and determines the PPARM models. The problems of each model are formally described, and we discuss the relevant approaches, techniques and algorithms that have been proposed in the literature. A profile of each model and the accompanying algorithms are provided with a comparison of the PPARM models.


2010 ◽  
Vol 6 (4) ◽  
pp. 30-45 ◽  
Author(s):  
M. Rajalakshmi ◽  
T. Purusothaman ◽  
S. Pratheeba

Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing approaches, collusion among the participating sites reveal sensitive information about the other sites. In this paper, the authors propose a collusion-free algorithm for mining global frequent itemsets in a distributed environment with minimal communication among sites. This algorithm uses the techniques of splitting and sanitizing the itemsets and communicates to random sites in two different phases, thus making it difficult for the colluders to retrieve sensitive information. Results show that the consequence of collusion is reduced to a greater extent without affecting mining performance and confirms optimal communication among sites.


Author(s):  
G. Bhavani ◽  
S. Sivakumari

Data mining process extracts useful information from a large amount of data. The most interesting part of data mining is discovering the unseen patterns without unpacking sensitive knowledge. Privacy Preserving Data Mining abbreviated as PPDM deals with the issue of sustaining the privacy of information. This methodology covers the sensitive information from disclosure. PPDM techniques are established for hiding the sensitive information even after performing the data mining. One of the practices to hide the sensitive association rules is termed as association rule hiding. The main objective of association rule hiding algorithm is to slightly adjust the original database so that no sensitive association rule is derived from it. The following article presents a detailed survey of various association rule hiding techniques for preserving privacy in data mining. At first, different techniques developed by previous researchers are studied in detail. Then, a comparative analysis is carried out to know the limitations of each technique and then providing a suggestion for future improvement in association rule hiding for privacy preservation.


Author(s):  
Suma B. ◽  
Shobha G.

<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>


2013 ◽  
Vol 798-799 ◽  
pp. 541-544
Author(s):  
Gao Ming Yang ◽  
Jing Zhao Li ◽  
Shun Xiang Zhang

A number of privacy preserving techniques have been proposed recently in data mining. In this paper, we provide a review of the state-of-the-art methods for privacy preserving data mining. and discuss methods for randomization, secure multipart computation, and so on. We also make a classification for the privacy preserving data mining technologies, and analyze some works in this field, such as data distortion method for achieving privacy preserving association rule mining. Detailed evaluation criteria of privacy preserving algorithm were illustrated, which include algorithm performance, data utility, and privacy protection degree. Finally, the development of privacy preserving data mining for further directions is given.


Author(s):  
Madhu V. Ahluwalia ◽  
Aryya Gangopadhyay ◽  
Zhiyuan Chen

Association rule mining is an important data mining method that has been studied extensively by the academic community and has been applied in practice. In the context of association rule mining, the state-of-the-art in privacy preserving data mining provides solutions for categorical and Boolean association rules but not for quantitative association rules. This article fills this gap by describing a method based on discrete wavelet transform (DWT) to protect input data privacy while preserving data mining patterns for association rules. A comparison with an existing kd-tree based transform shows that the DWT-based method fares better in terms of efficiency, preserving patterns, and privacy.


2017 ◽  
Vol 4 (2) ◽  
pp. 63-80 ◽  
Author(s):  
Geeta S. Navale ◽  
Suresh N. Mali

The progress in the development of data mining techniques achieved in the recent years is gigantic. The collative data mining techniques makes the privacy preserving an important issue. The ultimate aim of the privacy preserving data mining is to extract relevant information from large amount of data base while protecting the sensitive information. The togetherness in the information retrieval with privacy and data quality is crucial. A detailed survey of the present methodologies for the association rule data mining and a review of the state of art method for privacy preserving association rule mining is presented in this paper. An analysis is provided based on the association rule mining algorithm techniques, objective measures, performance metrics and results achieved. The metrics and the short comings of the various existing technologies are also analysed. Finally, the authors present various research issues which can be useful for the researchers to accomplish further research on the privacy preserving association rule data mining.


2019 ◽  
Vol 8 (4) ◽  
pp. 11893-11899

Privacy-Preserving-Data-Mining (PPDM) is a novel study which goals to protect the secretive evidence also circumvent the revelation of the evidence through the records reproducing progression. This paper focused on the privacy preserving on vertical separated databases. The designed methodology for the subcontracted databases allows multiple data viewers besides vendors proficiently to their records securely without conceding the secrecy of the data. Privacy Preserving Association Rule-Mining (PPARM) is one method, which objects to pelt sensitivity of the association imperative. A new efficient approach lives the benefit since the strange optimizations algorithms for the delicate association rule hiding. It is required to get leak less information of the raw data. The evaluation of the efficient of the proposed method can be conducting on some experiments on different databases. Based on the above optimization algorithm, the modified algorithm is to optimize the association rules on vertically and horizontally separated database and studied their performance


Author(s):  
Geeta S. Navale ◽  
Suresh N. Mali

The progress in the development of data mining techniques achieved in the recent years is gigantic. The collative data mining techniques makes the privacy preserving an important issue. The ultimate aim of the privacy preserving data mining is to extract relevant information from large amount of data base while protecting the sensitive information. The togetherness in the information retrieval with privacy and data quality is crucial. A detailed survey of the present methodologies for the association rule data mining and a review of the state of art method for privacy preserving association rule mining is presented in this paper. An analysis is provided based on the association rule mining algorithm techniques, objective measures, performance metrics and results achieved. The metrics and the short comings of the various existing technologies are also analysed. Finally, the authors present various research issues which can be useful for the researchers to accomplish further research on the privacy preserving association rule data mining.


Sign in / Sign up

Export Citation Format

Share Document