Welcome to the InfoSci Platform
Reference Hub2
New Discrete Crow Search Algorithm for Class Association Rule Mining

New Discrete Crow Search Algorithm for Class Association Rule Mining

Haouassi Hichem, MEHDAOUI Rafik, Chouhal Ouahiba
Copyright: © 2022 |Volume: 13 |Issue: 1 |Pages: 21
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781683181514|DOI: 10.4018/IJSIR.2022010109
Cite Article Cite Article

MLA

Hichem, Haouassi, et al. "New Discrete Crow Search Algorithm for Class Association Rule Mining." IJSIR vol.13, no.1 2022: pp.1-21. http://doi.org/10.4018/IJSIR.2022010109

APA

Hichem, H., Rafik, M., & Ouahiba, C. (2022). New Discrete Crow Search Algorithm for Class Association Rule Mining. International Journal of Swarm Intelligence Research (IJSIR), 13(1), 1-21. http://doi.org/10.4018/IJSIR.2022010109

Chicago

Hichem, Haouassi, MEHDAOUI Rafik, and Chouhal Ouahiba. "New Discrete Crow Search Algorithm for Class Association Rule Mining," International Journal of Swarm Intelligence Research (IJSIR) 13, no.1: 1-21. http://doi.org/10.4018/IJSIR.2022010109

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Associative Classification (AC) or Class Association Rule (CAR) mining is a very efficient method for the classification problem. It can build comprehensible classification models in the form of a list of simple IF-THEN classification rules from the available data. In this paper, we present a new, and improved discrete version of the Crow Search Algorithm (CSA) called NDCSA-CAR to mine the Class Association Rules. The goal of this article is to improve the data classification accuracy and the simplicity of classifiers. The authors applied the proposed NDCSA-CAR algorithm on eleven benchmark dataset and compared its result with traditional algorithms and recent well known rule-based classification algorithms. The experimental results show that the proposed algorithm outperformed other rule-based approaches in all evaluated criteria.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.