|
|
a clustering approach by sspco optimization algorithm based on chaotic initial population
|
|
|
|
|
نویسنده
|
omidvar rohollah ,parvin hamid ,eskandari amin
|
منبع
|
journal of electrical and computer engineering innovations - 2016 - دوره : 4 - شماره : 1 - صفحه:31 -38
|
چکیده
|
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. sspco optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called seesee partridge. one of the things that smart algorithms are applied to solve is the problem of clustering. clustering is employed as apowerful tool in many data mining applications, data analysis, and data compression in order to group data on the number of clusters (groups). in the present article, a chaotic sspco algorithm is utilized for clusteringdata on different benchmarks and datasets; moreover, clustering with artificial bee colony algorithm and particle mass 9 clustering technique is compared. clustering tests have been done on 13 datasets from ucimachine learning repository. the results show that clustering sspco algorithm is a clustering technique which is very efficient in clustering multivariate data.
|
کلیدواژه
|
sspco algorithm ,chaotic ,clustering ,initial population ,data set
|
آدرس
|
islamic azad university, yasooj branch, young researchers and elite club, ایران, islamic azad university, nourabad mamasani branch, young researchers and elite club, ایران, islamic azad university, shiraz branch, sama technical and vocational training college, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|