Class Association Rule Mining Research Articles

Pediatric population health analysis of southern and central Illinois region: A cross sectional retrospective study using association rule mining and multiple logistic regression

BackgroundSouthern Illinois University School of Medicine (SIUSOM) collects large amounts of data every day. SIUSOM and other similar healthcare systems are always looking for better ways to use the data to understand and address population level problems. The purpose of this study is to analyze the administrative dataset for pediatric patients served by Southern Illinois University School of Medicine (SIUSOM) to uncover patterns that correlate specific demographic information to diagnoses of pediatric diseases. The study uses a cross-sectional database of medical billing information for all pediatric patients served by SIUSOM between June 2013 and December 2016. The dataset consists of about 980.9K clinical visits for 65.4K unique patients and includes patient demographic identifiers such as their sex, date of birth, race, anonymous zipcode and primary and secondary insurance plan as well as the related pediatric diagnosis codes. The goal is to find unknown correlations in this database. MethodWe proposed a two step methodology to derive unknown correlations in SIUSOM administrative database. First, Class association rule mining was used as a well-established data mining method to generate hypothesis and derive associations of the form D → M, where D is diagnosis code of a pediatric disease and M is a patient demographic identifier (age,sex, anonymous zipcode, insurance plan, or race). The resulting associations were pruned and filtered using measures such as lift, odds ratio, relative risk, and confidence. The final associations were selected by a pediatric doctor based on their clinical significance. Second,each association rule in the final set was further validated and adjusted odds ratios were obtained using multiple logistic regression. ResultsSeveral associations were found correlating specific patients’ residential zip codes with the diagnosis codes for viral hepatitis carrier, exposure to communicable diseases, screening for mental and developmental disorder in childhood, history allergy to medications, disturbance of emotions specific to childhood, and acute sinusitis. In addition, the results show that African American patients are more likely to be screened for mental and developmental disorders compared to White patients for SIUSOM pediatric population (Odds Ratio (OR):3.56, 95% Confidence Interval (CI):[3.29,3.85]). ConclusionClass association rule mining is an effective method for detecting signals in a large patient administrative database and generating hypotheses which correlate patients’ demographics with diagnosis of pediatric diseases. A post processing of the hypotheses generated by this method is necessary to prune spurious associations and select a set of clinically relevant hypotheses.

Research on the Random Corresponding of Privacy Data Mining in the Association Rules of Cloud Computing

To strengthen data privacy protection, and improve data mining accuracy, random response mode is adopted to design privacy protection mining method based on association rules. Granular computing method and technology are applied to mining fields of association rules in data mining, and mining to association rules is researched in more extensive way from another perspective in this paper. Firstly, partial concealing mode is adopted to conceal and transform original privacy data and improve data security; secondly, associated frequent item set is utilized to construct simple and efficient privacy protection mining algorithm; finally, algorithm proposed is verified to have higher privacy and accuracy through theoretical analysis and experimental verification. After classical association rules mining algorithm is analyzed and researched in detail with its characteristics and restrictions summarized through examples in this paper, association rules mining model based on granular computing is proposed, which makes theoretical preparation for proposal and construction of association rules pick-up algorithm based on granular computing. Experimental result shows that association rules mining method based on granular computing is feasible and effective.

Incremental Fuzzy Association Rule Mining for Classification and Regression

The aim of mining fuzzy association rules is to find both the association and the casual relationships between the itemsets. With the arrival of dynamic data, the fuzzy association rules should be updated in real time. However, most of the existing algorithms must remine the updated database and can only be applied in classification. This paper proposes an incremental fuzzy association rule mining algorithm to solve classification and regression problems. First, the sliding window is adopted to divide the fuzzy dataset. Second, the dynamic fuzzy variable selection algorithm is adopted to select variables for reducing the search space of the fuzzy association rule mining. Finally, in each sliding window, the result of variable selection is used to incrementally mine the causal fuzzy association rules with the fuzzy Eclat algorithm. When new data are added, the process judges whether concept drift occurs, and if so, the rule set is updated; otherwise, the original rule set is still applied. The weights of the rules are calculated to find the evolving relationship. The simulation result shows that this algorithm can improve accuracy and efficiency.

Mining range associations for classification and characterization

