scholarly journals Protecting sensitive information utilizing an efficient association representative rule concealing algorithm for imbalance dataset

2019 ◽  
Vol 15 (1) ◽  
pp. 527
Author(s):  
Mylam Chinnappan Babu ◽  
Sankaralingam Pushpa
Keyword(s):  
Data Mining ◽  
Privacy Protection ◽  
Sensitive Information ◽  
Human Society ◽  
Resonance Theory ◽  
Sensitive Data ◽  
Adaptive Resonance ◽  
The People ◽  
Direct Discrimination ◽  
Indirect Discrimination

<span>In data mining, discrimination is the detrimental behavior of the people which is extensively studied in human society and economical science. However, there are negative perceptions about the data mining. Discrimination has two categories; one is direct, and another is indirect. The decisions depend on sensitive information attributes are named as direct discrimination, and the decisions which depend on non-sensitive information attributes are called as indirect discrimination which is strongly related with biased sensitive ones. Privacy protection has become another one of the most important problems in data mining investigation.  To overcome the above issues, an Efficient Association Representative Rule Concealing (EARRC) algorithm is proposed to protect sensitive information or knowledge and offer privacy protection with the classification of the sensitive data. Representative rule concealing is one kind of the privacy-preserving mechanisms to hide sensitive association rules. The objective of this paper is to reduce the alternation of the original database and perceive that there is no sensitive association rule is obtained. The proposed method hides the sensitive information by altering the database without modifying the support of the sensitive item. The EARRC is a type of association classification approach which integrates the benefits of both associative classification and rule-based PART (Projective Adaptive Resonance Theory) classification. Based on Experimental computations, proposed EARRC+PART classifier improves 1.06 NMI and 5.66 Accuracy compared than existing methodologies.</span>

scholarly journals Privacy Preserving Spatio-Temporal Databases Based on k-Anonymity

2020 ◽  
Vol 3 (SI1) ◽  
pp. SI82-SI94
Author(s):  
Anh Tuan Truong
Keyword(s):  
Data Mining ◽  
Privacy Protection ◽  
Location Privacy ◽  
Location Based Services ◽  
Sensitive Information ◽  
User Privacy ◽  
Location Data ◽  
Related Information ◽  
Spatio Temporal ◽  
Location Privacy Protection

The development of location-based services and mobile devices has lead to an increase in the location data. Through the data mining process, some valuable information can be discovered from location data. In the other words, an attacker may also extract some private (sensitive) information of the user and this may make threats against the user privacy. Therefore, location privacy protection becomes an important requirement to the success in the development of location-based services. In this paper, we propose a grid-based approach as well as an algorithm to guarantee k-anonymity, a well-known privacy protection approach, in a location database. The proposed approach considers only the information that has significance for the data mining process while ignoring the un-related information. The experiment results show the effectiveness of the proposed approach in comparison with the literature ones.

scholarly journals Data Privacy Preservation and Security Approaches for Sensitive Data in Big Data

2021 ◽  
Author(s):  
Rohit Ravindra Nikam ◽  
Rekha Shahapurkar
Keyword(s):  
Data Mining ◽  
Data Analytics ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Large Data ◽  
Research Area ◽  
Data Sets ◽  
Sensitive Information ◽  
Sensitive Data ◽  
Data Mining Techniques

Data mining is a technique that explores the necessary data is extracted from large data sets. Privacy protection of data mining is about hiding the sensitive information or identity of breach security or without losing data usability. Sensitive data contains confidential information about individuals, businesses, and governments who must not agree upon before sharing or publishing his privacy data. Conserving data mining privacy has become a critical research area. Various evaluation metrics such as performance in terms of time efficiency, data utility, and degree of complexity or resistance to data mining techniques are used to estimate the privacy preservation of data mining techniques. Social media and smart phones produce tons of data every minute. To decision making, the voluminous data produced from the different sources can be processed and analyzed. But data analytics are vulnerable to breaches of privacy. One of the data analytics frameworks is recommendation systems commonly used by e-commerce sites such as Amazon, Flip Kart to recommend items to customers based on their purchasing habits that lead to characterized. This paper presents various techniques of privacy conservation, such as data anonymization, data randomization, generalization, data permutation, etc. such techniques which existing researchers use. We also analyze the gap between various processes and privacy preservation methods and illustrate how to overcome such issues with new innovative methods. Finally, our research describes the outcome summary of the entire literature.

Overview of Privacy Protection Technology Based on Database Application

