Data Mining: Min–Max Normalization Based Data Perturbation Technique for Privacy Preservation

Author(s):  
Ajmeera Kiran ◽  
D. Vasumathi
2021 ◽  
Vol 9 (2) ◽  
pp. 131-135
Author(s):  
G. Srinivas Reddy, Et. al.

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.


2013 ◽  
Vol 10 (3) ◽  
pp. 1427-1433 ◽  
Author(s):  
M. Naga Lakshmi ◽  
Dr. K Sandhya Rani

Privacy preservation is a major concern when the application of data mining techniques to large repositories of data consists of personal, sensitive and confidential information. Singular Value Decomposition (SVD) is a matrix factorization method, which can produces perturbed data by efficiently removing unnecessary information for data mining. In this paper two hybrid methods are proposed which takes the advantage of existing techniques SVD and geometric data transformations in order to provide better privacy preservation. Reflection data perturbation and scaling data perturbation are familiar geometric data transformation methods which retains the statistical properties in the dataset. In hybrid method one, SVD and scaling data perturbation are used as a combination to obtain the distorted dataset. In hybrid method two, SVD and reflection data perturbation methods are used as a combination to obtain the distorted dataset. The experimental results demonstrated that the proposed hybrid methods are providing higher utility without breaching privacy.


2017 ◽  
Vol 17 (3) ◽  
pp. 92-108 ◽  
Author(s):  
P. Gayathiri ◽  
B. Poorna

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.


2016 ◽  
Vol 12 (12) ◽  
pp. 4601-4610 ◽  
Author(s):  
D. Palanikkumar ◽  
S. Priya ◽  
S. Priya

Privacy preservation is the data mining technique which is to be applied on the databases without violating the privacy of individuals. The sensitive attribute can be selected from the numerical data and it can be modified by any data modification technique. After modification, the modified data can be released to any agency. If they can apply data mining techniques such as clustering, classification etc for data analysis, the modified data does not affect the result. In privacy preservation technique, the sensitive data is converted into modified data using S-shaped fuzzy membership function. K-means clustering is applied for both original and modified data to get the clusters. t-closeness requires that the distribution of sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table. Earth Mover Distance (EMD) is used to measure the distance between the two distributions should be no more than a threshold t. Hence privacy is preserved and accuracy of the data is maintained.


2019 ◽  
Vol 29 (1) ◽  
pp. 1441-1452 ◽  
Author(s):  
G.K. Shailaja ◽  
C.V. Guru Rao

Abstract Privacy-preserving data mining (PPDM) is a novel approach that has emerged in the market to take care of privacy issues. The intention of PPDM is to build up data-mining techniques without raising the risk of mishandling of the data exploited to generate those schemes. The conventional works include numerous techniques, most of which employ some form of transformation on the original data to guarantee privacy preservation. However, these schemes are quite multifaceted and memory intensive, thus leading to restricted exploitation of these methods. Hence, this paper intends to develop a novel PPDM technique, which involves two phases, namely, data sanitization and data restoration. Initially, the association rules are extracted from the database before proceeding with the two phases. In both the sanitization and restoration processes, key extraction plays a major role, which is selected optimally using Opposition Intensity-based Cuckoo Search Algorithm, which is the modified format of Cuckoo Search Algorithm. Here, four research issues, such as hiding failure rate, information preservation rate, and false rule generation, and degree of modification are minimized using the adopted sanitization and restoration processes.


2019 ◽  
Vol 155 ◽  
pp. 686-691 ◽  
Author(s):  
Hitarth Shah ◽  
Vishruti Kakkad ◽  
Reema Patel ◽  
Nishant Doshi

Sign in / Sign up

Export Citation Format

Share Document