MAC: A Multiclass Associative Classification Algorithm

2012 ◽  
Vol 11 (02) ◽  
pp. 1250011 ◽  
Author(s):  
Neda Abdelhamid ◽  
Aladdin Ayesh ◽  
Fadi Thabtah ◽  
Samad Ahmadi ◽  
Wael Hadi
Keyword(s):  
Data Mining ◽  
Rule Induction ◽  
Classification Systems ◽  
Data Repository ◽  
Traditional Learning ◽  
Data Sets ◽  
Learning Approaches ◽  
Associative Classification ◽  
Data Mining Approach ◽  
Association Rule Discovery

Associative classification (AC) is a data mining approach that uses association rule discovery methods to build classification systems (classifiers). Several research studies reveal that AC normally generates higher accurate classifiers than classic classification data mining approaches such as rule induction, probabilistic and decision trees. This paper proposes a new multiclass AC algorithm called MAC. The proposed algorithm employs a novel method for building the classifier that normally reduces the resulting classifier size in order to enable end-user to more understand and maintain it. Experimentations against 19 different data sets from the UCI data repository and using different common AC and traditional learning approaches have been conducted with reference to classification accuracy and the number of rules derived. The results show that the proposed algorithm is able to derive higher predictive classifiers than rule induction (RIPPER) and decision tree (C4.5) algorithms and very competitive to a known AC algorithm named MCAR. Furthermore, MAC is also able to produce less number of rules than MCAR in normal circumstances (standard support and confidence thresholds) and in sever circumstances (low support and confidence thresholds) and for most of the data sets considered in the experiments.

scholarly journals A review of associative classification mining

2007 ◽  
Vol 22 (1) ◽  
pp. 37-65 ◽  
Author(s):  
FADI THABTAH
Keyword(s):  
Classification Systems ◽  
Quality Data ◽  
Data Sets ◽  
Rule Discovery ◽  
Associative Classification ◽  
Future Directions ◽  
Association Rule Discovery ◽  
Rule Pruning ◽  
Associative Classifiers ◽  
Pruning Rule

AbstractAssociative classification mining is a promising approach in data mining that utilizes the association rule discovery techniques to construct classification systems, also known as associative classifiers. In the last few years, a number of associative classification algorithms have been proposed, i.e. CPAR, CMAR, MCAR, MMAC and others. These algorithms employ several different rule discovery, rule ranking, rule pruning, rule prediction and rule evaluation methods. This paper focuses on surveying and comparing the state-of-the-art associative classification techniques with regards to the above criteria. Finally, future directions in associative classification, such as incremental learning and mining low-quality data sets, are also highlighted in this paper.

Associative Classification Approaches: Review and Comparison

2014 ◽  
Vol 13 (03) ◽  
pp. 1450027 ◽  
Author(s):  
Neda Abdelhamid ◽  
Fadi Thabtah
Keyword(s):  
Association Rule ◽  
Rule Learning ◽  
Learning Rule ◽  
Data Representation ◽  
Associative Classification ◽  
Data Mining Approach ◽  
Association Rule Discovery ◽  
Multi Class Classification ◽  
Rule Pruning ◽  
New Research

Associative classification (AC) is a promising data mining approach that integrates classification and association rule discovery to build classification models (classifiers). In the last decade, several AC algorithms have been proposed such as Classification based Association (CBA), Classification based on Predicted Association Rule (CPAR), Multi-class Classification using Association Rule (MCAR), Live and Let Live (L3) and others. These algorithms use different procedures for rule learning, rule sorting, rule pruning, classifier building and class allocation for test cases. This paper sheds the light and critically compares common AC algorithms with reference to the abovementioned procedures. Moreover, data representation formats in AC mining are discussed along with potential new research directions.

scholarly journals A detailed investigation in determining Alzheimer’s disease and its risk factor using different classification techniques

2021 ◽  
Vol 12 (1) ◽  
pp. 374-377
Author(s):  
Mahendran Radha ◽  
Anitha M ◽  
Jeyabaskar Suganya
Keyword(s):  
Risk Factors ◽  
Alzheimer’S Disease ◽  
Data Mining ◽  
Alzheimer's Disease ◽  
Genetic Disorders ◽  
Learning Approaches ◽  
Psychiatric Illnesses ◽  
Data Mining Approach ◽  
Diseased Person ◽  
Linear Svm

The prevalence of genetic disorders has recently crept surprisingly high. Neurodegenerative complications, specifically, pose physical and mental stress to parents and caretakers. These complications may be witnessed in the case of dementia. The general dementia type that accounted for between 60 to 80 per cent of psychiatric illnesses was Alzheimer's disease. At an earlier stage, illness detection serves as a critical task that helps the diseased person to enjoy a decent quality of life. It has become a much necessitated strategy towards relying on automated techniques like data mining approach for early diagnosis and assessment of risk factors concerned with Alzheimer’s. There has been an unprecedented growth of interest concerned with devising novelized approaches proposed in recent times for classifying the disease. However, there is still a grave need for developing an efficacious approach for better prognosis and classification. Data mining is carried out using different machine-learning approaches to assess the risk factors for Alzheimer's disease. Through the present research, and we compared numerous classification methods such as Decision Tree, Linear SVM, KNN, Logistic Regression, Radial SVM, and Random Forest, and finally reported the most outstanding approach in terms of its accuracy.

