Association rules are the specific data mining methods aiming to discover explicit relations between the different attributes in a large dataset. However, in reality, several datasets may contain both numeric and categorical attributes. Recently, many meta-heuristic algorithms that mimic the nature are developed for solving continuous problems. This article proposes a new algorithm, DCSA-QAR, for mining quantitative association rules based on crow search algorithm (CSA). To accomplish this, new operators are defined to increase the ability to explore the searching space and ensure the transition from the continuous to the discrete version of CSA. Moreover, a new discretization algorithm is adopted for numerical attributes taking into account dependencies probably that exist between attributes. Finally, to evaluate the performance, DCSA-QAR is compared with particle swarm optimization and mono and multi-objective evolutionary approaches for mining association rules. The results obtained over real-world datasets show the outstanding performance of DCSA-QAR in terms of quality measures.
A Discrete Crow Search Algorithm for Mining Quantitative Association Rules
Makhlouf Ledmi,Moumen Hamouma,Abderrahim Siam,Hichem Haouassi,Nabil Azizi
Published 2021 in International Journal of Swarm Intelligence Research
ABSTRACT
PUBLICATION RECORD
- Publication year
2021
- Venue
International Journal of Swarm Intelligence Research
- Publication date
2021-10-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
- No references are available for this paper.
Showing 0-0 of 0 references · Page 1 of 1
CITED BY
Showing 1-7 of 7 citing papers · Page 1 of 1