Elman Network Classifier Based on Hyperactivity Rat Swarm Optimizer and Its Applications for AlSi10Mg Process Classification

Abstract

Classification prediction technology, which utilizes labeled data for training to enable autonomous decision, has emerged as a pivotal tool across numerous fields. The Elman neural network (ENN) exhibits potential in tackling nonlinear problems. However, its computational process faces inherent limitations in escaping local optimum and experiencing a slow convergence rate. To improve these shortcomings, an ENN classifier based on Hyperactivity Rat Swarm Optimizer (HRSO), named HRSO-ENNC, is proposed in this paper. Initially, HRSO is divided into two phases, search and mutation, by means of a nonlinear adaptive parameter. Subsequently, five search actions are introduced to enhance the global exploratory and local exploitative capabilities of HRSO. Furthermore, a stochastic roaming strategy is employed, which significantly improves the ability to jump out of local positions. Ultimately, the integration of HRSO and ENN enables the substitution of the original gradient descent method, thereby optimizing the neural connection weights and thresholds. The experiment results demonstrate that the accuracy and stability of HRSO-ENNC have been effectively verified through comparisons with other algorithm classifiers on benchmark functions, classification datasets and an AlSi10Mg process classification problem.

1. Introduction

Classification prediction [1] is a significant technique within the areas of pattern recognition and data mining. The objectives are to define and distinguish model and function (i.e., classifier) for data class or concept, based on the characteristics of the dataset, which enables the system to predictively label unknown objects and make autonomous decisions. Numerous classification prediction methods have been proposed, such as Bayes [2], Naive Bayes [3], K-Nearest Neighbor (KNN) [4], Support Vector Machine (SVM) [5] and Neural Network [6]. However, some studies [7,8,9] demonstrate that no single classifier is optimal for all datasets. In contrast to standard classification problems such as image or text, process classification prediction, as a specific classification task, requires dealing with large volumes of high-dimensional nonlinear and label-ambiguous data. These unique challenges lead to suboptimal performance of traditional classification methods for process data [10,11]. Therefore, investigating more efficient classification methods tailored to different process datasets is particularly essential.

As a variant of Artificial Neural Network (ANN), the Elman neural network (ENN) is inspired by neurobiological principles. It is a local recursion delay feedback neural network that offers better stability and adaptability compared to ordinary neural networks, which makes it particularly adept at solving nonlinear problems. Consequently, the application of ENN has attracted significant research in many different engineering and scientific fields. Zhang et al. [12] utilize ENN to calculate the synthetic efficiency of a hydro turbine and find that it possesses superior nonlinear mapping abilities. In [13], an enhanced ENN is presented to solve the problem of quality prediction during product design. Li et al. [14] apply ENN to predict sectional passenger flow in urban rail transit, and the results highlight the accuracy and usefulness of the method. Gong et al. [15] employ ENN and wavelet decomposition to predict wind power generation, which achieves good results in this context. A modified ENN [16] is suggested for the purpose of establishing predictive relationships between the compressive and flexural strength of jarosite mixed concrete. A hidden recurrent feedback-based of modified Elman [17] is proposed to predict the absolute gas emission quantity, resulting in improved accuracy and efficiency.

ENN is also widely applied to classification prediction problems. Chiroma et al. [18] propose the Jordan-ENN classifier to help medical practitioners to quickly detect malaria and determine severity. Boldbaatar et al. [19] develop an intelligent classification system for breast tumors to distinguish between benign or malignant based on recurrent wavelet ENN. An improved Elman-AdaBoost algorithm [20] is proposed for fault diagnosis of rolling bearings operating under random noise conditions, ultimately achieving better accuracy and practicability. Arun et al. [21] introduce a deep ENN classifier for static sign language recognition. Zhang et al. [22] propose a hybrid classifier that combines a convolutional neural network (CNN) and ENN for radar waveform recognition, resulting in improved overall successful recognition ratio. A fusion model, which integrates Radial Basis Function (RBF) and ENN, is suggested for the purpose of solving residential load identification, and the results indicate that this method improves identification performance [23].

However, ENN also exhibits inherent limitations, particularly escaping from local optimum and convergence deceleration, ultimately resulting in low accuracy [24,25]. The primary factor contributing to this problem is the difficulty in obtaining the suitable weights and thresholds [26]. In order to overcome these weaknesses, it has become increasingly popular to combine Swarm Intelligence (SI), which is a stochastic optimization algorithm inspired by nature, with neural network to optimize weights and thresholds. In [27], the flamingo search algorithm is utilized to refine an enhanced Elman Spike neural network, thereby enabling it to effectively classify lung cancer in CT images. In [28], the weights, thresholds and numbers of hidden layer neurons of ENN are optimized by a genetic algorithm. Wang et al. [29] utilize the adaptive ant colony algorithm to optimize ENN and demonstrate its efficacy in compensating a drilling inclinometer sensor. Although the aforementioned methods of optimizing ENN via SI algorithms have demonstrated significant advantages across various fields, traditional classification methods still dominate the problem of process classification in Selective Laser Melting (SLM). Barile et al. [30,31] employed CNN to classify the deformation behavior of AlSi10Mg specimens fabricated under different SLM processes. Ji et al. [32] achieved effective classification of spatter features under different laser energy densities using SVM and Random Forest (RF). Li et al. [33] classified extracted melt pool feature data with Backpropagation neural network (BPNN), SVM and Deep Belief Network (DBN), thereby reducing the likelihood of porosity.

According to the literature review, a two-phase Rat Swarm Optimizer consisting of five search actions is proposed in this paper, named Hyperactive Rat Swarm Optimizer (HRSO). As stated by Moghadam et al. [34], RSO demonstrates algorithmic merits in simpler structure design and fast convergence. However, similar to other SI, RSO has difficultly in escaping from local optimum when handling complex objective functions or a large number of variables. For this reason, the algorithm outlined in this study is built upon the following four aspects.

First, a nonlinear adaptive parameter is introduced to regulate the balance of exploration and exploitation parts in search phase. Second, the center point search and cosine search are introduced to enhance the effectiveness of global search in the exploration part. Third, three methods, including rush search, contrast search and random search, are introduced into the exploitation part to improve the ability of convergence speed and local search. Fourth, a stochastic wandering strategy is introduced to enhance the ability to jump out local extreme values.

Another theme related to this paper is data classification prediction. To elevate the classification prediction capabilities of ENN, a classifier based on HRSO is proposed, named HRSO-ENNC. Unlike the traditional iterative training method for neural networks, the proposed classifier utilizes HRSO to adjust the weights and thresholds. Tested on benchmark functions, classification datasets and a practical AlSi10Mg process classification problem, the experiment results demonstrate the accuracy and stability of HRSO-ENNC.

The structure of this manuscript is arranged in the following manner. Section 2 provides an overview of the ENN and the original RSO. Section 3 elaborates on the proposed HRSO and the design of an ENN classifier. Section 4 presents the experiments conducted and the corresponding analysis of the results. Section 5 outlines the conclusions drawn from the research presented in this paper.

2. Related Works

2.1. Elman Neural Network