2012 ◽  
Vol 241-244 ◽  
pp. 2816-2821 ◽  
Author(s):  
Hai Fang Wei ◽  
Bei Zhan Wang ◽  
Xiang Deng ◽  
Ai Hua Wu
Keyword(s):  
Data Mining ◽  
Privacy Protection ◽  
Data Privacy ◽  
Sensitive Information ◽  
Basic Principles ◽  
Database Application ◽  
Research Results ◽  
Depth Analysis ◽  
Protection Technology ◽  
Future Direction

With the emergence and development of data applications such as database and data mining, how to protect data privacy and prevent disclosure of sensitive information has become one of the major challenges we are facing now. Privacy protection technologies need to protect data privacy without compromising data applications. The research results of privacy protection field are summarized, and the basic principles and features of various types of privacy protection technologies are described. After the in-depth analysis and comparison of existing technologies, this paper points out the future direction of the privacy protection technology.

scholarly journals The issues connected with the anonymization of medical data. Part 1. The introduction to the anonymization of medical data. Ensuring the protection of sensitive information with the use of such methods as f(a) and f(a,b)

2014 ◽  
Vol 8 (1) ◽  
pp. 13-21 ◽  
Author(s):  
ARKADIUSZ LIBER
Keyword(s):  
Privacy Protection ◽  
Data Privacy ◽  
Differential Privacy ◽  
Medical Data ◽  
Medical Documentation ◽  
Sensitive Information ◽  
Sensitive Data ◽  
New Methods ◽  
Anonymized Data ◽  
Data Privacy Protection

Introduction: Medical documentation must be protected against damage or loss, in compliance with its integrity and credibility and the opportunity to a permanent access by the authorized staff and, finally, protected against the access of unauthorized persons. Anonymization is one of the methods to safeguard the data against the disclosure.Aim of the study: The study aims at the analysis of methods of anonymization, the analysis of methods of the protection of anonymized data and the study of a new security type of privacy enabling to control sensitive data by the entity which the data concerns.Material and methods: The analytical and algebraic methods were used.Results: The study ought to deliver the materials supporting the choice and analysis of the ways of the anonymization of medical data, and develop a new privacy protection solution enabling the control of sensitive data by entities whom this data concerns.Conclusions: In the paper, the analysis of solutions of data anonymizing used for medical data privacy protection was con-ducted. The methods, such as k-Anonymity, (X,y)- Anonymity, (a,k)- Anonymity, (k,e)-Anonymity, (X,y)-Privacy, LKC-Privacy, l-Diversity, (X,y)-Linkability, t-Closeness, Confidence Bounding and Personalized Privacy were described, explained and analyzed. The analysis of solutions to control sensitive data by their owners was also conducted. Apart from the existing methods of the anonymization, the analysis of methods of the anonimized data protection was conducted, in particular the methods of: d-Presence, e-Differential Privacy, (d,g)-Privacy, (a,b)-Distributing Privacy and protections against (c,t)-Isolation were analyzed. The author introduced a new solution of the controlled protection of privacy. The solution is based on marking a protected field and multi-key encryption of the sensitive value. The suggested way of fields marking is in accordance to the XML standard. For the encryption (n,p) different key cipher was selected. To decipher the content the p keys of n is used. The proposed solution enables to apply brand new methods for the control of privacy of disclosing sensitive data.

scholarly journals An ensemble random forest algorithm for privacy preserving distributed medical data mining

2021 ◽  
Vol 12 (6) ◽  
pp. 0-0
Keyword(s):  
Data Mining ◽  
Random Forest ◽  
Imbalanced Data ◽  
Distributed Data Mining ◽  
Sensitive Information ◽  
Distributed Data ◽  
Sensitive Data ◽  
Health Records ◽  
Data Mining Approach ◽  
Proposed Model

As the voluminous amount of data is generated because of inexorably widespread proliferation of electronic data maintained using the Electronic Health Records (EHRs). Medical health facilities have great potential to discern the patterns from this data and utilize them in diagnosing a specific disease or predicting outbreak of an epidemic etc. This discern of patterns might reveal sensitive information about individuals and this information is vulnerable to misuse. This is, however, a challenging task to share such sensitive data as it compromises the privacy of patients. In this paper, a random forest-based distributed data mining approach is proposed. Performance of the proposed model is evaluated using accuracy, f-measure and appa statistics analysis. Experimental results reveal that the proposed model is efficient and scalable enough in both performance and accuracy within the imbalanced data and also in maintaining the privacy by sharing only useful healthcare knowledge in the form of local models without revealing and sharing of sensitive data.

scholarly journals Reinforced Social Ant with Discrete Swarm Optimizer for Sensitive Item and Rule Hiding

