IHAC: Incorporating Heuristics for Efficient Rule Generation & Rule Selection in Associative Classification

2021 ◽  
Vol 20 (01) ◽  
pp. 2150010
Author(s):  
Parashu Ram Pal ◽  
Pankaj Pathak ◽  
Shkurte Luma-Osmani
Keyword(s):  
Association Rules ◽  
Search Space ◽  
Classification Rule ◽  
Rule Generation ◽  
Classification Methods ◽  
Associative Classification ◽  
Rule Mining ◽  
Rule Selection ◽  
Speed Up ◽  
Experimental Findings

Associations rule mining along with classification rule mining are both significant techniques of mining of knowledge in the area of knowledge discovery in massive databases stored in different geographic locations of the world. Based on such combination of these two, class association rules for mining or associative classification methods have been generated, which, in far too many cases, showed higher prediction accuracy than platitudinous conventional classifiers. Motivated by the study, in this paper, we proposed a new approach, namely IHAC (Incorporating Heuristics for efficient rule generation & rule selection in Associative Classification). First, it utilises the database to decrease the search space and then explicitly explores the potent class association rules from the optimised database. This also blends rule generation and classifier building to speed up the overall classifier construction cycle. Experimental findings showed that IHAC performs better than any further associative classification methods.

scholarly journals A Review on associative classification for Diabetic Datasets A Simulation Approach

2013 ◽  
Vol 7 (1) ◽  
pp. 533-538
Author(s):  
Deepti Jain ◽  
Divakar Singh
Keyword(s):  
Neural Network ◽  
Association Rules ◽  
Classification System ◽  
Association Rule ◽  
Association Rule Mining ◽  
Review Paper ◽  
Classification Rule ◽  
Associative Classification ◽  
Rule Mining ◽  
The Neural Network

Association rules are used to discover all the interesting relationship in a potentially large database. Association rule mining is used to discover a small set of rules over the database to form more accurate evaluation. They capture all possible rules that explain the presence of some attributes in relation to the presence of other attributes. This review paper aims to study and observe a flexible way, of, mining frequent patterns by extending the idea of the Associative Classification method. For better performance, the Neural Network Association Classification system is also analyzed here to be one of the approaches for building accurate and efficient classifiers. In this review paper, the Neural Network Association Classification system is studied and compared in order to find best possible accurate results. Association rule mining and classification rule mining can be integrated to form a framework called as Associative Classification and these rules are referred as Class Association Rules. This review research paper also analyzes how data mining techniques are used for predicting different types of diseases. This paper reviewed the research papers which mainly concentrated on predicting Diabetes.

scholarly journals An Efficient Method for Associative Classification using Jaccard Measure

2019 ◽  
Vol 8 (2S11) ◽  
pp. 3448-3453
Keyword(s):  
Association Rules ◽  
Vital Role ◽  
Classification Methods ◽  
Associative Classification ◽  
Data Mining Technique ◽  
Target Class ◽  
Interestingness Measures ◽  
Mining Technique ◽  
Major Disadvantage ◽  
Traditional Classification

Classification is a data mining technique that categorizes the items in a database to target classes. The aim of classification is to accurately find the target class for each instance of the data. Associative classification is a classification method that uses Class Association Rules for classification. Associative classification is found to be often more accurate than some traditional classification methods. The major disadvantage of associative classification is the generation of redundant and weak class association rules. Weak class association rules results in increase in size and decrease in accuracy of the classifier. This paper proposes an efficient approach to build a compact and accurate classifier by using interestingness measures for pruning rules. Interestingness measures play a vital role in reducing the size and increasing the accuracy of classifier by pruning redundant or weak rules. Rules which are strong are retained and these rules are further used to build the classifier. The source of the data used in this paper is University of California Irvine Machine Learning Repository. The approach proposed in this paper is effective and the results show that the approach can produce a highly compact and accurate classifier