scholarly journals Comparative Characterization of Crofelemer Samples Using Data Mining and Machine Learning Approaches With Analytical Stability Data Sets

2017 ◽  
Vol 106 (11) ◽  
pp. 3270-3279 ◽  
Author(s):  
Maulik K. Nariya ◽  
Jae Hyun Kim ◽  
Jian Xiong ◽  
Peter A. Kleindl ◽  
Asha Hewarathna ◽  
...  
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Data Sets ◽  
Learning Approaches ◽  
Comparative Characterization ◽  
Analytical Stability ◽  
Stability Data ◽  
Using Data

ITERATIVE STRUCTURE DISCOVERY IN GRAPH-BASED DATA

2005 ◽  
Vol 14 (01n02) ◽  
pp. 101-124 ◽  
Author(s):  
JEFFREY A. COBLE ◽  
RUNU RATHI ◽  
DIANE J. COOK ◽  
LAWRENCE B. HOLDER
Keyword(s):  
Data Mining ◽  
Current Data ◽  
Data Sets ◽  
Minimal Impact ◽  
Dynamic Memory ◽  
Demographic Group ◽  
Data Mining Approach ◽  
Complex Relationships ◽  
Conventional Computer ◽  
Iterative Structure

Much of current data mining research is focused on discovering sets of attributes that discriminate data entities into classes, such as shopping trends for a particular demographic group. In contrast, we are working to develop data mining techniques to discover patterns consisting of complex relationships between entities. Our research is particularly applicable to domains in which the data is event-driven or relationally structured. In this paper we present approaches to address two related challenges; the need to assimilate incremental data updates and the need to mine monolithic datasets. Many realistic problems are continuous in nature and therefore require a data mining approach that can evolve discovered knowledge over time. Similarly, many problems present data sets that are too large to fit into dynamic memory on conventional computer systems. We address incremental data mining by introducing a mechanism for summarizing discoveries from previous data increments so that the globally-best patterns can be computed by mining only the new data increment. To address monolithic datasets we introduce a technique by which these datasets can be partitioned and mined serially with minimal impact on the result quality. We present applications of our work in both the counter-terrorism and bioinformatics domains.

Parallel Associative Classification Data Mining Frameworks Based MapReduce

2015 ◽  
Vol 25 (02) ◽  
pp. 1550002 ◽  
Author(s):  
Fadi Thabtah ◽  
Suhel Hammoud ◽  
Hussein Abdel-Jaber
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Threshold Value ◽  
Classification Performance ◽  
Training Data ◽  
Data Sets ◽  
Learning Method ◽  
Associative Classification ◽  
New Learning ◽  
Mining Algorithms

Associative classification (AC) is a research topic that integrates association rules with classification in data mining to build classifiers. After dissemination of the Classification-based Association Rule algorithm (CBA), the majority of its successors have been developed to improve either CBA's prediction accuracy or the search for frequent ruleitems in the rule discovery step. Both of these steps require high demands in processing time and memory especially in cases of large training data sets or a low minimum support threshold value. In this paper, we overcome the problem of mining large training data sets by proposing a new learning method that repeatedly transforms data between line and item spaces to quickly discover frequent ruleitems, generate rules, subsequently rank and prune rules. This new learning method has been implemented in a parallel Map-Reduce (MR) algorithm called MRMCAR which can be considered the first parallel AC algorithm in the literature. The new learning method can be utilised in the different steps within any AC or association rule mining algorithms which scales well if contrasted with current horizontal or vertical methods. Two versions of the learning method (Weka, Hadoop) have been implemented and a number of experiments against different data sets have been conducted. The ground bases of the comparisons are classification accuracy and time required by the algorithm for data initialization, frequent ruleitems discovery, rule generation and rule pruning. The results reveal that MRMCAR is superior to both current AC mining algorithms and rule based classification algorithms in improving the classification performance with respect to accuracy.

A New Classification Based on Association Algorithm

2010 ◽  
Vol 09 (01) ◽  
pp. 55-64 ◽  
Author(s):  
Fadi Thabtah ◽  
Qazafi Mahmood ◽  
Lee McCluskey ◽  
Hussein Abdel-Jaber
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Prediction Method ◽  
Computational Time ◽  
Rule Discovery ◽  
Associative Classification ◽  
Classification Problems ◽  
Association Rule Discovery ◽  
Similar Class ◽  
Class Labels

Associative classification is a branch in data mining that employs association rule discovery methods in classification problems. In this paper, we introduce a novel data mining method called Looking at the Class (LC), which can be utilised in associative classification approach. Unlike known algorithms in associative classification such as Classification based on Association rule (CBA), which combine disjoint itemsets regardless of their class labels in the training phase, our method joins only itemsets with similar class labels. This saves too many unnecessary itemsets combining during the learning step, and consequently results in massive saving in computational time and memory. Moreover, a new prediction method that utilises multiple rules to make the prediction decision is also developed in this paper. The experimental results on different UCI datasets reveal that LC algorithm outperformed CBA with respect to classification accuracy, memory usage, and execution time on most datasets we consider.

Sign in / Sign up

Export Citation Format

Share Document