An improved ACS algorithm for data clustering

• Main Authors: Mohammed Jabbar, Ayad, Ku-Mahamud, Ku Ruhana, Sagban, Rafid
• Format: Article
• Language: English
• Published: Institute of Advanced Engineering and Science 2020
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/27277/1/IJEECS%2017%203%202020%201506%201515.pdf; http://repo.uum.edu.my/27277/; http://doi.org/10.11591/ijeecs.v17.i3.pp1506-1515
• Institution: Universiti Utara Malaysia

Data clustering is a data mining technique that discovers hidden patterns by creating groups (clusters) of objects. Each object in every cluster exhibits sufficient similarity to its neighbourhood, whereas objects with insufficient similarity are found in other clusters. Data clustering techniques minimise intra-cluster similarity in each cluster and maximise inter-cluster dissimilarity amongst different clusters. Ant colony optimisation for clustering (ACOC) is a swarm algorithm inspired by the foraging behaviour of ants. This algorithm minimises deterministic imperfections in which clustering is considered an optimisation problem. However, ACOC suffers from high diversification in which the algorithm cannot search for best solutions in the local neighbourhood. To improve the ACOC, this study proposes a modified ACOC, called M-ACOC, which has a modification rate parameter that controls the convergence of the algorithm. Comparison of the performance of several common clustering algorithms using real-world datasets shows that the accuracy results of the proposed algorithm surpasses other algorithms.