In this paper, we propose a method that is able to derive rules involving range associations from numerical attributes, and to use such rules to build comprehensible classification and characterization (data summary) models. Our approach follows the classification association rule mining paradigm, where rules are generated in a way similar to association rule mining, but search is guided by rule consequents. This allows many credible rules, not just some dominant rules, to be mined from the data to build models. In so doing, we propose several sub-range analysis and rule formation heuristics to deal with numerical attributes. Our experiments show that our method is able to derive range-based rules that offer both accurate classification and comprehensible characterization for numerical data.

Shared Variable Extraction and Hardware Implementation for Nonlinear Boolean Functions Based on Swarm Intelligence

To solve the problem of complex relationships among variables and the difficulty of extracting shared variables from nonlinear Boolean functions (NLBFs), an association logic model of variables is established using the classical Apriori rule mining algorithm and the association analysis launched during shared variable extraction (SVE). This work transforms the SVE problem into a traveling salesman problem (TSP) and proposes an SVE based on particle swarm optimization (SVE-PSO) method that combines the association rule mining method with swarm intelligence to improve the efficiency of SVE. Then, according to the shared variables extracted from various NLBFs, the distribution of the shared variables is created, and two corresponding hardware circuits, Element A and Element B, based on cascade lookup table (LUT) structures are proposed to process the various NLBFs. Experimental results show that the performance of SVE via SVE-PSO method is significantly more efficient than the classical association rule mining algorithms. The ratio of the rules is 80.41%, but the operation time is only 21.47% when compared to the Apriori method, which uses 200 iterations. In addition, the area utilizations of Element A and Element B expended by the NLBFs via different parallelisms are measured and compared with other methods. The results show that the integrative performances of Element A and Element B are significantly better than those of other methods. The proposed SVE-PSO method and two cascade LUT-structure circuits can be widely used in coarse-grained reconfigurable cryptogrammic processors, or in application-specific instruction-set cryptogrammic processors, to advance the performance of NLBF processing and mapping.

Parallel and distributed association rule mining in life science: A novel parallel algorithm to mine genomics data

Association rule mining (ARM) is largely employed in several scientific areas and application domains, and many different algorithms for learning association rules from databases have been introduced. Despite the presence of many existing algorithms, there is still room for the introduction of novel approaches tailored for novel kinds of datasets. Because often the efficiency of such algorithms depends on the type of analyzed dataset. For instance, classical ARM algorithms present some drawbacks for biological datasets produced by microarray technologies in particular containing Single Nucleotide Polymorphisms (SNPs). In particular classical algorithms require large execution times also with small datasets. Therefore the possibility to improve the performance of such algorithms by leveraging parallel computing is a growing research area. The main contributions of this paper are: a comparison among different sequential, parallels and distributed ARM techniques, and the presentation of a novel ARM algorithm, named Balanced Parallel Association Rule Extractor from SNPs (BPARES), that employs parallel computing and a novel balancing strategy to improve response time. BPARES improves performance without loosing in accuracy as well as it handles more efficiently the available computational power and reduces the memory consumption.

A novel software defect prediction based on atomic class-association rule mining

To ensure the rational allocation of software testing resources and reduce costs, software defect prediction has drawn notable attention to many “white-box” and “black-box” classification algorithms. Although there have been lots of studies on using software product metrics to identify defect-prone modules, defect prediction algorithms are still worth exploring. For instance, it is not easy to directly implement the Apriori algorithm to classify defect-prone modules across a skewed dataset. Therefore, we propose a novel supervised approach for software defect prediction based on atomic class-association rule mining (ACAR). It holds the characteristics of only one feature of the antecedent and a unique class label of the consequent, which is a specific kind of association rules that explores the relationship between attributes and categories. It holds the characteristics of only one feature of the antecedent and a unique class label of the consequent, which is a specific kind of association rules that explores the relationship between attributes and categories. Such association patterns can provide meaningful knowledge that can be easily understood by software engineers. A new software defect prediction model infrastructure based on association rules is employed to improve the prediction of defect-prone modules, which is divided into data preprocessing, rule model building and performance evaluation. Moreover, ACAR can achieve a satisfactory classification performance compared with other seven benchmark learners (the extension of classification based on associations (CBA2), Support Vector Machine, Naive Bayesian, Decision Tree, OneR, K-nearest Neighbors and RIPPER) on NASA MDP and PROMISE datasets. In light of software defect associative prediction, a comparative experiment between ACAR and CBA2 is discussed in details. It is demonstrated that ACAR is better than CBA2 in terms of AUC, G-mean, Balance, and understandability. In addition, the average AUC of ACAR is increased by 2.9% compared with CBA2, which can reach 81.1%.