The neural network is an information processing framework and a universal machine learning method with broad applicability in numerous fields. The Elman neural network, which was first introduced by J. L. Elman [35] in 1990, is a well-known local recursion delay feedback neural network, which has a structure similar to the BP network [36], with the addition of a context layer. The schematic representation of the ENN’s architecture can be represented by Figure 1.

The topological structure of ENN typically comprises four distinct layers. The input layer, comprising linear neurons, serves as the entry for external signals and transmits them to the hidden layer. Through the activation function, hidden layer units perform translation or dilation on input signals. Subsequently, the context layer remembers output values from the hidden layer in the previous time step. This layer is used as a one-step delay module to provide a feedback mechanism. Ultimately, the output layer generates the final outputs based on the processed information from previous layers. This structure provides the system with the capacity to handle time-varying characteristics, thereby bolstering network stability and adaptation.

According to the above, assuming the ENN has M inputs and N outputs, and that both the hidden layer and the context layer are set to consist of K layer, the weights from the inputs to the hidden layer, from the hidden layer to the outputs and from the context layer to the hidden layer are represented by w₁, w₂ and w₃, respectively. The thresholds are denoted b₁, b₂ and b₃ for the hidden layer, the output layer and the context layer, respectively. Therefore, the mathematical model is expressed by Formula (1):

