当前位置: X-MOL 学术Eng. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Variants of bat algorithm for solving partitional clustering problems
Engineering with Computers ( IF 8.7 ) Pub Date : 2021-03-11 , DOI: 10.1007/s00366-021-01345-3
Yugal Kumar , Arvinder Kaur

Clustering is an exploratory data analysis technique that organize the data objects into clusters with optimal distance efficacy. In this work, a bat algorithm is considered to obtain optimal set of clusters. The bat algorithm is based on the echolocation feature of micro bats. Moreover, some improvements are proposed to overcome the shortcoming associated with bat algorithm like local optima, slow convergence, initial seed points and trade-off between local and global search mechanisms etc. An enhanced cooperative co-evolution method is proposed for addressing the initial seed points selection issue. The local optima issue is handled through neighbourhood search-based mechanism. The trade-off issue among local and global searches of bat algorithm is addressed through a modified elitist strategy. On the basis of aforementioned improvements, three variants (BA-C, BA-CN and BA-CNE) of bat algorithm is developed and efficacy of these variants is tested over twelve benchmark clustering datasets suing intra-cluster distance, accuracy and rand index parameters. Simulation results showed that BA-CNE variant achieves more effective clustering results as compared to BA-C, BA-CN and BA. The simulation results of BA-CNE are also compared with several existing clustering algorithms and two statistical tests are also applied to investigate the statistical difference among BA-CNE and other clustering algorithms. The simulation and statistical results confirmed that BA-CNE is an effective and robust algorithm for handling partitional clustering problems.



中文翻译:

解决分区聚类问题的bat算法的变体

聚类是一种探索性数据分析技术,可将数据对象组织成具有最佳距离功效的聚类。在这项工作中,蝙蝠算法被认为是获得最佳集群集。蝙蝠算法基于微型蝙蝠的回声定位功能。此外,提出了一些改进措施,以克服与蝙蝠算法相关的缺点,例如局部最优,收敛慢,初始种子点以及局部和全局搜索机制之间的折衷等。提出了一种用于解决初始种子问题的改进的协同协同进化方法。点选择问题。通过基于邻域搜索的机制来处理局部最优问题。通过改进的精英策略解决了蝙蝠算法在本地和全局搜索之间的权衡问题。在上述改进的基础上,开发了蝙蝠算法的三个变体(BA-C,BA-CN和BA-CNE),并根据集群内距离,准确性和rand指数参数在十二个基准聚类数据集中测试了这些变体的功效。仿真结果表明,与BA-C,BA-CN和BA相比,BA-CNE变体实现了更有效的聚类结果。还将BA-CNE的仿真结果与几种现有的聚类算法进行了比较,并且还进行了两次统计检验,以研究BA-CNE与其他聚类算法之间的统计差异。仿真和统计结果证实,BA-CNE是一种有效且健壮的算法,可以处理分区聚类问题。开发了bat算法的BA-CN和BA-CNE),并使用聚类内距离,准确性和rand指数参数在十二个基准聚类数据集中测试了这些变体的功效。仿真结果表明,与BA-C,BA-CN和BA相比,BA-CNE变体实现了更有效的聚类结果。还将BA-CNE的仿真结果与几种现有的聚类算法进行了比较,并且还进行了两次统计检验,以研究BA-CNE与其他聚类算法之间的统计差异。仿真和统计结果证实,BA-CNE是一种有效且健壮的算法,可以处理分区聚类问题。开发了bat算法的BA-CN和BA-CNE),并使用聚类内距离,准确性和rand指数参数在十二个基准聚类数据集中测试了这些变体的功效。仿真结果表明,与BA-C,BA-CN和BA相比,BA-CNE变体实现了更有效的聚类结果。还将BA-CNE的仿真结果与几种现有的聚类算法进行了比较,并且还进行了两次统计检验,以研究BA-CNE与其他聚类算法之间的统计差异。仿真和统计结果证实,BA-CNE是一种有效且健壮的算法,可以处理分区聚类问题。仿真结果表明,与BA-C,BA-CN和BA相比,BA-CNE变体实现了更有效的聚类结果。还将BA-CNE的仿真结果与几种现有的聚类算法进行了比较,并且还进行了两次统计检验,以研究BA-CNE与其他聚类算法之间的统计差异。仿真和统计结果证实,BA-CNE是一种有效且健壮的算法,可以处理分区聚类问题。仿真结果表明,与BA-C,BA-CN和BA相比,BA-CNE变体实现了更有效的聚类结果。还将BA-CNE的仿真结果与几种现有的聚类算法进行了比较,并且还进行了两次统计检验,以研究BA-CNE与其他聚类算法之间的统计差异。仿真和统计结果证实,BA-CNE是一种有效且健壮的算法,可以处理分区聚类问题。

更新日期:2021-03-12
down
wechat
bug