Ant-based sorting and ACO-based clustering approaches: A review

• Main Authors: Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid
• Format: Conference or Workshop Item
• Language: English
• Published: 2018
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/24426/1/ISCAIE%202018%20%20217%20223.pdf; http://repo.uum.edu.my/24426/; http://doi.org/10.1109/ISCAIE.2018.8405473
• Institution: Universiti Utara Malaysia

Data clustering is used in a number of fields including statistics, bioinformatics, machine learning exploratory data analysis, image segmentation, security, medical image analysis, web handling and mathematical programming.Its role is to group data into clusters with high similarity within clusters and with high dissimilarity between clusters.This paper reviews the problems that affect clustering performance for deterministic clustering and stochastic clustering approaches.In deterministic clustering, the problems are caused by sensitivity to the number of provided clusters.In stochastic clustering, problems are caused either by the absence of an optimal number of clusters or by the projection of data.The review is focused on ant-based sorting and ACO-based clustering which have problems of slow convergence, un-robust results and local optima solution.The results from this review can be used as a guide for researchers working in the area of data clustering as it shows the strengths and weaknesses of using both clustering approaches.