An Improved Dung Beetle Optimizer for Random Forest Optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Tan, Lianghao, Liu, Xiaoyi, Liu, Dong, Liu, Shubing, Wu, Weixi, Jiang, Huangqi
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915037139959808
author Tan, Lianghao
Liu, Xiaoyi
Liu, Dong
Liu, Shubing
Wu, Weixi
Jiang, Huangqi
author_facet Tan, Lianghao
Liu, Xiaoyi
Liu, Dong
Liu, Shubing
Wu, Weixi
Jiang, Huangqi
contents To improve the convergence speed and optimization accuracy of the Dung Beetle Optimizer (DBO), this paper proposes an improved algorithm based on circle mapping and longitudinal-horizontal crossover strategy (CICRDBO). First, the Circle method is used to map the initial population to increase diversity. Second, the longitudinal-horizontal crossover strategy is applied to enhance the global search ability by ensuring the position updates of the dung beetle. Simulations were conducted on 10 benchmark test functions, and the results demonstrate that the improved algorithm performs well in both convergence speed and optimization accuracy. The improved algorithm is further applied to the hyperparameter selection of the Random Forest classification algorithm for binary classification prediction in the retail industry. Various combination comparisons prove the practicality of the improved algorithm, followed by SHapley Additive exPlanations (SHAP) analysis.
format Preprint
id arxiv_https___arxiv_org_abs_2411_17738
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An Improved Dung Beetle Optimizer for Random Forest Optimization
Tan, Lianghao
Liu, Xiaoyi
Liu, Dong
Liu, Shubing
Wu, Weixi
Jiang, Huangqi
Optimization and Control
Neural and Evolutionary Computing
To improve the convergence speed and optimization accuracy of the Dung Beetle Optimizer (DBO), this paper proposes an improved algorithm based on circle mapping and longitudinal-horizontal crossover strategy (CICRDBO). First, the Circle method is used to map the initial population to increase diversity. Second, the longitudinal-horizontal crossover strategy is applied to enhance the global search ability by ensuring the position updates of the dung beetle. Simulations were conducted on 10 benchmark test functions, and the results demonstrate that the improved algorithm performs well in both convergence speed and optimization accuracy. The improved algorithm is further applied to the hyperparameter selection of the Random Forest classification algorithm for binary classification prediction in the retail industry. Various combination comparisons prove the practicality of the improved algorithm, followed by SHapley Additive exPlanations (SHAP) analysis.
title An Improved Dung Beetle Optimizer for Random Forest Optimization
topic Optimization and Control
Neural and Evolutionary Computing
url https://arxiv.org/abs/2411.17738