Collusion-Free Privacy Preserving Data Mining

2012 ◽  
pp. 269-284
Author(s):  
T. Purusothaman ◽  
M. Rajalakshmi ◽  
S. Pratheeba
Keyword(s):  
Data Mining ◽  
Privacy Preserving ◽  
Frequent Itemsets ◽  
Data Sources ◽  
Sensitive Information ◽  
Distributed Data ◽  
Distributed Environment ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Distributed Association

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.

Collusion-Free Privacy Preserving Data Mining

2010 ◽  
Vol 6 (4) ◽  
pp. 30-45 ◽  
Author(s):  
M. Rajalakshmi ◽  
T. Purusothaman ◽  
S. Pratheeba
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Privacy Preserving ◽  
Frequent Itemsets ◽  
Data Sources ◽  
Sensitive Information ◽  
Distributed Data ◽  
Distributed Environment ◽  
Rule Mining ◽  
Privacy Preserving Data Mining

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.

Study on distributed privacy preserving data mining

2014 ◽  
Vol 11 (2) ◽  
pp. 163-170
Author(s):  
Binli Wang ◽  
Yanguang Shen
Keyword(s):  
Data Mining ◽  
Data Privacy ◽  
Rapid Development ◽  
Privacy Preserving ◽  
Future Research ◽  
Distributed Data ◽  
Distributed Environment ◽  
Privacy Preserving Data Mining ◽  
Advantages And Disadvantages ◽  
Future Research Directions

Recently, with the rapid development of network, communications and computer technology, privacy preserving data mining (PPDM) has become an increasingly important research in the field of data mining. In distributed environment, how to protect data privacy while doing data mining jobs from a large number of distributed data is more far-researching. This paper describes current research of PPDM at home and abroad. Then it puts emphasis on classifying the typical uses and algorithms of PPDM in distributed environment, and summarizing their advantages and disadvantages. Furthermore, it points out the future research directions in the field.

Association Rule Hiding in Privacy Preserving Data Mining

2018 ◽  
Vol 12 (3) ◽  
pp. 141-163 ◽  
Author(s):  
S. Vijayarani Mohan ◽  
Tamilarasi Angamuthu
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Association Rules ◽  
Association Rule ◽  
Privacy Preserving ◽  
Sensitive Information ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Research Directions ◽  
Marketing Information

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.

Privacy Preserving Data Mining, Concepts, Techniques, and Evaluation Methodologies

2008 ◽  
pp. 2379-2401 ◽  
Author(s):  
Igor Nai Fovino
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
Privacy Preserving ◽  
Research Field ◽  
Sensitive Information ◽  
Discovery Process ◽  
Privacy Preserving Data Mining ◽  
Mining Technology ◽  
Evaluation Methodologies ◽  
New Research

Intense work in the area of data mining technology and in its applications to several domains has resulted in the development of a large variety of techniques and tools able to automatically and intelligently transform large amounts of data in knowledge relevant to users. However, as with other kinds of useful technologies, the knowledge discovery process can be misused. It can be used, for example, by malicious subjects in order to reconstruct sensitive information for which they do not have an explicit access authorization. This type of “attack” cannot easily be detected, because, usually, the data used to guess the protected information, is freely accessible. For this reason, many research efforts have been recently devoted to addressing the problem of privacy preserving in data mining. The mission of this chapter is therefore to introduce the reader in this new research field and to provide the proper instruments (in term of concepts, techniques and example) in order to allow a critical comprehension of the advantages, the limitations and the open issues of the Privacy Preserving Data Mining Techniques.

DCT Image Steganography Analysis for Privacy Preserving Data Mining

2016 ◽  
Vol 7 (3) ◽  
pp. 1-9 ◽  
Author(s):  
Sahar A. El-Rahman Ismail ◽  
Dalal Al Makhdhub ◽  
Amal A. Al Qahtani ◽  
Ghadah A. Al Shabanat ◽  
Nouf M. Omair ◽  
...  
Keyword(s):  
Data Mining ◽  
Information Hiding ◽  
Signal To Noise Ratio ◽  
Low Frequency ◽  
Privacy Preserving ◽  
Sensitive Information ◽  
Signal To Noise ◽  
Privacy Preserving Data Mining ◽  
Frequency Domains ◽  
Privacy And Confidentiality

We live in an information era where sensitive information extracted from data mining systems is vulnerable to exploitation. Privacy preserving data mining aims to prevent the discovery of sensitive information. Information hiding systems provide excellent privacy and confidentiality, where securing confidential communications in public channels can be achieved using steganography. A cover media are exploited using steganography techniques where they hide the payload's existence within appropriate multimedia carriers. This paper aims to study steganography techniques in spatial and frequency domains, and then analyzes the performance of Discrete Cosine Transform (DCT) based steganography using the low frequency and the middle frequency to compare their performance using Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE). The experimental results show that middle frequency has the larger message capacity and best performance.

Privacy Preserving Data Mining, Concepts, Techniques, and Evaluation Methodologies

2008 ◽  
pp. 277-301
Author(s):  
Igor Nai Fovino
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
Privacy Preserving ◽  
Research Field ◽  
Sensitive Information ◽  
Discovery Process ◽  
Privacy Preserving Data Mining ◽  
Mining Technology ◽  
Evaluation Methodologies ◽  
New Research

Intense work in the area of data mining technology and in its applications to several domains has resulted in the development of a large variety of techniques and tools able to automatically and intelligently transform large amounts of data in knowledge relevant to users. However, as with other kinds of useful technologies, the knowledge discovery process can be misused. It can be used, for example, by malicious subjects in order to reconstruct sensitive information for which they do not have an explicit access authorization. This type of “attack” cannot easily be detected, because, usually, the data used to guess the protected information, is freely accessible. For this reason, many research efforts have been recently devoted to addressing the problem of privacy preserving in data mining. The mission of this chapter is therefore to introduce the reader in this new research field and to provide the proper instruments (in term of concepts, techniques and example) in order to allow a critical comprehension of the advantages, the limitations and the open issues of the Privacy Preserving Data Mining Techniques.

Comprehensive Survey on Privacy Preserving Association Rule Mining: Models, Approaches, Techniques and Algorithms

2014 ◽  
Vol 23 (05) ◽  
pp. 1450004 ◽  
Author(s):  
Ibrahim S. Alwatban ◽  
Ahmed Z. Emam
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Research Area ◽  
Privacy Preserving ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Comprehensive Survey ◽  
New Research

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.

Research on Association Rule Mining Algorithm Based on Distributed Data

2014 ◽  
Vol 998-999 ◽  
pp. 899-902 ◽  
Author(s):  
Cheng Luo ◽  
Ying Chen
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Large Scale ◽  
Frequent Itemsets ◽  
Network Communication ◽  
Data Mining Algorithm ◽  
Distributed Data ◽  
Rule Mining ◽  
Mining Algorithm

Existing data miming algorithms have mostly implemented data mining under centralized environment, but the large-scale database exists in the distributed form. According to the existing problem of the distributed data mining algorithm FDM and its improved algorithms, which exist the problem that the frequent itemsets are lost and network communication cost too much. This paper proposes a association rule mining algorithm based on distributed data (ARADD). The mapping marks the array mechanism is included in the ARADD algorithm, which can not only keep the integrity of the frequent itemsets, but also reduces the cost of network communication. The efficiency of algorithm is proved in the experiment.

Sign in / Sign up

Export Citation Format

Share Document