A Discrete Crow Search Algorithm for Mining Quantitative Association Rules
| Autor: | Abderrahim Siam, Makhlouf Ledmi, Nabil Azizi, Hamouma Moumen, Hichem Haouassi |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | International Journal of Swarm Intelligence Research. 12:101-124 |
| ISSN: | 1947-9271 1947-9263 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|