基于微粒群算法的聚类算法改进  

Improved Research of Clustering Algorithm Based on PSO

作　　者：张丽[1] 刘希玉[1] 

机构地区：[1]山东师范大学,山东济南250014

出　　处：《计算机技术与发展》2010年第11期126-129,共4页Computer Technology and Development

基　　金：国家自然科学基金资助项目(60873058);山东省自然科学基金资助项目(Z2007G03)

摘　　要：现有的对多维数据进行聚类的常用聚类算法,通常需要事先给定聚类数k。但在大多数情况下,聚类数k事先无法确定,因此需要对最佳聚类数k进行优化处理。采用基于微粒群算法的聚类算法。为了解决微粒群聚类算法无法确定聚类数k的现象,通过k均值算法的引入,实现最佳聚类数k的求解和聚类有效性函数的构造,试验证明引入类间距离的聚类有效性检测函数对最佳聚类数判别科学,同时由于检测函数中类间距离权重的引入使该检测函数可以更好地应用于现实数据分析。The existing common clustering algorithms of multi-dimensional data usually require giving the number of clusters k in advance.However,in most cases,the number of clusters k can not be determined in advance,so the best number of clusters k needs to be optimized.Use the clustering algorithm based on particle swarm optimization.In order to solve that the clustering algorithm based on PSO can not determine the number of clusters k,by the k-means algorithm,achieve the best number of cluster k and the structuring of the cluster validity function.The testing has proved the effectiveness of cluster detection function to determine the best number of clusters,and because of the introduction of the weights of classes,the detection function can be better applied to real data analysis.

关 键 词：微粒群算法 聚类优化 有效性函数 距离权重 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]