Efficient Implementations for UWEP Incremental Frequent Itemset Mining Algorithm

2021 ◽  
Vol 11 (1) ◽  
pp. 18-37
Author(s):  
Mehmet Bicer ◽  
Daniel Indictor ◽  
Ryan Yang ◽  
Xiaowen Zhang
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Search Space ◽  
Frequent Itemset ◽  
Incremental Algorithm ◽  
Frequent Patterns ◽  
Lazy Evaluation ◽  
Rule Mining ◽  
Implementation Techniques ◽  
Common Technique

Association rule mining is a common technique used in discovering interesting frequent patterns in data acquired in various application domains. The search space combinatorically explodes as the size of the data increases. Furthermore, the introduction of new data can invalidate old frequent patterns and introduce new ones. Hence, while finding the association rules efficiently is an important problem, maintaining and updating them is also crucial. Several algorithms have been introduced to find the association rules efficiently. One of them is Apriori. There are also algorithms written to update or maintain the existing association rules. Update with early pruning (UWEP) is one such algorithm. In this paper, the authors propose that in certain conditions it is preferable to use an incremental algorithm as opposed to the classic Apriori algorithm. They also propose new implementation techniques and improvements to the original UWEP paper in an algorithm we call UWEP2. These include the use of memorization and lazy evaluation to reduce scans of the dataset.

scholarly journals Boosting association rule mining in large datasets via Gibbs sampling

2016 ◽  
Vol 113 (18) ◽  
pp. 4958-4963 ◽  
Author(s):  
Guoqi Qian ◽  
Calyampudi Radhakrishna Rao ◽  
Xiaoying Sun ◽  
Yuehua Wu
Keyword(s):  
Gibbs Sampling ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
General Rule ◽  
Search Space ◽  
Stochastic Search ◽  
Importance Measure ◽  
Rule Mining ◽  
Ergodic Markov Chain

Current algorithms for association rule mining from transaction data are mostly deterministic and enumerative. They can be computationally intractable even for mining a dataset containing just a few hundred transaction items, if no action is taken to constrain the search space. In this paper, we develop a Gibbs-sampling–induced stochastic search procedure to randomly sample association rules from the itemset space, and perform rule mining from the reduced transaction dataset generated by the sample. Also a general rule importance measure is proposed to direct the stochastic search so that, as a result of the randomly generated association rules constituting an ergodic Markov chain, the overall most important rules in the itemset space can be uncovered from the reduced dataset with probability 1 in the limit. In the simulation study and a real genomic data example, we show how to boost association rule mining by an integrated use of the stochastic search and the Apriori algorithm.

Filtering Association Rules by Their Semantics and Structures

2010 ◽  
pp. 216-230
Author(s):  
Rangsipan Marukatat
Keyword(s):  
Association Rules ◽  
Association Rule Mining ◽  
Traffic Accidents ◽  
Complete Information ◽  
Simple Rule ◽  
Rule Generation ◽  
Rule Mining ◽  
Data Set ◽  
Domain Description

Association rule mining produces a large number of rules but many of them are usually redundant ones. When a data set contains infrequent items, the authors need to set the minimum support criterion very low; otherwise, these items will not be discovered. The downside is that it leads to even more redundancy. To deal with this dilemma, some proposed more efficient, and perhaps more complicated, rule generation methods. The others suggested using simple rule generation methods and rather focused on the post-pruning of the rules. This chapter follows the latter approach. The classic Apriori is employed for the rule generation. Their goal is to gain as much insight as possible about the domain. Therefore, the discovered rules are filtered by their semantics and structures. An individual rule is classified by its own semantic, or by how clear its domain description is. It can be labelled as one of the following: strongly meaningless, weakly meaningless, partially meaningful, and meaningful. In addition, multiple rules are compared. Rules with repetitive patterns are removed, while those conveying the most complete information are retained. They demonstrate an application of our techniques to a real case study, an analysis of traffic accidents in Nakorn Pathom, Thailand.

