Afficher la notice abrégée
| dc.contributor.author |
Bergougui, Chaima |
|
| dc.contributor.author |
Belacel, Intissar |
|
| dc.contributor.author |
Hireche, Celia. (Promotrice) |
|
| dc.date.accessioned |
2025-10-16T14:08:59Z |
|
| dc.date.available |
2025-10-16T14:08:59Z |
|
| dc.date.issued |
2025-06 |
|
| dc.identifier.uri |
https://di.univ-blida.dz/jspui/handle/123456789/40658 |
|
| dc.description |
ill.,Bibliogr.cote:MA-004-1038 |
fr_FR |
| dc.description.abstract |
This research explores the integration of data mining techniques with metaheuristic algorithms to address hard combinatorial problems, with a particular focus on the Boolean Satisfiability Prob- lem (SAT). The core metaheuristic employed is Elephant Herding Optimization (EHO), a swarm- based algorithm inspired by the social behavior of elephants, known for its balance between explo- ration and exploitation.
To align EHO with the discrete nature of the SAT problem, a first adaptation phase was carried out. During this stage, stagnation emerged as a significant limitation, affecting the algorithm's ability to maintain progress toward better solutions. To mitigate this, three strategies were proposed: muta- tion, re-division, and a combination of both. These simple improvements led to a notable reduction in stagnation and significantly increased the satisfiability rate, particularly with the mutation strat- egy, which also offered the shortest execution time in most test cases.
The second phase consisted of selecting suitable data mining techniques to hybridize with EHO, aiming to further enhance performance. K-Means and DBSCAN clustering methods were chosen due to their alignment with EHO's internal mechanisms, such as clan division and worst-solution handling. K-Means was integrated by replacing random clan division with similarity-based group- ing. DBSCAN, on the other hand, was adapted both to replace the random clan division using a density-based similarity approach and, in addition, to detect and manage outliers by improving the considered worst individuals through guided reintegration. These hybridizations resulted in sub- stantial performance gains, with the DBSCAN-based approach achieving the best balance of high satisfiability and low execution time. These findings confirm that combining data-driven clustering with swarm-based metaheuristics offers a promising direction for solving complex discrete prob- lems.
Keywords: Metaheuristic,Swarm intelligence , EHO, Data Mining, Clustering, Problem Solving, SAT, Stagnation, Hybridization. |
fr_FR |
| dc.language.iso |
en |
fr_FR |
| dc.publisher |
Université Blida 1 |
fr_FR |
| dc.subject |
Metaheuristic |
fr_FR |
| dc.subject |
Swarm intelligence |
fr_FR |
| dc.subject |
Hybridization. |
fr_FR |
| dc.subject |
EHO |
fr_FR |
| dc.subject |
Data Mining |
fr_FR |
| dc.subject |
Clustering |
fr_FR |
| dc.subject |
Problem Solving |
fr_FR |
| dc.subject |
SAT |
fr_FR |
| dc.subject |
Stagnation |
fr_FR |
| dc.title |
Data Mining Techniques and Metaheuristics for Problem Solving: |
fr_FR |
| dc.title.alternative |
Application to the SAT Problem |
fr_FR |
| dc.type |
Thesis |
fr_FR |
Fichier(s) constituant ce document
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée