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 Two phase privacy preserving data mining

2013 ◽  
Vol 2 (3) ◽  
Author(s):  
Pooja Gupta ◽  
Ashish Kumar
Keyword(s):  
Data Mining ◽  
Data Transmission ◽  
Privacy Preserving ◽  
Security And Privacy ◽  
Two Phase ◽  
Privacy Preserving Data Mining ◽  
Secure Data Transmission ◽  
Secure Environment ◽  
Two Phases ◽  
Secure Transmission

The paper proposes a framework to improve the privacy preserving data mining. The approach adopted provides security at both the ends i.e. at the data transmission time as well as in the data mining process using two phases. The secure data transmission is handled using elliptic curve cryptography (ECC) and the privacy is preserved using k-anonymity. The proposed framework ensures highly secure environment. We observed that the framework outperforms other approaches [8] discussed in the literature at both ends i.e. at security and privacy of data. Since most of the approaches have considered either secure transmission or privacy preserving data mining but very few have considered both. We have used WEKA 3.6.9 for experimentation and analysis of our approach. We have also analyzed the case of k-anonymity when the numbers of records in a group are less than k (hiding factor) by inserting fake records. The obtained results have shown the pattern that the insertion of fake records leads to more accuracy as compared to full suppression of records. Since, full suppression may hide important information in cases where records are less than k, on the other hand in the process of fake records insertion; records are available even if number of records in a group is less than k.

Web based Privacy Disclosure Threats and Control Techniques

2016 ◽  
pp. 334-341
Author(s):  
Tithi Hunka ◽  
Sital Dash ◽  
Prasant Kumar Pattnaik
Keyword(s):  
Data Mining ◽  
Privacy Preserving ◽  
Extensive Study ◽  
Security And Privacy ◽  
Sensitive Data ◽  
Privacy Preserving Data Mining ◽  
Web Based ◽  
Data Mining Techniques ◽  
The Public ◽  
And Control

Due to advancement of internet technologies, web based applications are gaining popularity day by day. Many organizations maintain large volumes of web site based data about individuals that may carry information that cannot be revealed to the public or researchers. While web-based applications are becoming increasingly pervasive by nature, they also present new security and privacy challenges. However, privacy threats effects negatively on sensitive data and possibly leads to the leakage of confidential information. More ever, privacy preserving data mining techniques allow us to protect the sensitive data before it gets published to the public by changing the original micro-data format and contents. This chapter is intended to undertake an extensive study on some ramified disclosure threats to the privacy and PPDM (privacy preserving data mining) techniques as a unified solution to protect against threats.

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.

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.

scholarly journals Effective Gene Patterned Association Rule Hiding Algorithm for Privacy Preserving Data Mining on Transactional Database

2017 ◽  
Vol 17 (3) ◽  
pp. 92-108 ◽  
Author(s):  
P. Gayathiri ◽  
B. Poorna
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Gene Selection ◽  
Perturbation Technique ◽  
Privacy Preserving ◽  
Data Perturbation ◽  
Data Mining Technique ◽  
Privacy Preserving Data Mining ◽  
Taxi Service

Abstract Association Rule Hiding methodology is a privacy preserving data mining technique that sanitizes the original database by hide sensitive association rules generated from the transactional database. The side effect of association rules hiding technique is to hide certain rules that are not sensitive, failing to hide certain sensitive rules and generating false rules in the resulted database. This affects the privacy of the data and the utility of data mining results. In this paper, a method called Gene Patterned Association Rule Hiding (GPARH) is proposed for preserving privacy of the data and maintaining the data utility, based on data perturbation technique. Using gene selection operation, privacy linked hidden and exposed data items are mapped to the vector data items, thereby obtaining gene based data item. The performance of proposed GPARH is evaluated in terms of metrics such as number of sensitive rules generated, true positive privacy rate and execution time for selecting the sensitive rules by using Abalone and Taxi Service Trajectory datasets.

Privacy-Preserving Data Mining

2009 ◽  
pp. 527-536 ◽  
Author(s):  
Alexandre Evfimievski ◽  
Tyrone Grandison
Keyword(s):  
Data Mining ◽  
Privacy Preservation ◽  
Statistical Processing ◽  
Privacy Preserving ◽  
Third Party ◽  
Data Publishing ◽  
Sensitive Information ◽  
Public Servants ◽  
Data Set ◽  
Privacy Preserving Data Mining

Privacy-preserving data mining (PPDM) refers to the area of data mining that seeks to safeguard sensitive information from unsolicited or unsanctioned disclosure. Most traditional data mining techniques analyze and model the data set statistically, in aggregated form, while privacy preservation is primarily concerned with protecting against disclosure of individual data records. This domain separation points to the technical feasibility of PPDM. Historically, issues related to PPDM were first studied by the national statistical agencies interested in collecting private social and economical data, such as census and tax records, and making it available for analysis by public servants, companies, and researchers. Building accurate socioeconomical models is vital for business planning and public policy. Yet, there is no way of knowing in advance what models may be needed, nor is it feasible for the statistical agency to perform all data processing for everyone, playing the role of a trusted third party. Instead, the agency provides the data in a sanitized form that allows statistical processing and protects the privacy of individual records, solving a problem known as privacypreserving data publishing. For a survey of work in statistical databases, see Adam and Wortmann (1989) and Willenborg and de Waal (2001).

Sign in / Sign up

Export Citation Format

Share Document