Classification techniques, reliant on annotated data for autonomous decision training, have become pivotal tools in diverse domains. These techniques rely on models like Backpropagation Neural Networks (BPNNs). However, BPNNs frequently trap local optima, leading to suboptimal classification accuracy, and its convergence speed is relatively slow, which affects efficiency in complex and non-linear process data classification applications. Existing optimization algorithms struggle to balance global exploration and local exploitation when adjusting BPNNs. Addressing these limitations, this paper proposes a BP classifier based on an Elephant Herding Optimization with Multi-Learning strategy (MLEHO), termed MLEHO-BPC. The proposed MLEHO establishes a triple learning framework. Firstly, a collective learning stage incorporates two different adaptive operators into the original algorithm to strengthen global exploration. Subsequently, a group learning stage is designed, integrating exemplar, deskmate, and random learning methods to enhance convergence efficiency. Finally, a tutorship learning stage, guided by fitness value discrimination, empowers the algorithm to escape local optima. Benchmark function tests confirm MLEHO’s superiority in convergence speed and stability over comparative algorithms. Furthermore, MLEHO replaces traditional gradient descent, reformulating the BPNN’s update mechanism to optimize weights and thresholds. Validated on classification datasets and a Ti6Al4V process classification problem, MLEHO-BPC demonstrates exceptional classification accuracy and robustness against other algorithm classifiers.
Xu et al. (Tue,) studied this question.