META-HEURISTIC ALGORITHMS FOR K-MEANS CLUSTERING: A REVIEW
Abstract
The increase in the data available attracted the concern of clustering approaches to integrate them coherently and to identify patterns for big data.Hence, Meta-Heuristic algorithmscan be better than standard optimization algorithms in some instances. Previously, optimization issues have been considered as significant weaknesses in the K-means algorithm is one of the simplest methods for clustering. and with less additional information it can easily solve the optimization problem.In this paper, a review of clustering k-means algorithm and meta-heuristics algorithms are reviewed.
Downloads
Downloads
Published
2020-11-02 — Updated on 2020-11-04
How to Cite
Alan Fuad Jahwar, Adnan Mohsin Abdulazeez. (2020). META-HEURISTIC ALGORITHMS FOR K-MEANS CLUSTERING: A REVIEW . PalArch’s Journal of Archaeology of Egypt / Egyptology, 17(7), 12002-12020. Retrieved from https://archives.palarch.nl/index.php/jae/article/view/4630
Issue
Section
Articles