Limiting privacy breaches in privacy preserving data mining

Knowledge mining from single graph plays an important role in decision support systems on single graphs such as social networks, bioinformatics, etc. In recent years, the problem of Frequent Subgraph Mining (FSM) from a single graph have been developed and attracted several studies. However, the problem of mining association rules or links from frequent subgraphs has not had many contributions. In this article, we state the problem of direct mining association rules from frequent subgraphs. Existing approaches on this topic perform the task in two phases. First, they traverse the search space to directly discover parent-child relationships from the discovered frequent subgraphs, then association rules are generated. We propose a one-phase algorithm, named So-GPARs, to generate rules as soon as frequent supergraphs are constructed from already existing frequent subgraphs. Our experiments on three single graph datasets show that the one-phase algorithm is more efficient than the two-phase algorithm in terms runtime of the rules generating phase.

The trends of data mining on healthcare data for improving medical services have increased because of the electronic healthcare record(EHR) system, which collects a massive amount of data on a daily basis. In the current scenario, hospital maintains its EHR system and stores the detailed information of patients. Data mining for healthcare improvement requires the data from all the EHR systems located at a different location to be stored at the central data mining server. Collection of healthcare data at some untrusted central data mining server raises privacy threats. Healthcare data contains patients’ private information and sharing this information for data mining creates privacy issues. Most of the previous research either focused on k-anonymity technique which causes information loss and decreases data mining accuracy or privacy preserving data mining which is focused on only specific data mining technique. We adopt source anonymous technique as privacy preserving scheme and present a novel scheme for healthcare data collection and mining in this paper. Our scheme collects data from all EHR systems without any information loss and stores at a single central data mining server, also ensuring privacy is preserved. Central data mining server helps to analyze the collected data with different data mining techniques (Association rule mining, Classification, Clustering, etc.) without the involvement of EHR systems. Our scheme is collusion resilient against central data mining server and EHR systems. Theoretical and experimental analysis show the efficiency of our scheme in terms of computation and communication cost. The experimental results using Heart disease dataset show the advantage to EHR systems using the proposed approach in terms of disease prediction accuracy.

A number of privacy preserving techniques have been proposed recently in data mining. In this paper, we provide a review of the state-of-the-art methods for privacy preserving data mining. and discuss methods for randomization, secure multipart computation, and so on. We also make a classification for the privacy preserving data mining technologies, and analyze some works in this field, such as data distortion method for achieving privacy preserving association rule mining. Detailed evaluation criteria of privacy preserving algorithm were illustrated, which include algorithm performance, data utility, and privacy protection degree. Finally, the development of privacy preserving data mining for further directions is given.

Privacy preserving rule-based classifier using modified artificial bee colony algorithm

In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items bought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm significantly improves over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database.

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.

In view of present advancements in computing, with the development of distributed environment, many problems have to deal with distributed input data where individual data privacy is the most important issue to be addressed, for the concern of data owner by extending the privacy preserving notion to the original learning algorithms. Privacy Preserving Data Mining has become an active research area in addressing various privacy issues while bringing out solutions for them. There has been lot of progress in developing secure algorithms and models, able to preserve privacy using various data mining techniques like association, classification and clustering, where as importance of privacy preserving techniques applied for learning algorithms related to neural networks for mining problems are still in infancy. Our work in this paper focused on preserving privacy of an individual, using self organizing map (SOM) adopted for collaborative clustering of distributed data between multiple parties. We present Privacy Preserving Collaborative Clustering method using SOM (PPCSOM) for Horizontal Data Distribution, which allows multiple parties perform clustering in a collaborative approach using SOM neural network, without revealing their data directly to each other, in order to preserve privacy of all parties. Our simulation results shows that implementation of PPCSOM method achieves comparable accuracy and assured Privacy than the original non privacy preserving SOM algorithm.

Privacy Preservation in Data Mining (PPDM) including for Privacy Preserving Association Rule Mining (PPARM) has attracted lots of attention in recent research and practice. However, the current method or approach still have drawbacks in the sense that there are trade-offs between efficiency and privacy preservation. This paper describes our work towards providing a new efficient PPARM protocol. We reviewed current literature on PPARM and mapped the methods or approaches involved. As previous research showed that Elliptic Curve Cryptography (ECC) perform better than the other Public Key systems such as RSA and Diffie-Hellman, we will utilize ECC for reducing the computational cost of the new PPARM protocol. In choosing good elliptic curves for ECC, we measured the running time of the key generation for various group of recommended elliptic curves i.e. Brainpool curves (by Brainpool), Prime, C2pnb, C2tnb curves (by ANSI X9.62), Secp curves (by SECG), and PrimeCurve curves (by CDC Group). As the result, Secp curves outperformed all of the other curves on overall average ratio of running time and key size of key generation by 4.4% up to 357.6%.

