首页> 外文期刊>Applied Soft Computing >An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering
【24h】

An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering

机译:一种改进的具有全局探索能力的磷虾群算法,用于解决数值函数优化问题及其在数据聚类中的应用

获取原文
获取原文并翻译 | 示例
       

摘要

Krill herd algorithm is a stochastic nature-inspired algorithm for solving optimization problems. The performance of krill herd algorithm is degraded by poor exploitation capability. In this study, we propose an improved krill herd algorithm (IKH) by making the krill the global search capability. The enhancement comprises of adding global search operator for exploration around the defined search region and thus the krill individuals move towards the global best solution. The elitism strategy is also applied to maintain the best krill during the krill update steps. The proposed method is tested on a set of twenty six wellknown benchmark functions and is compared with thirteen popular optimization algorithms, including original KH algorithm. The experimental results show that the proposed method produced very accurate results than KH and other compared algorithms and is more robust. In addition, the proposed method has high convergence rate. The high performance of the proposed algorithm is then employed for data clustering problems and is tested using six real datasets available from UCI machine learning laboratory. The experimental results thus show that the proposed algorithm is well suited for solving even data clustering problems. (C) 2016 Elsevier B.V. All rights reserved.
机译:磷虾群算法是一种自然启发式的随机算法,用于解决优化问题。磷虾群算法的性能由于开发能力差而降低。在这项研究中,我们通过使磷虾具有全局搜索功能,提出了一种改进的磷虾畜群算法(IKH)。增强功能包括添加全局搜索运算符以在定义的搜索区域周围进行探索,因此磷虾个体朝着全局最佳解决方案迈进。精英策略也适用于在磷虾更新步骤中维持最佳磷虾。该方法在一组26个著名的基准函数上进行了测试,并与包括原始KH算法在内的13种流行的优化算法进行了比较。实验结果表明,所提出的方法比KH和其他比较算法产生了非常准确的结果,并且更健壮。另外,该方法具有较高的收敛速度。然后,将所提出算法的高性能用于数据聚类问题,并使用可从UCI机器学习实验室获得的六个真实数据集进行测试。实验结果表明,该算法非常适合解决甚至数据聚类问题。 (C)2016 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号