A proposed hybrid approach for privacy preserving data mining

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.

Privacy Preserving Data Mining (PPDM) is an area that deals with data mining techniques that allow the data to be mined while keeping its privacy intact. PPDM comes into play when different parties want to involve in collaborative data mining and wish to collectively mine their data to extract knowledge while keeping their data private. The preservation of privacy of data is also of utmost importance when we want to publish any data as open data. This study includes a detailed review of some of the recent techniques proposed in this area. The biggest challenge in devising any privacy preserving data mining technique is to achieve a good balance between privacy and utility of the privacy preserved data.

Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining

Data is increasing rapidly with the vast development of technologies. Mining is mandatory to retrieve knowledge from these data. But, the data may contain sensitive information of the individuals such as medical diagnostic reports which they don’t want to reveal. Privacy Preserving Data Mining (PPDM) helps in this regard to keep sensitive data private as well as preserving the data utility. Besides other PPDM techniques, rotation based perturbation contributes to satisfying both aspects of PPDM i.e., individuals’ privacy and data utility. Also, normalization techniques have a significant impact in the field of PPDM. In this work, the effects of three well-known normalization approaches (i.e., z-score, min-max and decimal scaling) on rotation based perturbation techniques called 2-Dimensional Rotation Transformation (2DRT) and 3-Dimensional Rotation Transformation (3DRT), are analyzed. The effects of normalization over rotation based perturbation techniques are investigated using three benchmark classifiers with five UCI data set. The empirical analysis elucidates that 3DRT provides significant privacy preservation and data utility maintenance than 2DRT for z-score normalization.

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

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.

This paper establishes the foundation for the performance measurements of privacy preserving data mining techniques. The performance is measured in terms of the accuracy of data mining results and the privacy protection of sensitive data. On the accuracy side, we address the problem of previous measures and propose a new measure, named “effective sample size”, to solve this problem. We show that our new measure can be bounded without any knowledge of the data being mined, and discuss when the bound can be met. On the privacy protection side, we identify a tacit assumption made by previous measures and show that the assumption is unrealistic in many situations. To solve the problem, we introduce a game theoretic framework for the measurement of privacy.

For both the production and consumption of data the internet is becoming a standard whereas the security for private data is gradually decreasing. Therefore, to have a safe transaction in the data, security and privacy would be the key issues to be considered. In recent days, privacy has become a key issue in many data mining and knowledge discovery fields which lead to the development of many Privacy Preserving Data Mining (PPDM) techniques. In our work we use few of these techniques to privately preserve the data holder such as hospital data. In this we use techniques named “Anonymization”, “Suppression”, “Generalisation” and “Data Hiding” on different fields for the data to be more secure and project the data which is useful to the public. This is a new way of our approach to create awareness among the public to be more attentive and health conscious. The modified data is clustered based on diseases. Based on the end user requirement the private data of the individual is hidden and the required data is projected.

Due to advances in communication and storage technologies, there is recent exponential increase in data generated and collected. Data mining has become a necessity to enable easier and efficient means of data processing. Data mining is a process of harvesting previously unknown information from existing data and utilizing such insight for business decision making. However, in sectors such as health, exposure of sensitive information is not a trivial issue, despite benefits of data mining. Hence, researchers have proposed various approaches on seeking valuable insight from data but being cautious to protect private data and information. The purpose of this paper is to provide a conceptual review of approaches by researchers in Privacy-Preserving Data Mining (PPDM). This paper further presents a classification of PPDM techniques and provide a clear description of distinctions of one class of techniques from the other, guided by discussions in literature. Lastly, an evaluation criteria which can be used as a building block towards standardizing evaluation criteria for PPDM techniques is proposed.

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.

