Agent Based Frequent Set Meta Mining: Introducing EMADS

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 is very important in Data Mining. Association rule mining, is a important technique, has already been applied in a wide range of areas. Large databases cannot be secured by encryption or other techniques because of complexities. These security issues can be divided into two categories: data hiding and knowledge hiding. This paper deals with the problem of association rule mining which preserves the confidentiality of each database i.e. Knowledge hiding. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. There are many methods to solve this problem. The one, presented in the paper is called support-based and confidence-based blocking schemes. Apriori algorithm is used for mining rule from database. Knowledge hiding is achieved using ISL and DSR. The improvement over sensitive rule hiding is proposed to offer more accuracy and security with smaller negative impact. In ever changing business environment like enterprises e-businesses, the old fashioned disclosure and database inference protection techniques are not capable to ensure complete data privacy. Privacy is important for the on line disclosure of private information Organizations should be able to evaluate the risk of disclosing information and should adopt new more efficient approaches for information disclosure control, in order to maintain their competitive edge in the market. Not only the data but also the hidden knowledge in the data should be made secure. The sensitive information can be extracted in the form of association rules with association rule mining tools. But this can jeopardize the privacy of the customers. Some other rule could be very critical for the company itself such as buying patterns of very rich customers. For example, an Internet based company may give up selling hardware and may concentrate on selling books and videos. Therefore a rule relating the customer buying patterns of hardware may no longer be sensitive for that company. It is desirable to apply a trivial algorithm that hides data by deleting it randomly. Data Mining is the process of discovering new patterns from large data sets involving methods from statistics and artificial intelligence but also database management. Privacy has become an important issue in Data Mining. Many methods have been brought out to solve this problem. This paper focuses on the problem of association rule mining, which hides the knowledge from each database. This paper reviews the major method of knowledge hiding. Association rule mining, as a very important technique, has already been applied in a wide range of areas. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. As a result of association rule mining, many useful association rules will be discovered, but at the same time, many privacy rules will also be exposed which do not want others to know. To solve this, limit the mining process, in order to keep these sensitive rules being hidden. There are so many methods to solve this problem. The one that is covered in the paper is just one kind of them, called support-based and confidence-based blocking schemes. Algorithm used For Knowledge Hiding is ISL algorithm or DSR algorithm (2). The main disadvantage of a block in algorithm is the fact that the dataset, apart from the blocked values, is not distorted. Thus, an adversary can disclose the hidden rules by identifying those generating item sets that contain question marks and lead to rules with a maximum confidence that lies above the minimum confidence threshold. If the number of these rules is small then the probability of identifying the sensitive ones among them becomes high. To avoid this problem, a method for selectively removing individual values from a database is introduced to prevent the discovery of a set of rules, while preserving the data for other applications. The problem of building privacy preserving algorithms is considered for one category of data mining techniques, the association rule mining. New metrics is introduced in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining (1).

Genetic Algorithm (GA) and Particle swarm optimization (PSO) are both population based search methods and move from set of points (population) to another set of points in a single iteration with likely improvement using set of control operators. GA has become popular because of its many versions, ease of implementation, ability to solve difficult problems and so on. PSO is relatively recent heuristic search mechanism inspired by bird flocking or fish schooling. Association Rule (AR) mining is one of the most studied tasks in data mining. The objective of this paper is to compare the effectiveness and computational capability of GA and PSO in mining association rules. Though both are heuristic based search methods, the control parameters involved in GA and PSO differ. The Genetic algorithm parameters are based on reproduction techniques evolved from biology and the control parameters of PSO are based on particle ‘best’ values in each generation. From the experimental study PSO is found to be as effective as GA with marginally better computational efficiency over GA.KeywordsGenetic AlgorithmParticle Swam optimizationAssociation rulesEffectivenessComputational efficiency