Neutrosophic Association Rule Mining Algorithm for Big Data Analysis

Big Data is a large-sized and complex dataset, which cannot be managed using traditional data processing tools. Mining process of big data is the ability to extract valuable information from these large datasets. Association rule mining is a type of data mining process, which is indented to determine interesting associations between items and to establish a set of association rules whose support is greater than a specific threshold. The classical association rules can only be extracted from binary data where an item exists in a transaction, but it fails to deal effectively with quantitative attributes, through decreasing the quality of generated association rules due to sharp boundary problems. In order to overcome the drawbacks of classical association rule mining, we propose in this research a new neutrosophic association rule algorithm. The algorithm uses a new approach for generating association rules by dealing with membership, indeterminacy, and non-membership functions of items, conducting to an efficient decision-making system by considering all vague association rules. To prove the validity of the method, we compare the fuzzy mining and the neutrosophic mining. The results show that the proposed approach increases the number of generated association rules.

An improved incremental algorithm for mining weighted class-association rules

Constructing fast and accurate classifiers for large data sets is an important task in data mining. Associative classification can produce more efficient and accurate classifiers than traditional classification techniques. Weighted class association rule (WCAR) mining reflects significance of items by considering their weight. Moreover, real time databases are dynamic. This influences the need for incremental approach for classification. Existing incremental classification algorithms suffer from issues like longer execution time and higher memory usage. This paper proposes an algorithm which uses hash structure to store weighted frequent items and the concept of difference of object identifiers to compute the support faster. For mining incremental databases, pre-large concept is used to reduce the number of re-scans over the original database. The proposed algorithm was implemented and tested on experimental data sets taken from UCI repository. The results show that proposed algorithm for mining WCARs gives better results compared to existing algorithm.

Efficient method for updating class association rules in dynamic datasets with record deletion

Association rule mining is an important topic in data mining. The problem is to discover all (or almost all) associations among items in the transaction database that satisfy some user-specified constraints. Usually, the constraints are related to minimal support and minimal confidence. Class association rules (CARs) are a special type of association rules that can be applied for classification problem. Previous research showed that classification based on association rules has higher accuracy than can be achieved with an inductive learning algorithm or C4.5. As such, many methods have been proposed for mining CARs, although these use batch processing. However, datasets are often changed, with records added or/and deleted, and consequently updating CARs is a challenging problem. This paper proposes an efficient method for updating CARs when records are deleted. First, we use an MECR-tree to store nodes for the original dataset. The information in the nodes of this tree are updated based on the deleted records. Second, the concept of pre-large itemsets is used to avoid rescanning the original dataset. Finally, we propose an algorithm to efficiently update and generate CARs. We also analyze the time complexity to show the efficiency of our proposed algorithm. The experimental results show that the proposed method outperforms mining CARs from the dataset after record deletion.

Predictability-based collective class association rule mining

Associative classification is rule-based involving candidate rules as criteria of classification that provide both highly accurate and easily interpretable results to decision makers. The important phase of associative classification is rule evaluation consisting of rule ranking and pruning in which bad rules are removed to improve performance. Existing association rule mining algorithms relied on frequency-based rule evaluation methods such as support and confidence, failing to provide sound statistical or computational measures for rule evaluation, and often suffer from many redundant rules. In this research we propose predictability-based collective class association rule mining based on cross-validation with a new rule evaluation step. We measure the prediction accuracy of each candidate rule in inner cross-validation steps. We split a training dataset into inner training sets and inner test sets and then evaluate candidate rules’ predictive performance. From several experiments, we show that the proposed algorithm outperforms some existing algorithms while maintaining a large number of useful rules in the classifier. Furthermore, by applying the proposed algorithm to a real-life healthcare dataset, we demonstrate that it is practical and has potential to reveal important patterns in the dataset.

Characteristics of cyclist crashes in Italy using latent class analysis and association rule mining.

