K-NICHEPSO CLUSTERING

摘要：

In clustering algorithm based on criterion function optimization, at first the numbers of clusters are predefined the clustering will be done. For obtaining a suitable result, these algorithms must be suitable with different number of clusters, after that result will be evaluated. To solve this problem a new method is presented, in this article NichePSO algorithm which enables us to calculate the number of clusters and estimate their position by considering data automatically.

关键词： Niche PSO Clustering K-means KPSO

作者: N.SALMANI NIASAR S.YAZDANI M.MOHAJERI

作者单位: Computer Eng., Science & Research Faculty, IAU, Iran, Tehran Compurer Eng., Kerman Azad University, IAU, Iran, Kerman

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 2668-2672

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）