$$\left\{\begin{array}{l}x\left(t\right)=f\left(w_3{x}_c\left(t\right)+w_1\left(u\left(t-1\right)\right)\right)\\ x_c\left(t\right)=x\left(t-1\right)\\ y\left(t\right)=g\left(w_{2}x\left(t\right)\right)\end{array}\right.$$

(1)

In Formula (1), t serves as the current iteration number. u(t − 1) denotes the inputs provided to the ENN during the previous time step. x(t) represents the outputs generated by the hidden layer at t-th step, and the outputs of the context layer are denoted as x_c(t). y(t) represents the outputs of ENN at the current time step. The transfer function for the hidden layer and the output layer are denoted as f(∙) and g(∙), respectively.

2.2. Rat Swarm Optimizer

As a meta-heuristic algorithm based on swarm intelligence, the Rat Swarm Optimizer [37] emulates the rat population behavior of chasing and hunting. This algorithm can be summarized in two main parts. The first part involves rats chasing prey through the optimal individual to obtain a better position for searching. The second part is the process by which the rats attack the prey. The mathematical expressions for the two cases are provided in Formula (2), and RSO’s pseudo-algorithm is presented in Algorithm 1.

$$\left\{\begin{array}{c}{P}^t=A\ast X_i^t+C\ast \left(X_{best}^t-X_i^t\right)\\ X_i^{t+1}=\left|X_{best}^t-P\right|\end{array}\right.$$

(2)

In Formula (2), X denotes the position of the rat. t is the current iteration number. X^t_best represents the optimal individual of population during the t-th iteration. X^t_i signifies the position of i-th rat and P^t is the prey position for X^t_i. X_i^t+1 represents the next position of the i-th rat. A and C serve as update coefficients. The coefficient A is calculated by Formula (3):

$$A=R-R\ast t/T$$

(3)

In Formula (3), R and C constrain within [1, 5] and [0, 2], respectively. T is the maximum iteration number.

Algorithm 1 RSO
1	Initialization:
2	Generate the initial population Xi of the RSO
3	Calculate fitness scores and identify X*best
4	while t ≤ T do
5		for i = 1, 2, …, N do
6			Update parameters using Formula (3)
7			Update population positions using Formula (2)
8		end for
9		Calculate fitness scores and update X*best
10	end while

3. Methods

3.1. Improve Algorithm

In this section, a Hyperactivity Rat Swarm Optimizer (HRSO) based on multiple types of chase search and attack actions is proposed to improve the shortcomings of RSO. HRSO implements a two-phase calculation process, comprising a search and a mutation phase. The search phase is further divided into two parts, exploration and exploitation, by means of a nonlinear adaptive parameter. There are five search actions, center point search and cosine search, which are based on the exploration part, and rush search, contrast search and random search, which are based on the exploitation part. The mutation phase employs a stochastic wandering strategy. Algorithm 2 presents the pseudo-algorithm for HRSO.

Algorithm 2 HRSO
1	Initialization:
2	Generate the initial population Xi of the HRSO
3	Calculate fitness scores and identify X*best
4	while t ≤ T do
5		Execute Search Phase
6		for i = 1, 2, …, N do
7			Update parameters using Formulas (4) and (5)
8			if |E| ≥ 1 then
9			Execute Exploration Search using Algorithm 3
10			elseif |E| < 1 then
11			Execute Exploitation Search using Algorithm 4
12			end if
13		end for
14		Calculate fitness scores and identify X*best
15		Execute Mutation Phase using Algorithm 5
16		Calculate fitness scores and identify X*best
17	end while

3.2. Nonlinear Adaptive Parameter

A nonlinear adaptive parameter E is employed to enhance RSO, which is an important parameter to regulate the proportion of exploration and exploitation parts during the search phase. Depending on the absolute value of E, the algorithm either performs exploration part (when |E| ≥ 1) or exploitation part (when |E| < 1). The mathematical expression for E is given as in Formula (4).

$$E=2\ast E_0\ast cp$$

(4)

In Formula (4), E₀ is a random number from –1 to 1. cp is an adaptive parameter that decreases progressively with iterations. Its representation is given as Formula (5):

$$cp=1-t/T$$

(5)

According to Formulas (4) and (5), the range of values for parameter E can be determined as −2 to 2.

3.3. Exploration Search

To enable RSO to explore more deeply the invisible domains within search space to improve the efficiency of discovering the global optimal position, center point search and cosine search are introduced in the exploration part of the proposed algorithm.

Center point search is a linear search method based on the average position of the population, which uses cp to control the extended search. This search method is given as Formula (6).

$$X_i^{t+1}=cp\ast X_i^{best}+r_2\ast \left(mean\left(X_i^t\right)-X_{best}^{*}\right)$$

(6)

In Formula (6), mean(X^t_i) denotes the average position of the population. r₂ constrains within [0, 1].

The cosine search is a search pattern characterized by a wide range of oscillatory variation. A set of adaptive random numbers z is used to control the cosine fluctuation variation. This search method is given as Formula (7).

$$X_i^{t+1}=X_i^{best}+cp\ast z\ast cos\left(2\pi r_3\right)\ast \left(X_{best}^{*}-X_i^t\right)$$

(7)

In Formula (7), the mathematical expression for the parameter z is as follows, in Formula (8):

$$z=r_5+r_6$$

(8)

In Formula (8), r₃ and r₅ are random numbers. r₆ is Gaussian distributed random numbers. This is controlled by a random number r₄. When r₄ ≥ cp, r₆ shows parts greater than 0.5, otherwise, it shows the parts less than 0.5.

To maximize the exploration performance of HRSO, a random number r₁, with values between 0 and 1, is used to control the search method. Specifically, if r₁ ≥ 0.5, the search iteration is performed using Formula (6), otherwise, Formula (7) is used. The pseudo-algorithm for details of the exploration search is presented in Algorithm 3.

Algorithm 3 Exploration Search
1	Update parameters using Formulas (5) and (8)
2	Calculate mean(Xti) based on the current population
3	when |E| ≥ 1 then
4		if r1 ≥ 0.5 then
5			Update population positions using Formula (6)
6		else then
7			Update population positions using Formula (7)
8		end if
9	end when

3.4. Exploitation Search

To enhance the convergence speed and local search capability, three search methods are introduced into the exploitation part of the proposed algorithm, which are rush search, contrast search and random search.

The rush search is the same as the original algorithm, which is Equation (1), but the ranges of the parameters R and C are set to [1, 3] and [–1, 1] respectively, aiming to focus the algorithm on the neighborhood to enhance the local optimization.

The contrast search is performed by randomly selecting two individuals, j₁ and j₂, from the population and comparing them with the i-th individual, approaching in the direction of the optimal fitness value among the three individuals. The mathematical expression is as in Formulas (9) and (10):

$$X_i^{t+1}=X_i^t+r_7\ast \left(X_i^t-X_{j_m}^t\right)$$

(9)

$$X_i^{t+1}=X_i^t+r_7\ast \left(X_{j_m}^t-X_i^t\right)$$

(10)

In Formulas (9) and (10), r₇ denotes a random number that lies between 0 and 1. m is a constant with the value 1 or 2.

The random search also selects two individuals, with the current individual search in the direction of the optimal fitness value among j₁ and j₂. It can be expressed by Formulas (11) and (12):

$$X_i^{t+1}=X_i^t+r_8\ast \left(X_{j_1}^t-X_{j_2}^t\right)$$

(11)

$$X_i^{t+1}=X_i^t+r_8\ast \left(X_{j_2}^t-X_{j_1}^t\right)$$

(12)

In Formulas (11) and (12), r₈ constrains within [0, 1].

To maximize the exploitation performance of the proposed algorithm, a random constant k is introduced to determine the search methods, where k takes values of 1, 2 and 3. Specifically, k = 1 employs Formula (2) for the rush search, k = 2 utilizes Formula (9) for the contrast search and k = 3 applies Formula (10) for the random search. The pseudo-algorithm for details of the exploitation search is presented in Algorithm 4.

Algorithm 4 Exploitation Search
1.	Update random parameters k, j1, and j2
2.	when |E| < 1 then
3.		if k = 1 then
4.			Update population positions using Formula (2)
5.		elseif k = 2 then
6.			Update random parameters jm
7.			if fit(j) < fit(i) then
8.				Update population positions using Formula (9)
9.			else then
10.				Update population positions using Formula (10)
11.			end if
12.		elseif k = 3 then
13.			if fit(j1) < fit(j2) then
14.				Update population positions using Formula (11)
15.			else then
16.				Update population positions using Formula (12)
17.			end if
18.		end if
19.	end when

3.5. Stochastic Wandering Strategy

In the mutation phase, a stochastic wandering strategy is employed to improve the algorithmic capability to jump out of local extreme values. This means that a part of the population is randomly selected to be compared with the global optimization and updated iteratively, and the individual with the best fitness will be retained. This strategy is mathematically expressed as in Formulas (13) and (14):

$$X_i^{t+1}=X_{best}^{*}+randn\ast \left|X_i^t-X_{best}^{*}\right|$$

(13)

$$X_i^{t+1}=X_i^t+r_9\ast \left|X_i^t-X_{wrost}^{*}\right|/\left(fit\left(i\right)-fit\left(wrost\right)\right)$$

(14)

In Formulas (13) and (14), randn is a set of normally distributed random numbers. X*_wrost denotes the worst individual in a population at the t-th iteration. It is worth noting that a constant NS is used to control the number of individuals selected in this phase, with NS set to 0.2 in this paper. The pseudo-algorithm for details of the mutation phase is presented in Algorithm 5.

Algorithm 5 Mutation Phase
1.	for i = 1, 2, …, N do
2.		if fit(i) > fit(best) then
3.			Update population positions using Formula (13)
4.		else fit(i) = fit(best) then
5.			Update population positions using Formula (14)
6.		end if
7.	end for

3.6. Classifier Design

For constructing a complete HRSO-ENNC, the structural design of the hidden layer is also a key factor, indicating that the neuron count of the hidden layer has a significant influence on the ENN’s overall performance. An insufficient number of neurons can cause feature information to be lost during the propagation process, preventing the desired accuracy from being achieved. Conversely, an excessive number of neurons may lead to a more complex system prone to overfitting. It is important to highlight that the configuration of the hidden layer also has effects on the weights and thresholds optimization. Therefore, it is necessary to select a reasonable number for the hidden layer. The method presented in [38] is employed in this research, mathematically formalized as in Formula (15):

$$K=\sqrt{M+N}+a$$

(15)

Formula (15) represents a common empirical equation for determining the number of the hidden layer in neural network, where a represents an integer within the range of [1, 10].

Additionally, the gradient descend method is commonly employed to determine the suitable weights and thresholds in traditional ENN, but it easily obtains a local optimum, ultimately resulting in low accuracy for the system. According to the previous section, the proposed HRSO algorithm ensures an equilibrium between proportions of exploration and exploitation, and it shows a great ability to jump out of the local optimum. In this case, it serves as an adaptive global training method, which means that the proposed algorithm replaces traditional training processes to overcome the shortcomings of the ENN during weights and thresholds optimization. Algorithm 6 presents the pseudo-algorithm for HRSO-ENNC, and Figure 2 represents a specific flowchart.

Algorithm 6 HRSO-ENNC
1.	Input: Dataset sample
2.	Normalized dataset
3.	Selection of training set by the stratified k-fold cross validation method
4.	for i = 1, 2, …, k
5.		Initialize ENN and HRSO algorithm parameters
6.		Calculate fitness scores and identify X*best
7.		while t ≤ T do
8.			Update network parameters using Algorithm 2
9.			Calculate fitness scores and identify X*best
10.		end while
11.		Get X*best for i-th
12.		Update network parameters and Training ENN
13.		Output classification prediction results
14.	end for

4. Experiential Results and Analysis

4.1. Benchmark Functions Test

This section evaluates the HRSO using benchmark functions F₁ through F₂₀. F₁–F₇, listed in

Table 1. Expression of F₁–F₇ Benchmark Function.

Function	Function Formula	Dim	Range	Fbest
F1: Sphere	${\sum }_{i=1}^n{x}_i^2$	30	−100, 100	0
F2: Lunacek’s Bi-Sphere	$min\left({\sum }_{i=1}^n{\left(x_i-u_1\right)}^2, d·n+s·{\sum }_{i=1}^n{\left(x_i-u_2\right)}^2\right)$	30	−10, 10	0
F3: Sum of Different Powers	${\sum }_{i=1}^n{\left|x_i\right|}^{i+1}$	30	−1, 1	0
F4: Trid	${\sum }_{i=1}^n{\left(x_i-1\right)}^2-{\sum }_{i=2}^n{x}_i\ast x_{i-1}$	30	−n2, n2	−4930
F5: Bent Cigar	$x_1^2+{10}^6{\sum }_{i=2}^n{x}_i^2$	30	−100, 100	0
F6: High Conditioned Elliptic	${\sum }_{i=1}^n{\left({10}^6\right)}^{{\displaystyle \frac{i-1}{n-1}}}{x}_i^2$	30	−100, 100	0
F7: Zakharov	${\sum }_{i=1}^n{x}_i^2+{\left({\sum }_{i=1}^{n}0.5x_i\right)}^2+{\left({\sum }_{i=1}^{n}0.5x_i\right)}^4$	30	−100, 100	0

, are unimodal functions that are employed to evaluate the algorithm’s performance when there is only one global minimum. F₈–F₁₃, listed in

Table 2. Expression of F₈–F₁₃ Benchmark Function.

Function	Function Formula	Dim	Range	Fbest
F8: Generalized Rastrigin	${\sum }_{i=1}^n\left[x_i^2-10cos\left(2\pi x_i\right)+10\right]$	30	−5.12, 5.12	0
F9: Ackley	$-20exp\left(-0.2\sqrt{{\displaystyle \frac{1}{n}}}{\sum }_{i=1}^n{x}_i^2\right)-exp\left[{\displaystyle \frac{1}{n}}{\sum }_{i=1}^n\mathit{cos}\left(2\pi x_i\right)\right]+20+e$	30	−32, 32	0
F10: Generalized Griewank	${\displaystyle \frac{1}{4000}}{\sum }_{i=1}^n{x}_i^2+{\prod }_{i=1}^n\mathit{cos}\left({\displaystyle \frac{x_i}{\sqrt{i}}}\right)+1$	30	−600, 600	0
F11: Schaffer	$g\left(x_1,x_2\right)+g\left(x_2,x_3\right)+\cdots +g\left(x_{n-1},x_n\right)+g\left(x_n,x_1\right)$ $g\left(x,y\right)=0.5+{\displaystyle \frac{\left({sin}^2\left(\sqrt{x^2+y^2}\right)-0.5\right)}{{\left(1+0.001\left(x^2+y^2\right)\right)}^2}}$	30	−100, 100	0
F12: Modified Schwefel	$418.9829\times \mathrm{n}-{\sum }_{i=1}^{n}g\left(z_i\right)$ $g\left(z_i\right)=\left\{\begin{array}{ll}{z}_{i}sin\left({\left|z_i\right|}^{1/2}\right)& if \left|z_i\right|\le 500\\ \left(500-y_i^1\right)sin\left(\sqrt{\left|500-y_i^1\right|}\right)-{\displaystyle \frac{{\left(z_i-500\right)}^2}{\mathrm{10,000}n}}& if z_i>500\\ \left(y_i^2-500\right)sin\left(\sqrt{\left|y_i^2-500\right|}\right)-{\displaystyle \frac{{\left(z_i+500\right)}^2}{\mathrm{10,000}n}}& if z_i<-500\end{array}\right.$ $z_i=x_i+4.209687462275036E+02$ $y_i^1=mod\left(z_i,500\right) y_i^2=mod\left(\left|z_i\right|,500\right)$	30	−100, 100	0
F13: Weierstrass	${\sum }_{i=1}^n\left({\sum }_{k=0}^{20}\left[{0.5}^{k}cos\left(2·3^k\pi \left(x_i+0.5\right)\right)\right]\right)-n{\sum }_{k=0}^{20}\left[{0.5}^{k}cos\left(3^k\pi \right)\right]$	30	−100, 100	0

, are multimodal functions that are employed to evaluate the algorithm’s performance in searching for a global solution in the case of numerous local minimums. F₁₄–F₂₀, listed in

Table 3. Expression of F₁₄–F₂₀ Benchmark Function.

Function	Function Formula	Dim	Range	Fbest
F14: Bukin	$100\sqrt{\left|x_2-0.01x_1^2\right|}+0.01\left|x_1+10\right|$	2	−15, 3	0
F15: Shekel’s Foxholes	${\left({\displaystyle \frac{1}{500}}+{\sum }_{j=1}^{25}{\displaystyle \frac{1}{j+{\sum }_{i=1}^2{\left(x_i-a_{ij}\right)}^6}}\right)}^{-1}$	2	−65.53, 65.53	1
F16: Six-Hump Camel-Back	$4x_1^2-2.1x_1^4+{\displaystyle \frac{1}{3}}{x}_1^6+x_1{x}_2-4x_2^2+4x_2^4$	2	−5, 5	−1.031
F17: Branin	${\left(x_2-{\displaystyle \frac{5.1}{4{\pi }^2}}{x}_1^2+{\displaystyle \frac{5}{\pi }}{x}_1-6\right)}^2+10\left(1-{\displaystyle \frac{1}{8\pi }}\right)cos{x}_1+10$	2	−5, 15	0.398
F18: Levy	${sin}^2\left(3\pi x_1\right)+{\left(x_1-1\right)}^2\left[1+{sin}^2\left(3\pi x_2\right)\right]+{\left(x_2-1\right)}^2\left[1+{sin}^2\left(2\pi x_2\right)\right]$	2	−10, 10	0
F19: Hartman’s Family	$-{\sum }_{i=1}^4{c}_{i}exp\left[-{\sum }_{j=1}^3{a}_{ij}{\left(x_j-p_{ij}\right)}^2\right]$	3	1, 3	−3.86
F20: Kowalik	$-{\sum }_{i=1}^{11}{\left[a_i-{\displaystyle \frac{x_1\left(b_i^2+b_i{x}_2\right)}{b_i^2+b_i{x}_3+x_4}}\right]}^2$	4	−5, 5	3 × 10−4

, are fixed-dimension multimodal functions that are employed to evaluate the convergence of the algorithm under low-dimensional problems.

In all of the experiments, the proposed HRSO will be compared with RSO, PSO [39], FA [40], DE [41], BOA [42], WOA [43], GWO [44] and COA [45]. For all of the algorithms employed in this research, the population size is set to 30, and the maximum iteration numbers is set to 500. Each algorithm is independently tested 20 times on the benchmark functions listed in Table 1, Table 2 and Table 3. The results of the test experiments are depicted in

Table 4. Experimental Results for Benchmark Function.

Function	Index	HRSO	RSO	PSO	FA	DE	BOA	WOA	GWO	COA
F1	Best	3.63 × 10−192	1.23 × 10−204	2.55	1.02 × 10−7	1.19 × 10−2	6.97 × 10−6	3.50 × 10−97	3.06 × 10−32	9.84 × 10−19
	Mean	4.75 × 10−171	2.03 × 10−159	5.43	1.47 × 10−7	2.38 × 10−2	7.74 × 10−6	1.20 × 10−81	5.09 × 10−31	1.46 × 102
	Std	0.00	1.61 × 10−158	1.88	2.09 × 10−8	9.73 × 10−3	4.75 × 10−7	5.37 × 10−81	7.53 × 10−31	3.32 × 102
F2	Best	1.42 × 10−7	9.49 × 10−7	3.00 × 101	3.00 × 101	3.00 × 101	1.38 × 101	1.20 × 10−4	3.00 × 101	1.20 × 102
	Mean	4.09 × 10−6	3.52 × 10−4	3.20 × 101	3.00 × 101	3.00 × 101	1.52 × 102	1.84 × 10−2	3.16 × 101	1.53 × 102
	Std	7.08 × 10−6	8.16 × 10−4	2.07	3.73 × 10−11	1.19 × 10−5	9.66	1.77 × 10−2	3.00	2.10 × 101
F3	Best	5.75 × 10−262	3.87 × 10−206	1.90 × 10−11	3.16 × 10−16	3.17 × 10−23	1.10 × 10−6	3.09 × 10−156	4.72 × 10−118	4.73 × 10−136
	Mean	9.58 × 10−243	6.20 × 10−153	5.67 × 10−10	2.31 × 10−15	2.39 × 10−22	2.34 × 10−6	7.19 × 10−120	9.58 × 10−106	2.36 × 10−127
	Std	0.00	2.77 × 10−152	1.03 × 10−9	1.68 × 10−15	2.07 × 10−22	6.88 × 10−7	3.21 × 10−119	3.64 × 10−105	1.06 × 10−126
F4	Best	−4.82 × 103	−1.21 × 103	1.95 × 102	−4.44 × 103	8.91 × 104	1.93 × 101	−1.45 × 103	−2.61 × 102	3.00 × 101
	Mean	−4.21 × 103	−9.20 × 102	4.19 × 103	−2.54 × 103	1.68 × 105	3.19 × 101	−1.07 × 103	−1.41 × 102	1.76 × 105
	Std	1.74 × 102	1.23 × 102	3.57 × 103	1.15 × 103	4.03 × 104	5.85	4.61 × 102	7.54 × 101	5.03 × 105
F5	Best	5.61 × 10−197	5.61 × 10−187	1.19 × 107	1.30	6.33 × 104	1.47 × 1011	3.83 × 10−90	1.19 × 10−25	3.94 × 10−7
	Mean	9.91 × 10−162	5.02 × 10−161	4.58 × 107	1.49	1.44 × 105	6.02 × 1011	2.54 × 10−75	2.49 × 10−24	1.55 × 101
	Std	4.36 × 10−161	2.22 × 10−160	2.49 × 107	1.98 × 10−1	6.41 × 104	1.27 × 1011	1.13 × 10−74	3.71 × 10−24	6.07 × 101
F6	Best	1.18 × 10−190	1.28 × 10−194	2.80 × 105	3.83 × 10−2	9.18 × 101	6.12 × 104	2.87 × 10−90	6.50 × 10−29	1.25 × 10−3
	Mean	1.05 × 10−167	1.30 × 10−154	1.89 × 106	5.68 × 10−2	1.60 × 102	2.05 × 1010	1.36 × 10−80	6.19 × 10−27	5.50 × 102
	Std	0.00	5.64 × 10−154	1.38 × 10−2	1.38 × 10−2	5.18 × 101	1.03 × 1010	4.94 × 10−80	1.40 × 10−26	1.82 × 103
F7	Best	3.29 × 10−128	1.13 × 10−180	4.97 × 102	1.06 × 10−2	5.83 × 104	1.43 × 101	3.65 × 103	7.87 × 10−4	2.08 × 10−20
	Mean	2.79 × 10−47	1.87 × 106	1.89 × 103	5.67 × 101	7.58 × 104	1.35 × 107	8.67 × 104	8.47 × 102	9.33 × 103
	Std	1.25 × 10−46	7.67 × 106	1.38 × 103	8.90 × 101	8.24 × 103	4.71 × 107	2.51 × 104	1.35 × 103	3.03 × 104
F8	Best	0.00	0.00	2.19 × 101	3.68 × 101	5.17 × 101	7.40 × 10−6	0.00	0.00	0.00
	Mean	0.00	0.00	3.82 × 101	9.52 × 101	6.24 × 101	7.91 × 10−6	0.00	0.00	0.00
	Std	0.00	0.00	9.92	3.12 × 101	5.19	3.75 × 10−7	0.00	0.00	0.00
F9	Best	4.44 × 10−16	4.44 × 10−16	2.30	7.36 × 10−5	3.52 × 10−2	6.61 × 10−5	4.44 × 10−16	1.11 × 10−14	4.44 × 10−16
	Mean	4.44 × 10−16	4.44 × 10−16	4.41	8.82 × 10−5	5.42 × 10−2	7.07 × 10−5	2.40 × 10−15	1.70 × 10−14	4.44 × 10−16
	Std	0.00	0.00	1.04	8.05 × 10−6	1.55 × 10−2	2.73 × 10−6	2.15 × 10−15	3.51 × 10−15	0.00
F10	Best	0.00	0.00	9.37 × 10−1	1.89 × 10−7	4.32 × 10−2	8.02 × 10−6	0.00	0.00	0.00
	Mean	0.00	0.00	1.03	1.36 × 10−3	9.75 × 10−2	8.70 × 10−6	2.06 × 10−2	8.24 × 10−4	9.41 × 101
	Std	0.00	0.00	3.52 × 10−2	3.34 × 10−3	3.38 × 10−2	4.16 × 10−7	9.22 × 10−2	2.54 × 10−3	9.59 × 101
F11	Best	0.00	0.00	7.59	6.12	6.24	8.89 × 10−6	0.00	2.09 × 10−2	0.00
	Mean	0.00	0.00	9.36	8.87	7.70	9.76 × 10−6	0.00	4.73 × 10−1	0.00
	Std	0.00	0.00	1.09	1.57	5.96 × 10−1	5.77 × 10−7	0.00	4.59 × 10−1	0.00
F12	Best	3.82 × 10−4	3.82 × 10−4	2.14 × 10−1	3.82 × 10−4	2.08 × 10−3	3.82 × 10−4	3.82 × 10−4	3.82 × 10−4	3.82 × 10−4
	Mean	3.82 × 10−4	3.82 × 10−4	6.80 × 10−1	3.82 × 10−4	3.08 × 10−3	3.82 × 10−4	3.82 × 10−4	3.82 × 10−4	7.13 × 10−4
	Std	0.00	0.00	3.08 × 10−1	2.94 × 10−9	7.64 × 10−4	1.75 × 10−8	4.07 × 10−13	0.00	1.41 × 10−3
F13	Best	7.11 × 10−15	3.77 × 10−13	2.81 × 101	2.74 × 10−1	9.13 × 10−15	2.28 × 10−4	1.42 × 10−14	2.52	4.97 × 10−14
	Mean	7.11 × 10−15	3.77 × 10−13	3.47 × 101	3.19 × 10−1	9.24 × 10−15	3.12 × 10−4	9.24 × 10−14	7.30	7.53 × 10−14
	Std	0.00	0.00	3.56	2.28 × 10−2	9.25 × 10−15	4.13 × 10−5	9.25 × 10−14	3.28	1.84 × 10−14
F14	Best	1.01 × 10−3	2.35 × 10−1	5.00 × 10−2	8.27 × 10−3	3.63 × 10−2	5.02 × 10−1	5.52 × 10−3	6.93 × 10−2	1.24 × 10−1
	Mean	2.44 × 10−2	8.81 × 10−1	1.15	2.50 × 10−2	1.72 × 10−1	1.44	2.69 × 10−2	1.83 × 10−1	6.08
	Std	1.30 × 10−2	4.34 × 10−1	2.79	1.65 × 10−2	1.05 × 10−1	7.19 × 10−1	1.56 × 10−2	6.05 × 10−2	9.48
F15	Best	9.98 × 10−1	2.33	9.98 × 10−1	9.98 × 10−1	9.98 × 10−1	9.98 × 10−1	9.98 × 10−1	1.13	1.03
	Mean	9.98 × 10−1	1.22 × 101	4.05	5.11	9.98 × 10−1	3.49	1.32 × 101	5.99	2.00 × 101
	Std	0.00	2.31	2.99	4.24	0.00	1.91	1.45 × 101	3.72	4.63 × 101
F16	Best	−1.03	−1.03	−1.03	−1.03	−1.03	−1.03	−1.03	−1.03	−1.03
	Mean	−1.03	−1.00	−1.03	−1.03	−1.03	−8.33 × 10−1	−5.86 × 10−1	−1.03	−6.87 × 10−1
	Std	1.25 × 10−16	8.00 × 10−3	2.04 × 10−16	9.72 × 10−15	2.22 × 10−16	2.88 × 10−1	4.42 × 10−1	5.22 × 10−8	3.54 × 10−1
F17	Best	3.98 × 10−1	3.98 × 10−1	3.98 × 10−1	3.98 × 10−1	3.98 × 10−1	3.99 × 10−1	3.98 × 10−1	3.98 × 10−1	4.00 × 10−1
	Mean	3.98 × 10−1	4.00 × 10−1	5.89 × 10−1	3.98 × 10−1	3.98 × 10−1	4.45 × 10−1	7.12 × 10−1	3.98 × 10−1	8.11 × 10−1
	Std	0.00	2.08 × 10−3	2.27 × 10−1	1.01 × 10−14	0.00	8.66 × 10−2	4.77 × 10−1	6.33 × 10−7	3.85 × 10−1
F18	Best	1.35 × 10−31	8.12 × 10−8	1.55 × 10−21	1.84 × 10−15	1.35 × 10−31	2.61 × 10−4	2.29 × 10−17	3.79 × 10−8	4.46 × 10−4
	Mean	1.35 × 10−31	1.56 × 10−4	2.02 × 10−15	7.51 × 10−14	1.35 × 10−31	2.68 × 10−2	7.39 × 10−1	7.19 × 10−7	1.80
	Std	0.00	3.13 × 10−4	7.13 × 10−15	6.47 × 10−14	3.52 × 10−47	4.92 × 10−2	1.19	6.85 × 10−7	1.89
F19	Best	−3.86	−3.86	−3.86	−3.86	−3.86	−3.84	−3.86	−3.86	−3.80
	Mean	−3.86	−3.74	−3.74	−3.86	−3.86	−3.69	−3.59	−3.86	−3.58
	Std	1.79 × 10−15	8.40 × 10−2	9.10 × 10−2	7.75 × 10−15	2.28 × 10−15	1.42 × 10−1	3.50 × 10−1	2.68 × 10−3	3.04 × 10−1
F20	Best	3.07 × 10−4	3.09 × 10−4	3.07 × 10−4	3.07 × 10−4	4.84 × 10−4	3.28 × 10−4	2.25 × 10−3	3.44 × 10−4	1.40 × 10−3
	Mean	3.07 × 10−4	4.58 × 10−4	6.17 × 10−4	3.07 × 10−4	8.05 × 10−4	1.98 × 10−3	2.18 × 10−2	3.06 × 10−3	1.75 × 10−2
	Std	2.28 × 10−14	2.97 × 10−4	5.41 × 10−4	4.20 × 10−14	1.28 × 10−4	3.04 × 10−3	2.40 × 10−2	6.16 × 10−3	1.31 × 10−2

. Among them, the Best, Mean and Std represent the optimal value, arithmetic mean and sample standard deviation, respectively, of results from 20 independent runs of the algorithm. These metrics reflect the algorithm’s theoretical maximum performance, overall average performance and the degree of discretization in outputs.

Experimental results from Table 4 reveal that HRSO exhibits the absolute best performance for F2, F3, F5, and F8–F20. F1 and F4 are both bowl-shaped unimodal functions. For F1, the best result for HRSO is marginally inferior to that for RSO, but it demonstrates superior mean and standard scores. This likely stems from its exceptional performance regarding simple unimodal functions while it is susceptible to local optima. Regarding the more complex F4, as predicted by the F1 results, HRSO outperforms RSO and other algorithms in both best and mean metrics. Although HRSO’s standard deviation on F4 is slightly worse than that of RSO, the difference is marginal. F6 and F7 are smooth and plate-shaped unimodal functions. For these functions, although RSO achieves marginally superior best metric, HRSO attains optimal mean and standard deviation scores across all algorithms, further validating the aforementioned conjecture.

To validate and illustrate the performance of HRSO more intuitively, Figure 3 showcases the convergence curves, Figure 4 presents the boxplots, while

Table 5. Experimental Results for Parameter Sensitivity Analysis.

Function	Index	E [−1, −1]	E [−2, −2]	E [−3, −3]
F2	Best	2.67 × 10−7	2.39 × 10−5	2.84 × 10−5
	Mean	2.07 × 10−7	4.11 × 10−6	7.75 × 10−6
	Std	2.68 × 10−7	3.48 × 10−5	3.87 × 10−5
F13	Best	7.11 × 10−15	2.82 × 10−13	1.34 × 10−13
	Mean	7.11 × 10−15	7.11 × 10−15	0.00
	Std	7.11 × 10−15	7.11 × 10−15	0.00
F14	Best	1.53 × 10−2	4.83 × 10−2	1.56 × 10−2
	Mean	3.02 × 10−3	2.28 × 10−2	1.56 × 10−2
	Std	5.99 × 10−3	2.55 × 10−2	1.36 × 10−2

presents the results of the parameter sensitivity analysis. According to Figure 3 and Figure 4, HRSO exhibits superior performance compared to the other algorithms in both convergence rate and stability, indicating that HRSO is highly exploitable and robust. To further verify the stability of HRSO, Table 5 presents an evaluation of the nonlinear adaptive parameter E, which governs the balance between exploration and exploitation during the search. Using benchmark functions from Table 1, Table 2 and Table 3 and fixing a random number generator seed, experimental results demonstrate that reducing E biases exploitation search and accelerates local convergence, while increasing E shifts toward exploration search and expands global search scope. Notably, the volatility of all of the metrics remained below 2 × 10⁻³, with no statistically significant differences. This further confirms that HRSO exhibits high robustness against variations in the adjustment parameter of E, and even when E is adjusted within a reasonable range, the algorithm maintains stable performance.

4.2. Classification Benchmarks Dataset Test

The classification performance of HRSO-ENNC is analyzed in this part. Additionally, comparative results with RSO-ENNC, PSO-ENNC, FA-ENNC, DE-ENNC, BOA-ENNC, WOA-ENNC, GWO-ENNC and COA-ENNC are provided. The performance is evaluated by seven classic benchmarks for data classification prediction problems.

Table 6. Classification Prediction Benchmarks Dataset.

Number	Dataset	Samples	Feature	Classes	Distribution
1	Iris	150	4	3	50, 50, 50
2	Wine	178	13	3	59, 71, 48
3	Balance-scale	625	4	3	49, 288, 288
4	Seeds	210	7	3	70, 70, 70
5	WBC	683	9	2	444, 239
6	Jain	373	2	2	276, 97
7	Cancer	683	9	2	444, 239

provides the dataset name, number of samples, features, classes and distribution of sample quantities across different classes for the seven data classification prediction problems.

In all of the experiments, a stratified seven-fold cross-validation method is utilized to assess the classifier’s performance metrics more accurately. This means that one-seventh of the overall dataset is randomly considered as the test set, while the rest is used for training. Unlike standard cross-validation, the stratified method randomly divides each class into seven equal-sized sets, so that each fold is a better representation of the overall dataset. The classifier is run seven times based on this method, with a different set as the test set each time. The experimental indicators include the values of the maximum, mean and standard deviation for the prediction accuracy on both training and test datasets.

Table 7. Classification Accuracy for Training Dataset.

Dataset	Values	HRSO-ENNC	RSO-ENNC	PSO-ENNC	FA-ENNC	DE-ENNC	BOA-ENNC	WOA-ENNC	GWO-ENNC	COA-ENNC
Iris	Max	100.00%	89.84%	96.90%	95.31%	96.12%	85.94%	97.67%	98.45%	95.35%
	Mean	98.33%	82.00%	88.79%	87.23%	92.78%	80.45%	90.55%	96.44%	80.67%
	Std	0.0167	0.0543	0.1020	0.0460	0.0222	0.1010	0.0573	0.0198	0.1180
Wine	Max	99.34%	79.61%	93.42%	91.45%	84.87%	90.07%	87.50%	97.67%	89.54%
	Mean	96.73%	71.01%	81.17%	76.04%	83.34%	84.66%	82.31%	94.60%	80.72%
	Std	0.0226	0.0796	0.0708	0.0717	0.0149	0.0474	0.0634	0.0229	0.0480
Balance	Max	94.03%	69.40%	88.97%	71.96%	83.40%	80.97%	88.62%	92.35%	88.06%
scale	Mean	90.53%	58.61%	79.07%	66.59%	80.37%	74.88%	84.59%	89.73%	79.39%
	Std	0.0118	0.0612	0.0512	0.0409	0.0233	0.0326	0.0421	0.0150	0.0569
Seeds	Max	97.22%	88.89%	87.22%	87.22%	90.56%	86.11%	93.33%	96.67%	93.33%
	Mean	95.40%	79.60%	92.78%	77.78%	88.25%	75.63%	89.29%	94.98%	89.05%
	Std	0.0167	0.0846	0.0854	0.0513	0.0141	0.0768	0.0304	0.0110	0.0371
WBC	Max	97.78%	97.09%	97.61%	96.08%	97.61%	97.44%	97.26%	97.78%	96.42%
	Mean	97.34%	95.73%	93.09%	93.90%	96.22%	95.83%	96.00%	97.04%	94.56%
	Std	0.0035	0.0176	0.0354	0.0148	0.0065	0.0125	0.0104	0.0036	0.0205
Jain	Max	99.69%	94.67%	96.55%	94.69%	95.92%	95.94%	96.87%	96.55%	95.94%
	Mean	97.50%	92.58%	94.82%	93.79%	95.35%	94.01%	95.71%	95.63%	92.81%
	Std	0.0152	0.0285	0.0101	0.0157	0.0045	0.0363	0.0150	0.0117	0.0204
Cancer	Max	98.63%	95.56%	97.27%	96.24%	96.92%	97.10%	96.92%	97.63%	96.75%
	Mean	97.80%	93.51%	95.10%	94.34%	96.17%	95.78%	95.71%	97.19%	95.36%
	Std	0.0068	0.0178	0.0177	0.0111	0.0036	0.0164	0.0191	0.0035	0.0167

and

Table 8. Classification Accuracy for Testing Dataset.

Dataset	Values	HRSO-ENNC	RSO-ENNC	PSO-ENNC	FA-ENNC	DE-ENNC	BOA-ENNC	WOA-ENNC	GWO-ENNC	COA-ENNC
Iris	Max	100.00%	90.48%	95.24%	100.00%	100.00%	95.24%	100.00%	100.00%	90.48%
	Mean	93.35%	79.99%	80.77%	86.73%	90.69%	74.61%	88.59%	92.22%	76.56%
	Std	0.0553	0.0785	0.0969	0.0798	0.0735	0.1200	0.1180	0.0593	0.1010
Wine	Max	96.15%	73.08%	92.00%	96.15%	87.50%	96.15%	92.00%	95.58%	84.62%
	Mean	93.21%	64.49%	78.69%	70.69%	80.41%	80.76%	71.88%	90.81%	75.16%
	Std	0.0168	0.0884	0.0793	0.0131	0.0487	0.1080	0.0287	0.0361	0.0852
Balance	Max	91.01%	71.91%	88.89%	75.56%	82.22%	77.53%	86.52%	89.43%	85.39%
scale	Mean	88.00%	58.09%	79.02%	66.07%	77.75%	70.56%	82.41%	87.75%	79.51%
	Std	0.0126	0.0764	0.0585	0.0591	0.0402	0.0485	0.0348	0.0261	0.0535
Seeds	Max	100.00%	90.00%	90.00%	90.00%	93.33%	86.67%	96.67%	100.00%	96.67%
	Mean	92.38%	77.62%	82.86%	75.24%	86.19%	75.71%	88.57%	91.82%	86.67%
	Std	0.0495	0.0728	0.0744	0.0710	0.0653	0.0713	0.0539	0.0610	0.0903
WBC	Max	98.98%	96.94%	98.98%	93.88%	98.98%	95.92%	98.98%	98.98%	98.98%
	Mean	95.75%	93.41%	94.44%	92.82%	94.72%	93.85%	95.02%	95.47%	93.41%
	Std	0.0309	0.0327	0.0382	0.0207	0.0355	0.0133	0.0246	0.0176	0.0350
Jain	Max	100.00%	98.11%	98.11%	98.15%	96.30%	98.11%	96.30%	100.00%	100.00%
	Mean	97.31%	92.26%	92.22%	93.01%	93.58%	93.58%	94.63%	95.49%	92.23%
	Std	0.0173	0.0385	0.0356	0.0315	0.0238	0.0334	0.0173	0.0331	0.0383
Cancer	Max	97.96%	94.90%	96.94%	97.96%	95.92%	97.96%	97.96%	97.96%	97.96%
	Mean	96.48%	92.97%	93.85%	94.13%	95.15%	95.76%	94.29%	96.02%	94.28%
	Std	0.0133	0.0140	0.0197	0.0275	0.0088	0.0241	0.0387	0.0142	0.0341

present the experimental results of HRSO-ENNC and other algorithm-ENNC for the data classification prediction problem on the training and test dataset, respectively.

Table 7 illustrates that, for the Iris, Balancescale and WBC datasets, the HRSO-ENNC achieves better maximum, mean and standard deviation of the prediction accuracy compared to other algorithm-ENNC on the training dataset. For the remaining datasets, the HRSO-ENNC exhibits better maximum and mean accuracy, with only slightly worse standard deviation compared to DE-ENNC and GWO-ENNC. All observed values are less than 1.07 × 10⁻², but this is not statistically significant and does not indicate that the HRSO-ENNC is unstable.

Similarly to the experiment results on the training dataset, the best testing results are the in Table 8, except for the WBC and Cancer datasets. For these two datasets, the standard deviation score of the HRSO-ENNC is about 1.76 × 10⁻² and 4.50 × 10⁻³ worse than those of the BOA-ENNC and DE-ENNC, respectively. In conclusion, the experimental outcomes reflect that the HRSO overcomes the dependence of the Elman neural network on weights and thresholds, demonstrating the accuracy of its classification performance.

4.3. AlSi10Mg Process Classification Problem

In selective laser melting (SLM), single-track formation critically determines the dimensional accuracy and surface quality of components. Distinct morphological variations may induce defects including internal porosity and poor surface roughness, which can degrade performance. Consequently, effective classification of these morphological features is crucial for ensuring process stability and product quality. An application of process classification is introduced for single-track AlSi10Mg on selective laser melting (SLM) in this section.

The dataset was acquired through orthogonal simulation experiments in which the laser power and scanning speed are equidistant and sampled in the range of 150–250 W and 0.6–1.6 m/s, with multiple repeated trials conducted. Following image sampling, anomalous data are eliminated, resulting in a final dataset of 441 samples. Based on production experience, samples are classified into three distinct morphological categories. In total, 243 normal class samples are continuous and uniform, 145 over-heat class samples are widened and irregular, and 53 no-continuity class samples display a fractured and discontinuous appearance. Seven critical features are extracted via image measurements, including depth, cross-sectional area and effective width, describing melt pool geometry; linear energy density and laser action depth ratio, reflecting energy transfer efficiency; and standard deviation and coefficient of variation, quantifying process fluctuation. These features collectively characterize geometric attributes, energy distribution and process stability to enable precise classification.

Table 9. Single-track AlSi10Mg classification problem.

Dataset	Samples	Feature	Classes	Distribution
AlSi10Mg	441	7	3	145, 243, 53

and

Table 10. Detailed description of dataset features.

Feature	Physical Meaning	Range	Unit
depth	represents the measured depth of the melt pool	0.0529, 0.0128	mm
cross-sectional area	represents the measured area of the melt pool	0.0047, 0.0004	mm2
effective width	represents effective melt pool transverse width	0.0793, 0.0223	mm
linear energy density	represents the energy delivered by laser per unit length	0.4167,0.0938	J/mm
laser action depth ratio	represents laser powder melting efficiency	0.9813, 0.5065	unitless
standard deviation	represents the dispersion of melt pool width	0.1839, 0.0218	unitless
coefficient of variation	represents the stability of melt pool processing	0.7653, 0.0159	unitless

provide specific details of the dataset and feature. Appendix A provides dataset examples across different classes.

To provide a more objective evaluation of the model’s performance, weighted Precision, weighted Recall and weighted F1-score are included in

Table 11. AlSi10Mg Process Classification Accuracy for Training Dataset.

Dataset	Values	HRSO-ENNC	RSO-ENNC	PSO-ENNC	FA-ENNC	DE-ENNC	BOA-ENNC	WOA-ENNC	GWO-ENNC	COA-ENNC
AlSi10Mg	Max	100%	87.37%	94.96%	96.02%	94.69%	95.23%	97.88%	97.35%	96.30%
	Mean	99.24%	76.71%	89.72%	88.56%	92.67%	91.66%	93.63%	95.77%	93.47%
	Std	0.0043	0.0964	0.0315	0.0417	0.0120	0.0293	0.0473	0.0168	0.0323
	Weighted P (Mean)	98.93%	77.26%	82.94%	86.25%	93.79%	89.71%	92.98%	96.68%	91.69%
	Weighted R (Mean)	98.90%	80.11%	89.83%	89.42%	93.25%	89.84%	94.18%	96.45%	92.71%
	Weighted F1 (Mean)	0.9889	0.7705	0.8603	0.8720	0.9326	0.8870	0.9310	0.9643	0.9124

and

Table 12. AlSi10Mg Process Classification Accuracy for Testing Dataset.

Dataset	Values	HRSO-ENNC	RSO-ENNC	PSO-ENNC	FA-ENNC	DE-ENNC	BOA-ENNC	WOA-ENNC	GWO-ENNC	COA-ENNC
AlSi10Mg	Max	100%	86.89%	92.19%	92.06%	98.44%	96.88%	98.44%	100%	98.41%
	Mean	98.40%	75.81%	87.97%	87.49%	92.07%	90.87%	92.42%	94.34%	93.62%
	Std	0.0133	0.1110	0.0324	0.0376	0.0326	0.0449	0.0581	0.0354	0.0367
	Weighted P (Mean)	97.42%	74.94%	81.43%	83.06%	92.96%	84.84%	87.28%	95.93%	93.80%
	Weighted R (Mean)	97.29%	75.66%	87.99%	87.33%	91.85%	88.64%	91.17%	95.52%	92.96%
	Weighted F1 (Mean)	0.9726	0.7151	0.8425	0.8457	0.9176	0.8606	0.8885	0.9550	0.9296

. These metrics are calculated as a weighted average using class sample size proportions, effectively mitigating the dominance results of the majority class. Notably, the newly added metrics are the arithmetic means based on the results of the stratified seven-fold cross-validation method. Experimental results presented in Figure 5 confirm that the proposed HRSO-ENNC exhibits superior convergence rate and stability compared to the other classifiers. HRSO-ENNC achieves a maximum identification accuracy of 100%, and on other metrics outperforms all comparison models, as shown in Table 11 and Table 12. This demonstrates the effectiveness and robustness of the HRSO-ENNC in the AlSi10Mg process classification problem.

5. Conclusions

In the current work, we address shortcomings of the Elman neural network (ENN), which easily obtains local optimums and a slow convergence rate. To address the data classification prediction problem, an ENN classifier based on the Hyperactive Rat Swarm Optimizer (HRSO) is proposed. The proposed algorithm is designed as a two-phase calculation process and consists of five search actions. The center point and cosine search significantly enhance the exploration phase of the RSO, while rush, contrast and random search enhance the exploitation phase. Finally, a stochastic wandering strategy is used to jump out of local optimal positions. Experimental results based on benchmark functions confirm that HRSO outperforms other algorithms in both convergence rate and stability. Additionally, the proposed HRSO optimizes the weights and thresholds of ENN to overcome its shortcomings by replacing the traditional training methods. The classification performance of HRSO-ENNC is rigorously evaluated through seven benchmark data classification prediction problems, demonstrating the accuracy and generalizability of the model. Furthermore, HRSO-ENNC achieves a maximum accuracy of 100% in the AlSi10Mg process classification problem, with all other metrics significantly outperforming those of other algorithmic classifiers. The results demonstrate that this classifier is an excellent tool for data classification prediction. Further research has shown that the neural network accumulates more weights and thresholds with an augmented number of inputs and outputs, which makes it difficult for the algorithms to converge. Therefore, subsequent research efforts will prioritize algorithmic enhancements for high-dimensional optimization challenges, thereby improving algorithmic scalability.