The factors associated with severity of the bicycle crashes may differ across different bicycle crash patterns. Therefore, it is important to identify distinct bicycle crash patterns with homogeneous attributes. The current study aimed at identifying subgroups of bicycle crashes in Italy and analyzing separately the different bicycle crash types. The present study focused on bicycle crashes that occurred in Italy during the period between 2011 and 2013. We analyzed categorical indicators corresponding to the characteristics of infrastructure (road type, road signage, and location type), road user (i.e., opponent vehicle and cyclist’s maneuver, type of collision, age and gender of the cyclist), vehicle (type of opponent vehicle), and the environmental and time period variables (time of the day, day of the week, season, pavement condition, and weather). To identify homogenous subgroups of bicycle crashes, we used latent class analysis. Using latent class analysis, the bicycle crash data set was segmented into 19 classes, which represents 19 different bicycle crash types. Logistic regression analysis was used to identify the association between class membership and severity of the bicycle crashes. Finally, association rules were conducted for each of the latent classes to uncover the factors associated with an increased likelihood of severity. Association rules highlighted different crash characteristics associated with an increased likelihood of severity for each of the 19 bicycle crash types.

A Novel Framework to Use Association Rule Mining for classification of traffic accident severity

Introduction: Traffic accidents are an undesirable burden on society. Every year around one million deaths and more than ten million injuries are reported due to traffic accidents. Hence, traffic accidents prevention measures must be taken to overcome the accident rate. Different countries have different geographical and environmental conditions and hence the accident factors diverge in each country. Traffic accident data analysis is very useful in revealing the factors that affect the accidents in different countries. This article was written in the year 2016 in the Institute of Technology & Science, Mohan Nagar, Ghaziabad, up, India. Methology: We propose a framework to utilize association rule mining (arm) for the severity classification of traffic accidents data obtained from police records in Mujjafarnagar district, Uttarpradesh, India. Results: The results certainly reveal some hidden factors which can be applied to understand the factors behind road accidentality in this region. Conclusions: The framework enables us to find three clusters from the data set. Each cluster represents a type of accident severity, i.e. fatal, major injury and minor/no injury. The association rules exposed different factors that are associated with road accidents in each category. The information extracted provides important information which can be employed to adapt preventive measures to overcome the accident severity in Muzzafarnagar district.

A novel artificial immune system-based approach for mining associative classification rules with stock trading data

Stock market prediction with high accuracy has always been an interesting subject for most investors and professional analysts. Data mining techniques are providing great aid to extract interesting and hidden knowledge from datasets. Financial data mining tools assist investors in their investment decisions, thereby reducing their investment risks. Associative classification rule mining is a promising approach in data mining that utilises the association rule discovery techniques to construct classification systems, also known as associative classifiers. This paper aims to develop an intelligent transaction system based on associative classification rule mining (ACR) and phenotypic artificial immune system (AIS) which discovers trading rules from numerical indicators. A new fitness function as a different measure of quality for quantitative association is suggested considering interestingness of rules. Based on the empirical studies on the top eight companies in the S&P 500 stocks, observed results demonstrate the superior prediction accuracy over the genetic algorithm based technique and the 'buy and hold' strategy.

A novel artificial immune system-based approach for mining associative classification rules with stock trading data

Stock market prediction with high accuracy has always been an interesting subject for most investors and professional analysts. Data mining techniques are providing great aid to extract interesting and hidden knowledge from datasets. Financial data mining tools assist investors in their investment decisions, thereby reducing their investment risks. Associative classification rule mining is a promising approach in data mining that utilises the association rule discovery techniques to construct classification systems, also known as associative classifiers. This paper aims to develop an intelligent transaction system based on associative classification rule mining (ACR) and phenotypic artificial immune system (AIS) which discovers trading rules from numerical indicators. A new fitness function as a different measure of quality for quantitative association is suggested considering interestingness of rules. Based on the empirical studies on the top eight companies in the S&P 500 stocks, observed results demonstrate the superior prediction accuracy over the genetic algorithm based technique and the 'buy and hold' strategy.

An analysis of association rule mining for classification based on artificial immune system

One of the most important and effective data mining techniques is association rule mining. Associative classification uses the principle of rule finding and technique of classification to generate a classifier for prediction. The rule search method is also computationally expensive for small support threshold values, which are critical for designing an efficient classifier. The artificial immune system (AIS) employs the powerful informational capacities of the immune system. The population-based search model combined with evolutionary computation techniques allows the artificial immune system clonal selection methodology to manage a complex search space. This study calculated accuracy across a variety of clonal characteristics and generations to assess the efficacy of the artificial immune system-based categorization method. The output of these systems is shown on several benchmark datasets. Based on the accuracy of the different clonal factors (0.1 to 0.9) and generations (10, 20, 30, 40, 50, and 60), a comparison study is performed. The accuracy is computed using four standard datasets. It is observed that in every dataset for several generations, the approach provides the maximum accuracy with a clonal factor of 0.4.

