Associative Classification using Automata with Structure based Merging
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 7
Abstract
Associative Classification, a combination of two important and different fields (classification and association rule mining), aims at building accurate and interpretable classifiers by means of association rules. The process used to generate association rules is exponential by nature; thus in AC, researchers focused on the reduction of redundant rules via rules pruning and rules ranking techniques. These techniques take an important part in improving the efficiency; however, pruning may negatively affect the accuracy by pruning interesting rules. Further, these techniques are time consuming in term of processing and also require domain specific knowledge to decide upon the selection of the best ranking and pruning strategy. In order to overcome these limitations, in this research, an automata based solution is proposed to improve the classifier’s accuracy while replacing ranking and pruning. A new merging concept is introduced which used structure based similarity to merge the association rules. The merging not only help to reduce the classifier size but also minimize the loss of information by avoiding the pruning. The extensive experiments showed that the proposed algorithm is efficient than AC, Naive Bayesian, and Rule and Tree based classifiers in term of accuracy, space, and speed. The merging takes the advantages of the repetition in the rules set and keep the classifier as small as possible.
Authors and Affiliations
Mohammad Abrar, Alex Tze Hiang Sim, Sohail Abbas
Keywords
Related Articles
- EP ID EP611535
- DOI 10.14569/IJACSA.2019.0100788
- Views 99
- Downloads 0
Assistive Technologies for Bipolar Disorder: A Survey
Bipolar disorder is a severe mental illness characterized by periodic manic and depressive episodes. The current mode of assessment of the patient’s bipolar state is using subjective clinical diagnosis influenced by the...
Key Issues in Vowel Based Splitting of Telugu Bigrams
Splitting of compound Telugu words into its components or root words is one of the important, tedious and yet inaccurate tasks of Natural Language Processing (NLP). Except in few special cases, at least one vowel i...
Heterogeneous Ensemble Pruning based on Bee Algorithm for Mammogram Classification
In mammogram, masses are primary indication of breast cancer; and it is necessary to classify them as malignant or benign. In this classification task, Computer Aided Diagnostic (CAD) system by using ensemble learning is...
Identification and Evaluation of Functional Dependency Analysis using Rough sets for Knowledge Discovery
The process of data acquisition gained momentum due to the efficient representation of storage/retrieving systems. Due to the commercial and application value of these stored data, Database Management has become es...
Diversity-Based Boosting Algorithm
Boosting is a well known and efficient technique for constructing a classifier ensemble. An ensemble is built incrementally by altering the distribution of training data set and forcing learners to focus on misclassifica...