An Improved Crow Search Algorithm for Data Clustering

Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search...

Full description

Bibliographic Details
Main Authors: Vivi Nur Wijayaningrum, Novi Nur Putriwijaya
Format: Article
Language:English
Published: Politeknik Elektronika Negeri Surabaya 2020-06-01
Series:Emitter: International Journal of Engineering Technology
Subjects:
Online Access:https://emitter.pens.ac.id/index.php/emitter/article/view/498
id doaj-1ff498c273554797bbaa419cb085d062
record_format Article
spelling doaj-1ff498c273554797bbaa419cb085d0622021-02-03T08:32:42ZengPoliteknik Elektronika Negeri Surabaya Emitter: International Journal of Engineering Technology2355-391X2443-11682020-06-018110.24003/emitter.v8i1.498498An Improved Crow Search Algorithm for Data ClusteringVivi Nur Wijayaningrum0Novi Nur Putriwijaya1Politeknik Negeri MalangInstitut Teknologi Sepuluh Nopember Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search agents are not able to reach the best solution in the search space. In this study, the problem is overcome by modifying the solution update mechanism so that a search agent not only follows another randomly chosen search agent, but also has the opportunity to follow the best search agent. In addition, the balance of exploration and exploitation is also enhanced by the mechanism of updating the awareness probability of each search agent in accordance with their respective abilities in searching for solutions. The improve mechanism makes the proposed algorithm obtain pretty good solutions with smaller computational time compared to Genetic Algorithm and Particle Swarm Optimization. In large datasets, it is proven that the proposed algorithm is able to provide the best solution among the other algorithms. https://emitter.pens.ac.id/index.php/emitter/article/view/498awareness probabilityclusteringcrow search algorithmmetaheuristic algorithm
collection DOAJ
language English
format Article
sources DOAJ
author Vivi Nur Wijayaningrum
Novi Nur Putriwijaya
spellingShingle Vivi Nur Wijayaningrum
Novi Nur Putriwijaya
An Improved Crow Search Algorithm for Data Clustering
Emitter: International Journal of Engineering Technology
awareness probability
clustering
crow search algorithm
metaheuristic algorithm
author_facet Vivi Nur Wijayaningrum
Novi Nur Putriwijaya
author_sort Vivi Nur Wijayaningrum
title An Improved Crow Search Algorithm for Data Clustering
title_short An Improved Crow Search Algorithm for Data Clustering
title_full An Improved Crow Search Algorithm for Data Clustering
title_fullStr An Improved Crow Search Algorithm for Data Clustering
title_full_unstemmed An Improved Crow Search Algorithm for Data Clustering
title_sort improved crow search algorithm for data clustering
publisher Politeknik Elektronika Negeri Surabaya
series Emitter: International Journal of Engineering Technology
issn 2355-391X
2443-1168
publishDate 2020-06-01
description Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search agents are not able to reach the best solution in the search space. In this study, the problem is overcome by modifying the solution update mechanism so that a search agent not only follows another randomly chosen search agent, but also has the opportunity to follow the best search agent. In addition, the balance of exploration and exploitation is also enhanced by the mechanism of updating the awareness probability of each search agent in accordance with their respective abilities in searching for solutions. The improve mechanism makes the proposed algorithm obtain pretty good solutions with smaller computational time compared to Genetic Algorithm and Particle Swarm Optimization. In large datasets, it is proven that the proposed algorithm is able to provide the best solution among the other algorithms.
topic awareness probability
clustering
crow search algorithm
metaheuristic algorithm
url https://emitter.pens.ac.id/index.php/emitter/article/view/498
work_keys_str_mv AT vivinurwijayaningrum animprovedcrowsearchalgorithmfordataclustering
AT novinurputriwijaya animprovedcrowsearchalgorithmfordataclustering
AT vivinurwijayaningrum improvedcrowsearchalgorithmfordataclustering
AT novinurputriwijaya improvedcrowsearchalgorithmfordataclustering
_version_ 1724287542654664704