Mining of yield components and other associated quantitative traits in various crops

Yield and yield components are the most important quantitative traits, which are correlated with each other and with other morphological and physiological quantitative traits. These correlated quantitative traits are important to develop high-yielding varieties of various crops to combat the needs of increasing population. In this regard, this paper work utilised data mining approaches such as classification rule, association rule and frequent pattern mining to extract patterns/rules from quantitative trait locus database to find yield components and associated quantitative traits of 10 economically important crops. This study provides a simple, fast and exhaustive approach for finding yield components and associated quantitative traits, in comparison to traditional approaches.

Efficient mining of class association rules with the itemset constraint

Mining class association rules (CARs) with the itemset constraint is concerned with the discovery of rules, which contain a set of specific items in the rule antecedent and a class label in the rule consequent. This task is commonly encountered in mining medical data. For example, when classifying which section of the population is at high risk for the HIV infection, epidemiologists often concentrate on rules which include demographic information such as gender, age, and marital status in the rule antecedent, and HIV-Positive in the rule consequent. There are two naive strategies to solve this problem, namely pre-processing and post-processing. The post-processing methods have to generate and consider a huge number of candidate CARs while the performance of the pre-processing methods depend on the number of records filtered out. Therefore, such approaches are time consuming. This study proposes an efficient method for mining CARs with the itemset constraint based on a lattice structure and the difference between two sets of object identifiers (diffset). Firstly, a lattice structure is built to store all frequent itemsets in the dataset. To reduce memory usage, instead of the entire set of object identifiers, the diffset is used. Secondly, the lattice is traversed to generate only rules which satisfy the itemset constraint. The experimental results show that the proposed algorithm outperforms existing methods in terms of both the mining time and memory usage.

A MANUFACTURING FAILURE ROOT CAUSE ANALYSIS IN IMBALANCE DATA SET USING PCA WEIGHTED ASSOCIATION RULE MINING

Root cause analysis is key issue for manufacturing processes. It has been a very challenging problem due to the increasing level of complexity and huge number of operational aspects in manufacturing systems. Association rule mining (ARM) which aids in root cause analysis was introduced to extract interesting correlations, frequent patterns, associations or casual structures among items in the transactional database. Although ARM was proven outstanding in many application domains, not many researches were focusing on solving rare items problem in imbalance dataset. The existence of imbalanced dataset in manufacturing environment make the classical ARM fails to extract interesting pattern in an efficient way. Weighted association rule mining (WARM) overcomes the rare items problem by assigning weights to items. The goal of using weighted support is to make use of the weight in the mining process and priorities the selection of the selection of targeted itemsets according to their significance, rather than frequency alone. However, the development of a suitable weight assignment scheme has been an important issue. In this research, we proposed principal component analysis (PCA) to automate the weight in WARM. The result shows that PCA-WARM is capable in capturing pattern from the data of industrial process. These patterns are proven able to explain industrial failure.

A Class Association Rule Based Classifier Using Probability Density Functions for Intrusion Detection Systems

As the number of computer systems connected to the Internet is increasing exponentially, the computer security has become a crucial problem, and many techniques for Intrusion detection have been proposed to detect network attacks efficiently. On the other hand, data mining algorithms based on Genetic Network Programming (GNP) have been proposed and applied to Intrusion detection recently. GNP is a graph-based evolutionary algorithm and can extract many important class association rules by making use of the distinguished representation ability of the graph structure. In this paper, probabilistic classification algorithms based on multi-dimensional probability distribution are proposed and combined with conventional class association rule mining of GNP, and applied to network intrusion detection for the performance evaluation. The proposed classification algorithms are based on 1) one-dimensional probability density functions and 2) a two-dimensional joint probability density function. These functions represent the distribution of normal and intrusion accesses and efficiently classify a new access data into normal, known intrusion or even unknown intrusion. The simulations using KDD99Cup database from MIT Lincoln Laboratory show some advantages of the proposed algorithms over the conventional mean and standard deviation-based method.