Department of Applied Mathematics, Xi'an University of Technology, Xi'an, 710054, PR China; School of Computer Science and Engineering,, Xi'an University of Technology, Xi'an, 710048, PR China.
Department of Applied Mathematics, Xi'an University of Technology, Xi'an, 710054, PR China.
Comput Biol Med. 2022 Dec;151(Pt A):106239. doi: 10.1016/j.compbiomed.2022.106239. Epub 2022 Oct 31.
Real-world optimization problems require some advanced metaheuristic algorithms, which functionally sustain a variety of solutions and technically explore the tracking space to find the global optimal solution or optimizer. One such algorithm is the newly developed COOT algorithm that is used to solve complex optimization problems. However, like other swarm intelligence algorithms, the COOT algorithm also faces the issues of low diversity, slow iteration speed, and stagnation in local optimization. In order to ameliorate these deficiencies, an improved population-initialized COOT algorithm named COBHCOOT is developed by integrating chaos map, opposition-based learning strategy and hunting strategy, which are used to accelerate the global convergence speed and boost the exploration efficiency and solution quality of the algorithm. To validate the dominance of the proposed COBHCOOT, it is compared with the original COOT algorithm and the well-known natural heuristic optimization algorithm on the recognized CEC2017 and CEC2019 benchmark suites, respectively. For the 29 CEC2017 problems, COBHCOOT performed the best in 15 (51.72%, 30-Dim), 14 (48.28%, 50-Dim) and 11 (37.93%, 100-Dim) respectively, and for the 10 CEC2019 benchmark functions, COBHCOOT performed the best in 7 of them. Furthermore, the practicability and potential of COBHCOOT are also highlighted by solving two engineering optimization problems and four truss structure optimization problems. Eventually, to examine the validity and performance of COBHCOOT for medical feature selection, eight medical datasets are used as benchmarks to compare with other superior methods in terms of average accuracy and number of features. Particularly, COBHCOOT is applied to the feature selection of cervical cancer behavior risk dataset. The findings testified that COBHCOOT achieves better accuracy with a minimal number of features compared with the comparison methods.
真实世界的优化问题需要一些先进的元启发式算法,这些算法在功能上支持多种解决方案,并在技术上探索跟踪空间,以找到全局最优解或优化器。一种这样的算法是新开发的 COOT 算法,用于解决复杂的优化问题。然而,与其他群体智能算法一样,COOT 算法也面临着多样性低、迭代速度慢和局部优化停滞的问题。为了改善这些缺陷,通过整合混沌映射、对向学习策略和狩猎策略,开发了一种改进的种群初始化 COOT 算法,命名为 COBHCOOT,用于加速全局收敛速度,提高算法的探索效率和解决方案质量。为了验证所提出的 COBHCOOT 的优势,将其与原始 COOT 算法和著名的自然启发式优化算法在公认的 CEC2017 和 CEC2019 基准套件上进行了比较。对于 29 个 CEC2017 问题,COBHCOOT 在 15 个(51.72%,30 维)、14 个(48.28%,50 维)和 11 个(37.93%,100 维)中表现最好,对于 10 个 CEC2019 基准函数,COBHCOOT 在其中 7 个中表现最好。此外,通过解决两个工程优化问题和四个桁架结构优化问题,突出了 COBHCOOT 的实用性和潜力。最后,为了检验 COBHCOOT 在医学特征选择中的有效性和性能,使用八个医学数据集作为基准,与其他优越方法在平均准确率和特征数量方面进行比较。特别是,COBHCOOT 被应用于宫颈癌行为风险数据集的特征选择。研究结果证明,与比较方法相比,COBHCOOT 用最少的特征实现了更好的准确性。