4.7 Article

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

期刊

APPLIED SOFT COMPUTING
卷 46, 期 -, 页码 230-245

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2016.04.026

关键词

Global optimization; High convergence; Global exploration; Metaheuristic; 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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据