Associative Classification using Automata with Structure based Merging

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

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

A privacy-preserving roaming authentication scheme (PPRAS) for ubiquitous networks is proposed, in which a remote mobile user can obtain the service offered by a foreign agent after being authenticated. In order to prote...

Advanced Personnel Vetting Techniques in Critical Multi-Tennant Hosted Computing Environments

The emergence of cloud computing presents a strategic direction for critical infrastructures and promises to have far-reaching effects on their systems and networks to deliver better outcomes to the nations at a lower co...

Recommender System based on Empirical Study of Geolocated Clustering and Prediction Services for Botnets Cyber-Intelligence in Malaysia

A recommender system is becoming a popular platform that predicts the ratings or preferences in studying human behaviors and habits. The predictive system is widely used especially in marketing, retailing and product dev...

Enhanced, Modified and Secured RSA Cryptosystem based on n Prime Numbers and Offline Storage for Medical Data Transmission via Mobile Phone

The transmission of medical data by mobile telephony is an innovation that constitutes the m-health or more generally e-health. This telemedicine handles personal data of patients who deserve to be protected when they ar...

Validation of Semantic Discretization based Indian Weighted Diabetes Risk Score (IWDRS)

The objective of this research study is to validate Indian Weighted Diabetes Risk Score (IWDRS). The IWDRS is derived by applying the novel concept of semantic discretization based on Data Mining techniques. 311 adult pa...

Download PDF file
  • EP ID EP611535
  • DOI 10.14569/IJACSA.2019.0100788
  • Views 85
  • Downloads 0

How To Cite

Mohammad Abrar, Alex Tze Hiang Sim, Sohail Abbas (2019). Associative Classification using Automata with Structure based Merging. International Journal of Advanced Computer Science & Applications, 10(7), 672-685. https://europub.co.uk/articles/-A-611535