Hybrid Genetic Algorithm with K-Means for Clustering Problems
Open Journal of Optimization · 2016 · 05 (02) · 71-83
DOI: 10.4236/ojop.2016.52009 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Optimization, 2016. Verfasst von Ahamed Al Malki und 3 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.
Zitieren
APA
Malki, A. A., Rizk, M. M., El-Shorbagy, M. A., & Mousa, A. A. (2016). Hybrid Genetic Algorithm with K-Means for Clustering Problems. Open Journal of Optimization, 05(02), 71-83. https://doi.org/10.4236/ojop.2016.52009
Vancouver
Malki AA, Rizk MM, El-Shorbagy MA, Mousa AA. Hybrid Genetic Algorithm with K-Means for Clustering Problems. Open Journal of Optimization. 2016;05(02):71-83. doi:10.4236/ojop.2016.52009
BibTeX
@article{Malki2016,
author = {Malki, Ahamed Al and Rizk, Mohamed M. and El-Shorbagy, M. A. and Mousa, A. A.},
title = {Hybrid Genetic Algorithm with K-Means for Clustering Problems},
journal = {Open Journal of Optimization},
year = {2016},
volume = {05},
number = {02},
pages = {71--83},
doi = {10.4236/ojop.2016.52009}
}
EUVIMED