- Balkan Journal of Electrical and Computer Engineering
- Volume:9 Issue:3
- An Approach Based on Tunicate Swarm Algorithm to Solve Partitional Clustering Problem
An Approach Based on Tunicate Swarm Algorithm to Solve Partitional Clustering Problem
Authors : Murat ASLAN
Pages : 242-248
Doi:10.17694/bajece.904882
View : 47 | Download : 14
Publication Date : 2021-07-30
Article Type : Research Paper
Abstract :The tunicate swarm algorithm insert ignore into journalissuearticles values(TSA); is a newly proposed population-based swarm optimizer for solving global optimization problems. TSA uses best solution in the population in order improve the intensification and diversification of the tunicates. Thus, the possibility of finding a better position for search agents has increased. The aim of the clustering algorithms is to distributed the data instances into some groups according to similar and dissimilar features of instances. Therefore, with a proper clustering algorithm the dataset will be separated to some groups with minimum similarities. In this work, firstly, an approach based on TSA algorithm has proposed for solving partitional clustering problem. Then, the TSA algorithm is implemented on ten different clustering problems taken from UCI Machine Learning Repository, and the clustering performance of the TSA is compared with the performances of the three well known clustering algorithms such as fuzzy c-means, k-means and k-medoids. The experimental results and comparisons show that the TSA based approach is highly competitive and robust optimizer for solving the partitional clustering problems.Keywords : Clustering, fuzzy c means, k means, k medoid, tunicate swarm algorithm
ORIGINAL ARTICLE URL