scholarly journals Efficient Rule Generation for Associative Classification

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 299
Author(s):  
Chartwut Thanajiranthorn ◽  
Panida Songram
Keyword(s):  
Data Representation ◽  
Large Set ◽  
Rule Generation ◽  
Associative Classification ◽  
Rule Mining ◽  
Vertical Data ◽  
Multiple Association ◽  
Unseen Data ◽  
Representation Technique ◽  
Memory Resources

Associative classification (AC) is a mining technique that integrates classification and association rule mining to perform classification on unseen data instances. AC is one of the effective classification techniques that applies the generated rules to perform classification. In particular, the number of frequent ruleitems generated by AC is inherently designated by the degree of certain minimum supports. A low minimum support can potentially generate a large set of ruleitems. This can be one of the major drawbacks of AC when some of the ruleitems are not used in the classification stage, and thus (to reduce the rule-mapping time), they are required to be removed from the set. This pruning process can be a computational burden and massively consumes memory resources. In this paper, a new AC algorithm is proposed to directly discover a compact number of efficient rules for classification without the pruning process. A vertical data representation technique is implemented to avoid redundant rule generation and to reduce time used in the mining process. The experimental results show that the proposed algorithm archives in terms of accuracy a number of generated ruleitems, classifier building time, and memory consumption, especially when compared to the well-known algorithms, Classification-based Association (CBA), Classification based on Multiple Association Rules (CMAR), and Fast Associative Classification Algorithm (FACA).

GA2RM: A GA-Based Action Rule Mining Method

2021 ◽  
pp. 2150012
Author(s):  
Shervin Hashemi ◽  
Pirooz Shamsinejad
Keyword(s):  
State Of The Art ◽  
Synthetic Data ◽  
Search Space ◽  
Data Sets ◽  
Mining Method ◽  
Classification Rules ◽  
Classification Methods ◽  
Rule Mining ◽  
Current State ◽  
Traditional Classification

Action Mining is a subfield of Data Mining that tries to extract actions from traditional data sets. Action Rule is a type of rule that suggests some changes in its consequent part. Extracting action rules from data has been one of the research interests in recent years. Current state-of-the-art action rule mining methods like DEAR typically take classification rules as their input; Since traditional classification methods have been designed for prediction and not for manipulation, therefore extracting action rules directly from data can result in more valuable action rules. Here, we have proposed a method to generate action rules directly from data. To tackle the problem of huge search space of action rules, a Genetic Algorithm has been devised. Different metrics have been defined for investigating the effectiveness of our proposed method and a large number of experiments have been done on real and synthetic data sets. The results show that our method can find from 20% to 10 times more interesting (in case of support and confidence) action rules in comparison with its competitors.

scholarly journals ASSOCIATIVE CLASSIFICATION WITH MULTIOBJECTIVE TABU SEARCH

2020 ◽  
Vol 27 (2) ◽  
pp. 353-374
Author(s):  
RICARDO P. BEAUSOLEIL
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Evaluation Criteria ◽  
Classification Rule ◽  
Data Sets ◽  
Tabu Search Algorithm ◽  
Associative Classification ◽  
Rule Mining ◽  
Selection Rules ◽  
Rule Sets

This paper presents an application of Tabu Search algorithm to association rule mining. We focus our attention specifically on classification rule mining, often called associative classification, where the consequent part of each rule is a class label. Our approach is based on seek a rule set handled as an individual. A Tabu search algorithm is used to search for Pareto-optimal rule sets with respect to some evaluation criteria such as accuracy and complexity. We apply a called Apriori algorithm for an association rules mining and then a multiobjective tabu search to a selection rules. We report experimental results where the effect of our multiobjective selection rules is examined for some well-known benchmark data sets from the UCI machine learning repository.

Sign in / Sign up

Export Citation Format

Share Document