Kernel-based exponential grey wolf optimizer for rapid centroid estimation in data clustering

Clustering finds variety of application in a wide range of disciplines because it is mostly helpful for grouping of similar data objects together. due to the wide applicability,different algorithms have been presented in the literature for segmenting large multidimensional data into discernible representative clusters. accordingly,in this paper,kernel-based exponential grey wolf optimizer (kegwo) is developed for rapid centroid estimation in data clustering. here,kegwo is newly proposed to search the cluster centroids with a new objective evaluation which considered two parameters called logarithmic kernel function and distance difference between two top clusters. based on the new objective function and the modified kegwo algorithm,centroids are encoded as position vectors and the optimal location is found for the final clustering. the proposed kegwo algorithm is evaluated with banknote authentication data set,iris dataset and wine dataset using four metrics such as,mean square error,f-measure,rand co-efficient and jaccord coefficient. from the outcome,we proved that the proposed kegwo algorithm outperformed the existing algorithms. © 2016,penerbit utm press. all rights reserved.