Privacy-preserving clustering for big data in cyber-physical-social systems: Survey and perspectives

The traditional data mining method is featured by no analysis over the data distribution and incomplete derived association rule. As a result, the data mining results have the deficiencies of large redundancy probability, large root-mean-square error of approximation (RMSEA) and long consumption time. To handle these issues, this paper proposes a medical data stream distribution pattern association rule mining algorithm based on density estimation. This paper collects medical data, selects the distance method to detect abnormal orphan data in the data stream, detects the duplicate data in the data stream by the similar field matching degree, and eliminates the abnormal data and the duplicate data. Then, the data stream density is estimated based on the histogram estimation samples. According to the data density estimation results, this paper analyzes the distribution of medical data stream from perspectives of concentration, dispersion and morphological characteristics of data distribution. Afterwards, the data distribution pattern association rule mining model is constructed based on compound neural network, data distribution parameters are entered into model’s clustering layer, and in-depth training is conducted over the BP (Back Propagation) neural network at the model’s mining layer. Meanwhile, all rules under the combination of hidden layer’s neuron activity value and corresponding output value, and all rules under the combination of hidden layer’s neuron activity value and corresponding input value are derived, so as to complete association rule mining of medical data stream distribution pattern. The experimental results show that the proposed algorithm has a contour curve closest to the true probability density curve; the dispersion degree of medical data is within a reasonable range, and the medical data has high stability; the data redundancy probability is smaller; the mining result’s RMSEA is small; data mining takes less time.

Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure multi-party computation based approaches. The earlier perturbation and randomization approaches have a step to reconstruct the original data distribution. The new research in this area adopts different data distortion methods or modifies the data mining techniques to make it more suitable to the perturbation scenario. Secure multi-party computation approaches which employ cryptographic tools to build data mining models face high communication and computation costs, especially when the number of parties participating in the computation is large. In this paper, we propose a new perturbation based technique. In our solution, we modify the data mining algorithms so that they can be directly used on the perturbed data. In other words, we directly build a classifier for the original data set from the perturbed training data set.

Maintaining data mining accuracy on distorted datasets is an important issue in privacy preserving data mining. Using matrix approximation, we propose several efficient and flexible techniques to address this issue, and utilize unique characteristics of matrix factorization to maintain data pattern. We use the support vector machine classification to compare accuracy maintenance after data distortion by different methods. With better performance than some classical data perturbation approaches, nonnegative matrix factorization and singular value decomposition are considered to be promising techniques for privacy preserving data mining. Experimental results demonstrate that mining accuracy on the distorted data used these methods is almost as good as that on the original data, with added property of privacy preservation. It indicates that the matrix factorization-based data distortion schemes perturb only confidential attributes to meet privacy requirements while preserving general data pattern for knowledge extraction.

In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with iceberg concept lattices (also called closed itemsets) of FCA and introduce two kinds of iceberg query lattices as condensed representations of frequent datalog queries. We demonstrate that iceberg query lattices provide a natural way to visualize relational association rules in a non-redundant way.

In today's competitive scenario in industries, each organization wants huge profit. A Data Warehouse is a place for storage of reservoir of data from the various organizations in the range of hundreds of gigabytes to terabytes in size. During the course of time, large volumes of data are being gathered continuously in the Data Warehouse Server for further mining operations in order to understand the latest trends and patterns in their business organizations which in turn be exploited by them for increasing their business profits. Organizations want to conceal its sensitive data from the Data Mining Server but still have the aim to obtain accurate data mining results. Privacy Preserving Data Mining is one of the important fields in the data security. This paper deals with Object Oriented Modeling of Privacy Preservation framework in which the privacy preserving technique applied at the DataWarehouseServer. Object Oriented Programming is the latest trend in the software industry due to its various features like reusability of software codes, better user interface, enhancing software security by restricting data access, cheaper production, development and maintenance costs and quicker software development. Authors have modeled the entire Privacy Preserving framework through standard UML diagrams such as use case, class diagram, sequence diagram and Activity diagram by using Rational Software Architect tool. This will facilitate the designers and developers to have a better understanding of the functionality of each and every entity associated with the system during analysis and design phase, before actual implementation. This simplifies the complexity of the entire operation and helps its implementation in a time and cost efficient manner.

Privacy Preservation in Data Mining for Health Care