Data mining techniques have been concentrated for malware detection in the recent decade. The battle between security analyzers and malware scholars is everlasting as innovation grows. The proposed methodologies are not adequate while evolutionary and complex nature of malware is changing quickly and therefore turn out to be harder to recognize. This paper presents a systematic and detailed survey of the malware detection mechanisms using data mining techniques. In addition, it classifies the malware detection approaches in two main categories including signature-based methods and behavior-based detection. The main contributions of this paper are: (1) providing a summary of the current challenges related to the malware detection approaches in data mining, (2) presenting a systematic and categorized overview of the current approaches to machine learning mechanisms, (3) exploring the structure of the significant methods in the malware detection approach and (4) discussing the important factors of classification malware approaches in the data mining. The detection approaches have been compared with each other according to their importance factors. The advantages and disadvantages of them were discussed in terms of data mining models, their evaluation method and their proficiency. This survey helps researchers to have a general comprehension of the malware detection field and for specialists to do consequent examinations.

A typical service provided by a Smart City is a Home Energy Management System (HEMS), an automated system that uses sensor networks to collect usage of home appliances and devices such that the collected data are accessible by the local government. For example, Smart meters, installed within individual homes, can send measures of electricity consumption for analysis in the context of the global community. Such data can be used by a forecasting tool to avoid electrical outage and improve the overall management of electricity usage by the community. However, the data collected may be protected by individual privacy laws and it is possible that the network may be violated by intruders to gain access to the lifestyle of individuals within their home. For example, an intruder may be able to identify active appliances and the number of individuals present within the residence. There is a requirement to protect the data emanating from these sensors to preserve this individual privacy information. Thus, a data concierge service capable of analyzing individual HEMS data is required; such a service would improve the lifestyle by allowing access to HEMS data by a third-party analyst. Although such a service may not require raw data, one must evaluate the trade-off between the preservation of privacy information and the effectiveness of the impact of the data services on the entire community. In this paper, we implemented a prototype application in conjunction with two noise-based perturbations. The application recommends improvements to household electricity usage based on its measured electricity consumption collected by smart meters. The perturbations provide a method to support Privacy Preserving Data Mining (PPDM) techniques. Evaluation of the performance results of the prototype applications illustrates the influence of the PPDM in improving the accuracy of said application.

Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques. Data mining has many applications in security including for national security as well as for cyber security. The threats to national security include attacking buildings, destroying critical infrastructures such as power grids and telecommunication systems. Data mining techniques are being investigated to find out who the suspicious people are and who is capable of carrying out terrorist activities. Cyber security is involved with protecting the computer and network systems against corruption due to Trojan horses, worms and viruses. Data mining is also being applied to provide solutions such as intrusion detection and auditing. The first part of the presentation will discuss my joint research with Prof. Latifur Khan and our students at the University of Texas at Dallas on data mining for cyber security applications For example; anomaly detection techniques could be used to detect unusual patterns and behaviors. Link analysis may be used to trace the viruses to the perpetrators. Classification may be used to group various cyber attacks and then use the profiles to detect an attack when it occurs. Prediction may be used to determine potential future attacks depending in a way on information learnt about terrorists through email and phone conversations. Data mining is also being applied for intrusion detection and auditing. Other applications include data mining for malicious code detection such as worm detection and managing firewall policies. This second part of the presentation will discuss the various types of threats to national security and describe data mining techniques for handling such threats. Threats include non real-time threats and real-time threats. We need to understand the types of threats and also gather good data to carry out mining and obtain useful results. The challenge is to reduce false positives and false negatives. The third part of the presentation will discuss some of the research challenges. We need some form of real-time data mining, that is, the results have to be generated in real-time, we also need to build models in real-time for realtime intrusion detection. Data mining is also being applied for credit card fraud detection and biometrics related applications. While some progress has been made on topics such as stream data mining, there is still a lot of work to be done here. Another challenge is to mine multimedia data including surveillance video. Finally, we need to maintain the privacy of individuals. Much research has been carried out on privacy preserving data mining. In summary, the presentation will provide an overview of data mining, the various types of threats and then discuss the applications of data mining for malicious code detection, cyber security and national security. Then we will discuss the consequences to privacy.

Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques. Data mining has many applications in security including for national security as well as for cyber security. The threats to national security include attacking buildings, destroying critical infrastructures such as power grids and telecommunication systems. Data mining techniques are being investigated to find out who the suspicious people are and who is capable of carrying out terrorist activities. Cyber security is involved with protecting the computer and network systems against corruption due to Trojan horses, worms and viruses. Data mining is also being applied to provide solutions such as intrusion detection and auditing. The first part of the presentation will discuss my joint research with Prof. Latifur Khan and our students at the University of Texas at Dallas on data mining for cyber security applications For example; anomaly detection techniques could be used to detect unusual patterns and behaviors. Link analysis may be used to trace the viruses to the perpetrators. Classification may be used to group various cyber attacks and then use the profiles to detect an attack when it occurs. Prediction may be used to determine potential future attacks depending in a way on information learnt about terrorists through email and phone conversations. Data mining is also being applied for intrusion detection and auditing. Other applications include data mining for malicious code detection such as worm detection and managing firewall policies. This second part of the presentation will discuss the various types of threats to national security and describe data mining techniques for handling such threats. Threats include non real-time threats and real-time threats. We need to understand the types of threats and also gather good data to carry out mining and obtain useful results. The challenge is to reduce false positives and false negatives. The third part of the presentation will discuss some of the research challenges. We need some form of real-time data mining, that is, the results have to be generated in real-time, we also need to build models in real-time for realtime intrusion detection. Data mining is also being applied for credit card fraud detection and biometrics related applications. While some progress has been made on topics such as stream data mining, there is still a lot of work to be done here. Another challenge is to mine multimedia data including surveillance video. Finally, we need to maintain the privacy of individuals. Much research has been carried out on privacy preserving data mining. In summary, the presentation will provide an overview of data mining, the various types of threats and then discuss the applications of data mining for malicious code detection, cyber security and national security. Then we will discuss the consequences to privacy.

