Depot Institutionnel de l'UMBB >
Publications Scientifiques >
Communications Internationales >
Veuillez utiliser cette adresse pour citer ce document :
http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/6871
|
Titre: | Accelerated modified sine cosine algorithm for data clustering |
Auteur(s): | Boushaki, Saida Ishak Bendjeghaba, Omar Brakta, Noureddine |
Mots-clés: | Clustering Data mining Metaheuristic Optimization Sine Cosine Metaheuristic Algorithm |
Date de publication: | 2021 |
Editeur: | IEEE |
Collection/Numéro: | 2021 IEEE 11th Annual Computing and Communication Workshop and Conference, CCWC 202127 January 2021;pp. 715-720 |
Résumé: | In artificial intelligence, data mining is a process that automatically discover valuable information from huge amounts of data in order to obtain knowledge. The most important unsupervised technique of data mining is the clustering technic, which his main task is dividing the dataset into homogeneous groups. Metaheuristics based clustering is an actual research area where optimization algorithms have demonstrated their efficiencies to provide near optimal solutions to this problem in a reasonable time, including the recent Sine Cosine metaheuristic Algorithm (SCA). However, its convergence rate is still rather slow. In this paper, an upgraded adaptation of SCA is proposed to improve the exhibition capacities of the quest strategy for ideal results for data Clustering problem, named AMSCAC. In this algorithm, both the local and global search procedures are enhanced by additional strategy. The experimental results on five standard datasets are promising and confirm the superiority of AMSCAC, for the clustering results over SCA, cuckoo search algorithm (CS), differential evolution algorithm (DE), and genetic algorithm (GA) |
URI/URL: | DOI: 10.1109/CCWC51732.2021.9376122 https://ieeexplore.ieee.org/document/9376122 http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/6871 |
ISBN: | 978-073814394-1 |
Collection(s) : | Communications Internationales
|
Fichier(s) constituant ce document :
|
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.
|