scholarly journals A Clustering Approach for the l-Diversity Model in Privacy Preserving Data Mining Using Fractional Calculus-Bacterial Foraging Optimization Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Pawan R. Bhaladhare ◽  
Devesh C. Jinwala
Keyword(s):  
Data Mining ◽  
Fractional Calculus ◽  
Private Information ◽  
Privacy Preservation ◽  
Clustering Algorithms ◽  
Privacy Preserving ◽  
Information Loss ◽  
Bacterial Foraging Optimization ◽  
Privacy Preserving Data Mining ◽  
Computational Performance

In privacy preserving data mining, the l-diversity and k-anonymity models are the most widely used for preserving the sensitive private information of an individual. Out of these two, l-diversity model gives better privacy and lesser information loss as compared to the k-anonymity model. In addition, we observe that numerous clustering algorithms have been proposed in data mining, namely, k-means, PSO, ACO, and BFO. Amongst them, the BFO algorithm is more stable and faster as compared to all others except k-means. However, BFO algorithm suffers from poor convergence behavior as compared to other optimization algorithms. We also observed that the current literature lacks any approaches that apply BFO with l-diversity model to realize privacy preservation in data mining. Motivated by this observation, we propose here an approach that uses fractional calculus (FC) in the chemotaxis step of the BFO algorithm. The FC is used to boost the computational performance of the algorithm. We also evaluate our proposed FC-BFO and BFO algorithms empirically, focusing on information loss and execution time as vital metrics. The experimental evaluation shows that our proposed FC-BFO algorithm derives an optimal cluster as compared to the original BFO algorithm and existing clustering algorithms.

A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

2019 ◽  
pp. 587-608
Author(s):  
Pawan R. Bhaladhare ◽  
Devesh C. Jinwala
Keyword(s):  
Data Mining ◽  
Fractional Calculus ◽  
Optimization Algorithm ◽  
Information Loss ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Individual Privacy ◽  
Clustering Approach ◽  
Bacterial Foraging Optimization Algorithm ◽  
Optimal Cluster

A tremendous amount of personal data of an individual is being collected and analyzed using data mining techniques. Such collected data, however, may also contain sensitive data about an individual. Thus, when analyzing such data, individual privacy can be breached. Therefore, to preserve individual privacy, one can find numerous approaches proposed for the same in the literature. One of the solutions proposed in the literature is k-anonymity which is used along with the clustering approach. During the investigation, the authors observed that the k-anonymization based clustering approaches all the times result in the loss of information. This paper presents a fractional calculus-based bacterial foraging optimization algorithm (FC-BFO) to generate an optimal cluster. In addition to this, the authors utilize the concept of fractional calculus (FC) in the chemotaxis step of a bacterial foraging optimization (BFO) algorithm. The main objective is to improve the optimization ability of the BFO algorithm. The authors also evaluate their proposed FC-BFO algorithm, empirically, focusing on information loss and execution time as a vital metric. The experimental evaluations show that our proposed FC-BFO algorithm generates an optimal cluster with lesser information loss as compared with the existing clustering approaches.

A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

2016 ◽  
Vol 10 (1) ◽  
pp. 45-65 ◽  
Author(s):  
Pawan R. Bhaladhare ◽  
Devesh C. Jinwala
Keyword(s):  
Data Mining ◽  
Fractional Calculus ◽  
Optimization Algorithm ◽  
Information Loss ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Individual Privacy ◽  
Clustering Approach ◽  
Bacterial Foraging Optimization Algorithm ◽  
Optimal Cluster

A tremendous amount of personal data of an individual is being collected and analyzed using data mining techniques. Such collected data, however, may also contain sensitive data about an individual. Thus, when analyzing such data, individual privacy can be breached. Therefore, to preserve individual privacy, one can find numerous approaches proposed for the same in the literature. One of the solutions proposed in the literature is k-anonymity which is used along with the clustering approach. During the investigation, the authors observed that the k-anonymization based clustering approaches all the times result in the loss of information. This paper presents a fractional calculus-based bacterial foraging optimization algorithm (FC-BFO) to generate an optimal cluster. In addition to this, the authors utilize the concept of fractional calculus (FC) in the chemotaxis step of a bacterial foraging optimization (BFO) algorithm. The main objective is to improve the optimization ability of the BFO algorithm. The authors also evaluate their proposed FC-BFO algorithm, empirically, focusing on information loss and execution time as a vital metric. The experimental evaluations show that our proposed FC-BFO algorithm generates an optimal cluster with lesser information loss as compared with the existing clustering approaches.

scholarly journals SW-SDF based privacy preserving data classification

2013 ◽  
Vol 4 (3) ◽  
pp. 813-820
Author(s):  
Kiran P ◽  
Kavya N. P.
Keyword(s):  
Privacy Preservation ◽  
Data Classification ◽  
Privacy Preserving ◽  
Information Loss ◽  
Personal Privacy ◽  
Privacy Preserving Data Mining ◽  
The Core ◽  
Sensitive Attribute ◽  
Mining Algorithms

The core objective of privacy preserving data mining is to preserve the confidentiality of individual even after mining. The basic advantage of personalized privacy preservation is that the information loss is very less as compared with other privacy preservation algorithms. These algorithms how ever have not been designed for specific mining algorithms. SW-SDF personalized privacy preservation uses two flags SW and SDF. SW is used for assigning a weight for the sensitive attribute and SDF for sensitive disclosure which is accepted from individual. In this paper we have designed an algorithm which uses SW-SDF personal privacy preservation for data classification. This method ensures privacy and classification of data.

scholarly journals DATA PROCESSING THROUGH AN ADDITIVE ROTATIONAL PERTURBATION TECHNIQUE IN A SECURED ENVIRONMENT OF PPRIVACY

2021 ◽  
Vol 9 (2) ◽  
pp. 131-135
Author(s):  
G. Srinivas Reddy, Et. al.
Keyword(s):  
Data Mining ◽  
Privacy Preservation ◽  
Web Applications ◽  
Perturbation Technique ◽  
Privacy Preserving ◽  
Security And Privacy ◽  
Experimental Result ◽  
Perturbation Approach ◽  
Privacy Preserving Data Mining ◽  
Rotational Perturbation

As the usage of internet and web applications emerges faster, security and privacy of the data is the most challenging issue which we are facing, leading to the possibility of being easily damaged. Various conventional techniques are used for privacy preservation like condensation, randomization and tree structure etc., the limitations of the existing approaches are, they are not able to maintain proper balance between the data utility and privacy and it may have the problem with privacy violations. This paper presents an Additive Rotation Perturbation approach for Privacy Preserving Data Mining (PPDM). In this proposed work, various dataset from UCI Machine Learning Repository was collected and it is protected with a New Additive Rotational Perturbation Technique under Privacy Preserving Data Mining. Experimental result shows that the proposed algorithm’s strength is high for all the datasets and it is estimated using the DoV (Difference of Variance) method.

scholarly journals Survey on privacy preserving data mining techniques in health care databases

2014 ◽  
Vol 6 (1) ◽  
pp. 33-55 ◽  
Author(s):  
Tamás Zoltán Gál ◽  
Gábor Kovács ◽  
Zsolt T. Kardkovács
Keyword(s):  
Data Mining ◽  
Health Care ◽  
Case Studies ◽  
Private Information ◽  
Privacy Preservation ◽  
State Of The Art ◽  
Legal Environment ◽  
Privacy Preserving Data Mining ◽  
Data Anonymization ◽  
Health Care Data

Abstract In health care databases, there are tireless and antagonistic interests between data mining research and privacy preservation, the more you try to hide sensitive private information, the less valuable it is for analysis. In this paper, we give an outlook on data anonymization problems by case studies. We give a summary on the state-of-the-art health care data anonymization issues including legal environment and expectations, the most common attacking strategies on privacy, and the proposed metrics for evaluating usefulness and privacy preservation for anonymization. Finally, we summarize the strength and the shortcomings of different approaches and techniques from the literature based on these evaluations.

Business Collaboration by Privacy-Preserving Clustering

2010 ◽  
pp. 113-133
Author(s):  
Stanley R.M. Oliveira ◽  
Osmar R. Zaïane
Keyword(s):  
Data Mining ◽  
Cluster Analysis ◽  
Privacy Preservation ◽  
Clustering Algorithms ◽  
Random Projection ◽  
Privacy Preserving ◽  
Mathematical Foundation ◽  
Privacy Concerns ◽  
Privacy Requirements ◽  
Data Owner

The sharing of data is beneficial in data mining applications and widely acknowledged as advantageous in business. However, information sharing can become controversial and thwarted by privacy regulations and other privacy concerns. Rather than simply hindering data owners from sharing information for data analysis, a solution could be designed to meet privacy requirements and guarantee valid data clustering results. To achieve this dual goal, this chapter introduces a method for privacy-preserving clustering, called Dimensionality Reduction-Based Transformation (DRBT). This method relies on the intuition behind random projection to protect the underlying attribute values subjected to cluster analysis. It is shown analytically and empirically that transforming a dataset using DRBT, a data owner can achieve privacy preservation and get accurate clustering with little overhead of communication cost. The advantages of such a method are: it is independent of distance-based clustering algorithms; it has a sound mathematical foundation; and it does not require CPU-intensive operations.

The Study of Privacy Preserving Data Mining Technology for Information Security

2014 ◽  
Vol 556-562 ◽  
pp. 3532-3535
Author(s):  
Heng Li ◽  
Xue Fang Wu
Keyword(s):  
Data Mining ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Rapid Development ◽  
Privacy Preserving ◽  
Future Research ◽  
Privacy Preserving Data Mining ◽  
Mining Technology ◽  
Network Database ◽  
Use Of Data

With the rapid development of computer technology and the popularity of the network, database scale, scope and depth of the constantly expanding, which has accumulated vast amounts of different forms of stored data. The use of data mining technology can access valuable information from a lot of data. Privacy preserving has been one of the greater concerns in data mining. Privacy preserving data mining has a rapid development in a short year. But it still faces many challenges in the future. A number of methods and techniques have been developed for privacy preserving data mining. This paper analyzed the representative techniques for privacy preservation. Finally the present problems and directions for future research are discussed.

Sensitive Items in Privacy Preserving — Association Rule Mining

2008 ◽  
Vol 07 (01) ◽  
pp. 31-35
Author(s):  
K. Duraiswamy ◽  
N. Maheswari
Keyword(s):  
Data Mining ◽  
Private Information ◽  
Association Rule ◽  
Association Rule Mining ◽  
Privacy Preserving ◽  
Data Input ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Privacy-preserving has recently been proposed in response to the concerns of preserving personal or sensible information derived from data-mining algorithms. For example, through data-mining, sensible information such as private information or patterns may be inferred from non-sensible information or unclassified data. As large repositories of data contain confidential rules that must be protected before published, association rule hiding becomes one of important privacy preserving data-mining problems. There have been two types of privacy concerning data-mining. Output privacy tries to hide the mining results by minimally altering the data. Input privacy tries to manipulate the data so that the mining result is not affected or minimally affected. For some applications certain sensitive predictive rules are hidden that contain given sensitive items. To identify the sensitive items an algorithm SENSITEM is proposed. The results of the work have been given.

Sign in / Sign up

Export Citation Format

Share Document