Data mining aims to develop a new generation of tools to intelligently assist humans in analyzing mountains of data. Over the past few years, great progress has been made in both research and applications of data mining. Data mining systems have helped many businesses by exposing previously unknown patterns in their databases, which were used to improve profits, enhance customer services, and ultimately achieve a competitive advantage. In this paper, we present our unique data mining system DM-II (Data Mining Integration and Interestingness). DM-II is a PC-based system working in Windows 95/98/NT environment. Apart from the normal components of a data mining system, DM-II has a number of unique and advanced sub-systems. These sub-systems have been applied in many real-life applications, including education applications, insurance application, accident application, disease application, drug screening application, image classification, etc. Here, we focus on discussing the following sub-systems: CBA: CBA originally stands for Classification-Based on Associations [lo]. It has now been extended with a number of other advanced features. In all, CBA has the following capabilities: Building classifiers using association rules: Traditionally, association rule mining and classifier building are regarded as two different data mining tasks. CBA unifies the two tasks. It is able to ,generate association rules and builds a classifier using a special subset of the association rules. What is significant is that CBA, in general, produces more accurate classifiers compared to the state-ofthe-art classification system C4.5 [ 161. It also helps to solve some outstanding problems with the existing classification systems. Pruning and summarizing the discovered associations: One major problem with association

Association rule mining is a fundamental task in many data mining and analysis applications, both for knowledge extraction and as part of other processes (for example, building associative classifiers). It is well known that the number of associations identified by many association rule mining algorithms can be so large as to present a barrier to their interpretability and practical use. A typical solution to this problem involves removing redundant rules. This paper proposes a novel definition of redundancy, which is used to identify only the most interesting associations. Compared to existing redundancy based approaches, our method is both more robust to noise, and produces fewer overall rules for a given data (improving clarity). A rule can be considered redundant if the knowledge it describes is already contained in other rules. Given an association rule, most existing approaches consider rules to be redundant if they add additional variables without increasing quality according to some measure of interestingness. We claim that complex interactions between variables can confound many interestingness measures. This can lead to existing approaches being overly aggressive in removing redundant associations. Most existing approaches also fail to take into account situations where more general rules (those with fewer attributes) can be considered redundant with respect to their specialisations. We examine this problem and provide concrete examples of such errors using artificial data. An alternate definition of redundancy that addresses these issues is proposed. Our approach is shown to identify interesting associations missed by comparable methods on multiple real and synthetic data. When combined with the removal of redundant generalisations, our approach is often able to generate smaller overall rule sets, while leaving average rule quality unaffected or slightly improved.

Discovery of class association rules from the enormous amount of database is considered as a vital task in data mining. Nowadays, the development of computer technologies, for example, database management system and data storage has given the stage for gathering and dealing with a lot of information. Finding frequent class association rules combines two significant data mining techniques such as association rule mining and classification for maximum accuracy. Since this hybrid mining yields a large number of class rules during database scan, the processing time will increases significantly. Moreover, many of these rules may be irrelevant and sometimes it misses the most important rules during classifier construction. Rare lazy learning associative classification is the process of recognizing rare class rules without generating classifier construction by focusing on the useful features from patient data of the test instance which is important for rule generation. This method is profoundly appropriate for biomedical field like heart disease prediction system which requires higher accuracy. The proposed algorithm uses simple local caching mechanism on heart disease data and constructing classifier using cogency measure that will make the lazy associative classification fast and achieve higher accuracy than traditional algorithms. Experimental results show that the proposed cogency-based algorithm is more efficient than traditional algorithms for heart disease with high prediction accuracy and the proposed algorithm may also be useful in anomaly detection, fraud detection, detection of network failures and many more bio medical areas.

Association rule mining is a data mining task on a great deal of academic research has been done and many algorithms are proposed. Association rule mining is treated as a twofold process by most of the methods. It increases the complexity of the system and takes up more time and space. Evolutionary Computation (EC) are fast growing search based optimization method for association rule mining. Among ECs particle swarm optimization (PSO) is more suited for mining association rules. The bottleneck of PSO is setting the precise values for their control parameters. Setting values to the control parameter is done either through parameter tuning or parameter control. This paper proposes an adaptive methodology for the control parameters in PSO namely, acceleration coefficients and inertia weight based on estimation of evolution state and fitness value respectively. Both of the proposed adaptive methods when tested on five datasets from University of California Irvine (UCI) repository proved to generate association rules with better accuracy and rule measures compared to simple PSO.

Discovery of association rules is one of the most important tasks in data mining. Many efficient algorithms have been proposed in the literature. In this paper, a method of dataset-partitioning using conceptual hierarchy and a variable precision rough set model is presented. An algorithm for mining association rules using this technique is designed, and an asynchronous algorithm is proposed, too. The efficiency of the algorithm and the factors that affect the efficiency of the algorithm are analyzed by mining association rules in a dataset artificially generated. The result of an experiment proves the efficiency of the algorithm.

Coronary Heart Disease (CHD) is a ordinary cardiovascular disease which does gravely harm to humans' health. It belongs to the category of chest stuffiness and pains on usual Indian Medicine. Many more researcher work on the association improvement is a very important research field in data mining. The mining association rule recurrently has been adopting numerous replica support, confidence, interestingness. But this model can't accurate determine the correlative degree between the precursor and the major of the rule by allocation. So we proposed a new mining algorithm of association rules. Proposed a new system based SVM,fuzzy Discriminant support. Our propose Coronary Heart Disease prediction system quantitatively estimate the correlation of rules and reduce many rules that have low support or have no correlation or have negative correlation. In our work we conduct experiments on large real time rural and urban data set and to predict the diseases like Medication in Coronary Heart Disease.

Multi-dimensional semantic clustering of large databases for association rule mining

One of the most critical ways of data mining protocol is application of the association rule mining. Entrancing plans would apply to this protocol from the exchange of databases. The champion would be the Apriori count of all. The current article deals with the data structure that is based on different pre-fixed itemset. This will be used to create a filtered itemset. This enables in enhancing the viability of the regular Apriori computation. In order to discover various patterns and establish relation among various data sets, many data analysis tools are used. These tools can be further made use of to obtain valid predictions. One of the most popular techniques is the association rule for the pattern discovery in data mining, called KDD. Another important component in data mining is the rule mining. Association rule mining is the most effective rule in rule mining. This data mining rule is applied in many domains. The major focus of the article is to present an algorithm for efficient data mining and rule generation. Use of Apriori algorithm enhanced the precision and recall system, which is described in the article.

Pattern mining algorithms for data streams using itemset

In recent years, manufacturing processes have become more and more complex, manufacturing activities generate large quantities of data, so it is no longer practical to rely on traditional manual methods to analyze this data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining techniques and has received considerable attention from researchers and practitioners. The paper presents the basic concept of association rule mining and reviews applications of association rules in manufacturing, including product design, manufacturing, process, customer relationship management, supply chain management, and product quality improvement. This paper is focused on demonstrating the relevancy of association rules mining to manufacturing industry, rather than discussing the association rules mining domain in general.

Association rule mining is an important approach to data mining. It extracts useful and hidden information. There are two methodologies to explore the association rules. One method is generating frequent pattern generation through apriori like algorithms whereas another methodology is by using the soft computing techniques especially genetic algorithm. Two important aspect which is most of the time unaddressed, is incremental data and multi-objective. Very few research work on incremental and multi-objective association rule mining has been done. This paper comprises of a comprehensive study of incremental data mining and a distinct study of genetic algorithms. It is observed that soft-computing technique perform better for association rules. There is also a need for Incremental algorithms which work better in the state of addition, deletion and modification of data. It is also found that strong need of Multi-objective Incremental association rule mining algorithm.

As an important data mining and knowledge discovery task, association rule mining searches for implicit, previously unknown, and potentially useful pieces of information—in the form of rules revealing associative relationships—that are embedded in the data. In general, the association rule mining process comprises two key steps. The first key step, which mines frequent patterns (i.e., frequently occurring sets of items) from data, is more computationally intensive than the second key step of using the mined frequent patterns to form association rules. In the early days, many developed algorithms mined frequent patterns from traditional transaction databases of precise data such as shopping market basket data, in which the contents of databases are known. However, we are living in an uncertain world, in which uncertain data can be found almost everywhere. Hence, in recent years, researchers have paid more attention to frequent pattern mining from probabilistic databases of uncertain data. In this paper, we review recent algorithmic development on mining uncertain data in these probabilistic databases for frequent patterns. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 316–329 DOI: 10.1002/widm.31This article is categorized under: Algorithmic Development > Association Rules