Pith. sign in

REVIEW 1 cited by

An Improved Dung Beetle Optimizer for Random Forest Optimization

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.17738 v1 pith:23WWH3T7 submitted 2024-11-24 math.OC cs.NE

Lianghao Tan , Xiaoyi Liu , Dong Liu , Shubing Liu , Weixi Wu , Huangqi Jiang This is my paper · ORCID
classification math.OCcs.NE
keywords algorithmimprovedbeetledungoptimizationaccuracyappliedcircle
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tutorial on Using Machine Learning and Deep Learning Models for Mental Illness Detection

    cs.CL 2025-02 conditional novelty 2.0 of 10

    A tutorial-style benchmark showing that standard classifiers reach binary F1 0.93 to 0.96 and multiclass F1 0.75 to 0.78 on a Kaggle mental-health text dataset, with no new method or result introduced.

Pith tools