arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.5348cs.NEcs.LG
收藏

基于PSO聚类算法的性能比较

Performance Comparisons of PSO based Clustering

Anil Neerukonda Institute of Technology and Sciences(阿尼尔·尼鲁孔达科技学院);Bhubanananda Orissa School of Engineering(布巴纳南达奥里萨工程学院);FM University(FM大学);JNTU College of Engineering(贾瓦哈拉尔·尼赫鲁技术大学工程学院);College of Engineering, AU(安得拉大学工程学院)

Suresh Chandra Satapathy, Gunanidhi Pradhan, Sabyasachi Pattnaik, J. V. R. Murthy, P. V. G. D. Prasad Reddy

摘要:

在本文中,我们已经研究了基于粒子群优化算法的性能聚类的几个真实世界的数据集和一个人工数据集。该算法的性能通过量化误差和簇间距离两个度量指标来衡量。首先对所有数据集实施K均值聚类算法,其结果形成基于PSO的方法的比较的基础。我们已经探索了不同的变种的PSO,如gbest,lbest环,lbest vonchann和混合PSO进行比较。结果表明,基于PSO的聚类算法在所有数据集上的性能优于K均值。

英文摘要:

In this paper we have investigated the performance of PSO Particle Swarm Optimization based clustering on few real world data sets and one artificial data set. The performances are measured by two metric namely quantization error and inter-cluster distance. The K means clustering algorithm is first implemented for all data sets, the results of which form the basis of comparison of PSO based approaches. We have explored different variants of PSO such as gbest, lbest ring, lbest vonneumann and Hybrid PSO for comparison purposes. The results reveal that PSO based clustering algorithms perform better compared to K means in all data sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