Journal of South China University of Technology(Natural Science) >
GK Clustering Model Based on Optimal Initial Clustering Center of AFS
Received date: 2014-04-23
Revised date: 2014-06-05
Online published: 2014-08-01
Supported by
国家自然科学基金资助项目(51210013,51479216);国家科技支撑计划项目(2012BAC21B0103);教育部高等学校博士学科点专项科研基金新教师类资助课题(20114407120006);广东省自然科学基金博士启动项目(S2011040005992);广东高校优秀青年创新人才培养计划(育苗工程)项目(LYM11049);水利部公益项目(201201094,201301002-02);广东省水利科技创新项目(2011-11)
Gustafson- Kessel (GK) clustering algorithm can be used to search for hyper ellipsoid,plane and lineardata effectively,but it is still sensitive to initial clustering center and easy to fall into a local optimum.In order tosolve this problem,this paper presents an improved GK clustering algorithm,which adopts the artificial fish- swarm(AFS) algorithm to initialize clustering centers according to the similarity between clustering and searching food offish school.Then,this algorithm is employed to perform a simulation based on artificial data and IRIS data.Theresults show that the improved algorithm can find the clustering structure of datasets effectively,and it possesses abetter classification performance than GK clustering algorithm.
Wang Li- na Chen Xiao- hong . GK Clustering Model Based on Optimal Initial Clustering Center of AFS[J]. Journal of South China University of Technology(Natural Science), 2014 , 42(9) : 65 -69 . DOI: 10.3969/j.issn.1000-565X.2014.09.012
/
| 〈 |
|
〉 |