2019 ◽  
Vol 8 (9) ◽  
pp. 902-908
Keyword(s):  
Data Mining ◽  
Privacy Preservation ◽  
Distributed Databases ◽  
Data Publishing ◽  
Sensitive Information ◽  
Sensitive Data ◽  
Swarm Optimization ◽  
Privacy Preserving Data Mining ◽  
The Past ◽  
Research Areas

In data mining Privacy Preserving Data mining (PPDM) of the important research areas concentrated in recent years which ensures ensuring sensitive information and rule not being revealed. Several methods and techniques were proposed to hide sensitive information and rule in databases. In the past, perturbation-based PPDM was developed to preserve privacy before use and secure mining of association rules were performed in horizontally distributed databases. This paper presents an integrated model for solving the multi-objective factors, data and rule hiding through reinforcement and discrete optimization for data publishing. This is denoted as an integrated Reinforced Social Ant and Discrete Swarm Optimization (RSADSO) model. In RSA-DSO model, both Reinforced Social Ant and Discrete Swarm Optimization perform with the same particles. To start with, sensitive data item hiding is performed through Reinforced Social Ant model. Followed by this performance, sensitive rules are identified and further hidden for data publishing using Discrete Swarm Optimization model. In order to evaluate the RSA-DSO model, it was tested on benchmark dataset. The results show that RSA-DSO model is more efficient in improving the privacy preservation accuracy with minimal time for optimal hiding and also optimizing the generation of sensitive rules.

scholarly journals Perbandingan Metode SOM/Kohonen dengan ART 2 pada Data Mining Perusahaan Retail

2017 ◽  
Vol 16 (2) ◽  
pp. 55
Author(s):  
Anak Agung Gede Bagus Ariana ◽  
I Ketut Gede Darma Putra ◽  
Linawati Linawati
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Data Clustering ◽  
Adaptive Resonance Theory ◽  
Self Organizing Map ◽  
Resonance Theory ◽  
Data Set ◽  
Adaptive Resonance ◽  
Clustering Data ◽  
Self Organizing

Abstract— This study investigates the performance of artificial neural network method on clustering method. Using UD. Fenny’s customer profile in year 2009 data set with the Recency, Frequency and Monetary model data. Clustering methods were compared in this study is between the Self Organizing Map and Adaptive Resonance Theory 2. The performance evaluation method validation is measured by the index cluster validation. Validation index clusters are used, among others, Davies-Bouldin index, index and index Dunn Silhouette. The test results show the method Self Organizing Map is better to process the data clustering. Index term— Data Mining, Artificial Neural Network, Self Organizing Map, Adaptive Resonance Theory 2. Intisari—Penelitian ini ingin mengetahui unjuk kerja metode clustering data berbasis jaringan saraf tiruan. Menggunakan data set profil pelanggan UD. Fenny tahun 2009 dengan atribut Recency, Frequency dan Monetary. Metode clustering yang dibandingkan pada penelitian ini adalah Self Organizing Map dan Adaptive Resonance Theory 2. Evaluasi kinerja metode dilakukan dengan mengukur validasi index dari cluster yang terbentuk. Validasi cluster yang digunakan antara lain Indeks Davies-Bouldin, Indeks Dunn dan Indeks Silhouette. Hasil pengujian menunjukkan metode Self Organizing Map lebih baik dalam melakukan proses clustering data. Kata Kunci— Data Mining, Jaringan Saraf Tiruan Self Organizing Map, Adaptive Resonance Theory 2.

scholarly journals Security and Privacy Protection in Datamining

2021 ◽  
Vol 12 (2) ◽  
pp. 1313-1318
Author(s):  
G Ravi Kumar, Et. al.
Keyword(s):  
Data Mining ◽  
Privacy Protection ◽  
Security And Privacy ◽  
Event Management ◽  
The People ◽  
Fast Development ◽  
Long Time ◽  
Information Event ◽  
Security Information ◽  
Individual Information

Security and Privacy protection have been a public approach worry for quite a long time. Notwithstanding, quick innovative changes, the fast development of the internet and electronic business, and the improvement of more modern techniques for gathering, investigating, and utilizing individual information have made privacy a significant public and government issues. The field of data mining is acquiring importance acknowledgment to the accessibility of a lot of data, effortlessly gathered and put away through PC systems. Data mining procedures, while permitting the people to remove shrouded information on one hand, present various privacy dangers then again. In this paper, we concentrate a portion of these issues alongside an itemized conversation on the utilizations of different data mining strategies for giving security. This paper gives an outline of data mining field and security information event management system. We will perceive how different data

Sign in / Sign up

Export Citation Format

Share Document