基于ACO-PSO自适应的划分聚类算法

摘要

Aiming at the problem that the prior unknown clustering number K and the random selection of the initial clustering center for the classical partitioning algorithm lead to local optimum, we propose a partitioning clustering algorithm based on ACO-PSO adaptability.Firstly, according to the basic principle of the minimum difference and maximum similarity within the class and the maximum difference and minimum similarity between classes, the adaptive K value of the clustering algorithm is obtained by using the individual contour coefficient as the test function of the best clustering number.Secondly, in combination with advantages of particle swarm optimization algorithm and ant colony algorithm inspired by swarm intelligence search, the initial pheromone distribution is obtained by particle swarm optimization algorithm with wholeness and rapidity, and then the exact solution is got by ant colony algorithm with positive feedback and parallelism.Finally, the simulation on multiple UCI data sets shows that the proposed algorithm is not only superior to the traditional clustering and initial clustering center algorithm based on individual contour coefficient optimization, but also shortens clustering time greatly, which is more obvious in convergence speed when applied to big data.%针对经典划分算法聚类数K先验未知及初始聚类中心随机选取, 导致陷入局部最优的问题, 提出一种基于ACO-PSO自适应的划分聚类算法.首先根据聚类算法类内相似度最大差异度最小和类间相似度最小差异度最大的基本原则, 将个体轮廓系数作为最佳聚类数的检验函数, 得到聚类算法的自适应K值;其次利用群智能搜索方法思想, 有效结合了粒子群算法和蚁群算法的优点, 先利用具有全局性和快速性的粒子群算法获得初始信息素分布, 再利用具有正反馈性和并行性的蚁群算法得到精确解.最后在多个UCI数据集上的仿真结果表明, 该算法不仅求解能力优于传统聚类算法及基于个体轮廓系数优化的初始聚类中心算法, 而且聚类时间效率大大提高, 应用于大数据收敛速度更加明显.