The explosions of new data mining techniques has augmented privacy risks because now it is probable to powerfully coalesce and cross-examine massive data stores, accessible on the web, in the rummage around of earlier unidentified hidden patterns. Consecutively to make a overtly accessible system safe and sound, we must guarantee not only that private sensitive data have been trimmed out, but also to make certain that certain inference channels have been clogged-up. The data and the concealed knowledge in this data should be made secure. Furthermore, the requirement for making our system as open as probable - to the extent that data sensitivity is not jeopardized - asks for diverse techniques that account for the revelation organize of sensitive data. At its nucleus, the value of privacy preserving data mining is plagiaristic not only from its knack to haul out imperative knowledge, but also from its resiliency to molestation. It performs well at needed levels during times of both crisis and normal operations. This task force's central thrust is towards establishing a earth with robust data security, where knowledge users persist to profit from data without compromising the data privacy.The goal of privacy-preserving data mining is to liberate a dataset that researchers can study without being able to identify sensitive information about any individuals in the data (with high probability). One technique for privacy-preserving data mining is to replace the sensitive items by unknown values. For many situations it is safer if the sanitization process consign unknown values as a substitute of fake values. This obscures the susceptible rules, whilst defending the punter of the data commencing false rules. In this study, we modify the blocking algorithms of[1] by proposing a new heuristic in order to reduce the information loss. We put forward an enhanced approach that overcomes the privacy breach problem of existing blocking approaches. Though they have argued that the rules are truly safe from an attack by an adversary, they have not formally proved the safety, which we have proved. We have investigated how probabilistic and information theoretic techniques can be applied to this problem. More complete analysis of the effectiveness of these rule obscuring techniques, and formal study of the problem has been made. Our preliminary domino effect point toward deterministic algorithms for privacy preserving association rules shows potential framework for controlling disclosure of sensitive data and knowledge.