<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Mar. Sci.</journal-id>
<journal-title>Frontiers in Marine Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Mar. Sci.</abbrev-journal-title>
<issn pub-type="epub">2296-7745</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fmars.2023.1126556</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Marine Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A hybrid intelligence model for predicting dissolved oxygen in aquaculture water</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Yang</surname>
<given-names>Huanhai</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2141770"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Sun</surname>
<given-names>Mingyu</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Liu</surname>
<given-names>Shue</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Computer Science and Technology, Shandong Technology and Business University</institution>, <addr-line>Yantai, Shandong</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>College of Foreign Studies, Shandong Technology and Business University</institution>, <addr-line>Yantai, Shandong</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>The Second Medical College, Binzhou Medical University</institution>, <addr-line>Yantai, Shandong</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: Shengyan Pu, Chengdu University of Technology, China</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Saad Shauket Sammen, University of Diyala, Iraq; Jinran Wu, Australian Catholic University, Australia; Salim Heddam, University of Skikda, Algeria; Huiling Chen, Wenzhou University, China; Yonggang Li, Central South University, China</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Shue Liu, <email xlink:href="mailto:lse32@bzmc.edu.cn">lse32@bzmc.edu.cn</email>;  Huanhai Yang, <email xlink:href="mailto:201511809@sdtbu.edu.cn">201511809@sdtbu.edu.cn</email>
</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>06</day>
<month>06</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>10</volume>
<elocation-id>1126556</elocation-id>
<history>
<date date-type="received">
<day>18</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>05</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Yang, Sun and Liu</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Yang, Sun and Liu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Dissolved oxygen is an important water quality indicator that affects the health of aquatic products in aquaculture, and its monitoring and prediction are of great significance. To improve the prediction accuracy of dissolved oxygen water quality series, a hybrid prediction model based on variational mode decomposition (VMD) and a deep belief network (DBN) optimized by an improved slime mould algorithm (SMA) is proposed in this paper. First, VMD is used to decompose the nonlinear dissolved oxygen time series into several relatively stable intrinsic mode function (IMF) subsequences with different frequency scales. Then, the SMA is improved by applying elite opposition-based learning and nonlinear convergence factors to increase its population diversity and enhance its local search and global convergence capabilities. Finally, the improved SMA is used to optimize the hyperparameters of the DBN, and the aquaculture water quality prediction VMD-ISMA-DBN model is constructed. The model is used to predict each IMF subsequence, and the ISMA optimization algorithm is used to adaptively select the optimal hyperparameters of the DBN model, and the prediction results of each IMF are accumulated to obtain the final prediction result of the dissolved oxygen time series. The dissolved oxygen data of aquaculture water from 8 marine ranches in Shandong Province, China were used to verify the prediction performance of the model. Compared with the stand-alone DBN model, the prediction performance of the model has been significantly improved, MAE and MSE have been reduced by 43.28% and 40.43% respectively, and (<italic>R</italic>
<sup>2</sup>) has been increased by 8.37%. The results show that the model has higher prediction accuracy than other commonly used intelligent models (ARIMA, RF, TCN, ELM, GRU and LSTM); hence, it can provide a reference for the accurate prediction and intelligent regulation of aquaculture water quality.</p>
</abstract>
<kwd-group>
<kwd>dissolved oxygen</kwd>
<kwd>aquaculture</kwd>
<kwd>water quality prediction</kwd>
<kwd>variational mode decomposition</kwd>
<kwd>deep belief network</kwd>
<kwd>slime mould algorithm</kwd>
</kwd-group>
<contract-sponsor id="cn001">Yantai Science and Technology Bureau<named-content content-type="fundref-id">10.13039/501100011482</named-content>
</contract-sponsor>
<contract-sponsor id="cn002">Yantai Science and Technology Bureau<named-content content-type="fundref-id">10.13039/501100011482</named-content>
</contract-sponsor>
<counts>
<fig-count count="12"/>
<table-count count="5"/>
<equation-count count="21"/>
<ref-count count="60"/>
<page-count count="16"/>
<word-count count="7284"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-in-acceptance</meta-name>
<meta-value>Marine Fisheries, Aquaculture and Living Resources</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>In the field of aquaculture, the quality of water is an important factor affecting the growth, development and reproduction of aquatic organisms. Water quality is unstable and constantly changing due to factors such as weather, breeding density, fish activity and fishermen intervention. In aquaculture, it is necessary to ensure that the dissolved oxygen content, pH value, water temperature, salinity and other water quality indicators are within the normal ranges. Taking the dissolved oxygen content as an example, the suitable dissolved oxygen content for fish is above 3 mg/L. When the dissolved oxygen content is less than 3 mg/L, the fish will stop eating, and if the dissolved oxygen content is too high, the fish may suffer from bubble disease. Therefore, accurate prediction and timely intervention of water quality indicators to control the aquaculture water environment within an appropriate range are of great significance to ensure the healthy growth of fish.</p>
<p>In recent years, many scholars have done a lot of research on water quality prediction, and applied various models to improve prediction accuracy. Existing water quality prediction models mainly include regression analysis based on mathematical statistics (<xref ref-type="bibr" rid="B7">Areerachakul et&#xa0;al. (2013)</xref>; <xref ref-type="bibr" rid="B10">Brooks et&#xa0;al. (2016)</xref>) and methods based on computational intelligence (<xref ref-type="bibr" rid="B40">Rajaee et&#xa0;al. (2020)</xref>). Traditional prediction methods based on regression analysis have high requirements on the distribution of data samples, and a large amount of data is required for training during modeling, which affects the efficiency and accuracy of prediction. Prediction methods based on computational intelligence (machine learning and deep learning) have the characteristics of autonomous learning, optimal calculation, and strong nonlinear fitting capabilities, and are more suitable for predictive modeling of nonlinear aquaculture water quality data. Many scholars have carried out much research on the application of intelligent algorithms to solve the problem of aquaculture water quality prediction and have built a variety of intelligent prediction models based on machine learning algorithms. Examples include genetic programming (<xref ref-type="bibr" rid="B23">Jafari et&#xa0;al. (2020)</xref>), general regression neural network (GRNN) (<xref ref-type="bibr" rid="B6">Antanasijevi&#x107; et&#xa0;al. (2014)</xref>), autoregressive integrated moving average model (ARIMA) (<xref ref-type="bibr" rid="B53">Xuan et&#xa0;al. (2021)</xref>), tree-based artificial intelligence models (<xref ref-type="bibr" rid="B47">Tiyasha et&#xa0;al. (2021)</xref>), radial basis function neural networks (<xref ref-type="bibr" rid="B44">Rozario and Devarajan (2021)</xref>), fuzzy neural network (<xref ref-type="bibr" rid="B43">Ren et&#xa0;al. (2018)</xref>) and Bayesian model averaging (<xref ref-type="bibr" rid="B26">Kisi et&#xa0;al. (2020)</xref>). Due to the excellent performance of the deep learning framework in time series forecasting, especially in long-term forecasting, most scholars have studied the application of deep learning methods in water quality forecasting. Examples include convolutional neural network (<xref ref-type="bibr" rid="B46">Ta and Wei (2018)</xref>), long short-term memory (<xref ref-type="bibr" rid="B8">Barzegar et&#xa0;al. (2020)</xref>), gated recurrent unit neural network (<xref ref-type="bibr" rid="B11">Cao et&#xa0;al. (2020)</xref>), bidirectional simple recurrent units (<xref ref-type="bibr" rid="B12">Chen et&#xa0;al. (2022)</xref>) and temporal convolutional network (<xref ref-type="bibr" rid="B31">Li et&#xa0;al. (2022b)</xref>).</p>
<p>The above intelligent prediction models, combined with the advantages of strong self-adaptation and the generalization ability of machine learning, have achieved good results in the prediction of nonlinear water quality data. Deep belief network (DBN) has the advantages of requiring less training time, effectively extracting data features, reducing the feature dimension and does not easily fall into local optima. DBN have been widely used in emotion recognition (<xref ref-type="bibr" rid="B16">Hassan et&#xa0;al., 2019</xref>), time series prediction (<xref ref-type="bibr" rid="B27">Kuremoto et&#xa0;al., 2014</xref>), text classification (<xref ref-type="bibr" rid="B24">Jiang et&#xa0;al., 2018</xref>) medical diagnosis (<xref ref-type="bibr" rid="B25">Khatami et&#xa0;al., 2017</xref>), etc. This paper studies the application of a DBN to accurately predict the development trend of aquaculture water quality.</p>
<p>Dissolved oxygen and other water quality data in aquaculture are affected by many factors, such as chemical reactions, biological activities, meteorological changes, and fishermen intervention, and have the characteristics of nonlinearity, easily changing, and noise. To improve the accuracy and stability of prediction results, most scholars use the method of data decomposition to process a water quality time series as the input sample of a prediction model. The time series decomposition algorithms include empirical mode decomposition (EMD), ensemble empirical mode decomposition (EEMD), complete EEMD with adaptive noise (CEEMDAN), variational mode decomposition (VMD) and others. (<xref ref-type="bibr" rid="B57">Zhang et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B58">Zhang et&#xa0;al., 2022</xref>) constructed decomposition-ensemble frameworks based on EMD to predict water quality (suspended sediment concentration, SSC) time series, and achieved high prediction accuracy. <xref ref-type="bibr" rid="B32">Liu et&#xa0;al. (2016)</xref> applied EMD and a back-propagation neural network (BPNN) to predict water temperature in aquaculture. <xref ref-type="bibr" rid="B21">Huan et&#xa0;al. (2018)</xref> and <xref ref-type="bibr" rid="B28">Li et&#xa0;al. (2018)</xref> applied EEMD to extract multiscale features from water quality data before making predictions. <xref ref-type="bibr" rid="B33">Lu and Ma (2020)</xref> proposed two hybrid short-term dissolved oxygen water quality prediction models, CEEMDAN-XGBoost and CEEMMDAN-RF. <xref ref-type="bibr" rid="B22">Huang et&#xa0;al. (2021)</xref> proposed an interval dissolved oxygen water quality prediction method based on VMD and a deep autoregressive recurrent neural network (DeepAR). <xref ref-type="bibr" rid="B42">Ren et&#xa0;al. (2020)</xref> applied VMD to decompose dissolved oxygen time series as input samples for the DBN prediction model. <xref ref-type="bibr" rid="B38">Pipelzadeh and Mastouri (2021)</xref> implemented a water quality prediction model based on VMD and model tree (MT) to predict total dissolved solids (TDS) and electrical conductivity (EC) water quality parameters. <xref ref-type="bibr" rid="B9">Bi et&#xa0;al. (2023)</xref> used VMD to process non-stationary water quality time series to improve prediction accuracy. VMD determines the frequency center and bandwidth of each component by iteratively searching for the optimal solution of the variational mode, prevents mode aliasing by controlling the bandwidth and has strong robustness to sampling and denoising. This paper studies the application of VMD to decompose aquaculture water quality signals to reduce the influence of nonlinear and nonstationary characteristics of the data on the performance of the prediction model and to improve the prediction accuracy.</p>
<p>Most of the intelligent models based on neural networks have shortcomings, such as difficulty in determining hidden neurons, overlearning or under learning, and easily falling into local optima. Moreover, the improper selection of hyperparameters of intelligent models also reduces the prediction accuracy of the model. Therefore, many scholars have studied and applied meta-heuristics algorithm to optimize the hyperparameters of neural network prediction models. Meta-heuristics algorithms mainly include evolutionary algorithms, swarm intelligence algorithms that simulate biological survival, and algorithms that simulate physical phenomena. Evolutionary algorithms draw on the evolutionary process of organisms in nature, including basic operations such as genetic encoding, population initialization and crossover mutation operator. Genetic algorithm (GA) and differential evolution algorithm (DE) are two commonly used evolutionary algorithms (<xref ref-type="bibr" rid="B20">Hu et&#xa0;al., 2022</xref>). The optimization algorithms inspired by physical phenomena and designed according to the laws of physics include gravitational search algorithm m (GSA) (<xref ref-type="bibr" rid="B41">Rashedi et&#xa0;al., 2009</xref>), gradient-based optimizer (GBO) (<xref ref-type="bibr" rid="B2">Ahmadianfar et&#xa0;al., 2020</xref>) and atom search optimization (ASO) (<xref ref-type="bibr" rid="B59">Zhao et&#xa0;al., 2019</xref>), etc (<xref ref-type="bibr" rid="B14">Emam et&#xa0;al., 2023</xref>). The swarm intelligence optimization algorithm is an intelligent algorithm that simulates the behavior of groups of fish, birds, wolves of bacteria in nature and uses information exchange and cooperation between groups to achieve optimization purposes (<xref ref-type="bibr" rid="B49">Wang et&#xa0;al., 2022</xref>). Swarm intelligence algorithms that have been widely used in recent years include monarch butterfly optimization (MBO)(<xref ref-type="bibr" rid="B50">Wang et&#xa0;al., 2019</xref>), hunger games search (HGS) (<xref ref-type="bibr" rid="B56">Yang et&#xa0;al., 2021</xref>), sparrow search algorithm (SSA) (<xref ref-type="bibr" rid="B54">Xue and Shen, 2020</xref>), dingoes hunting strategy (DHS) (<xref ref-type="bibr" rid="B37">Peraza-V&#xe1;zquez et&#xa0;al., 2021</xref>), bald eagle search (BES) (<xref ref-type="bibr" rid="B4">Alsattar et al., 2020</xref>), Wild horse optimizer (WHO) (<xref ref-type="bibr" rid="B35">Naruei and Keynia, 2021</xref>), whale optimization algorithm (WOA) (<xref ref-type="bibr" rid="B34">Mirjalili and Lewis, 2016</xref>), colony predation algorithm (CPA)(<xref ref-type="bibr" rid="B56">Yang et&#xa0;al., 2021</xref>), weighted mean of vectors (INFO) (<xref ref-type="bibr" rid="B3">Ahmadianfar et&#xa0;al., 2022</xref>), harris hawks optimization (HHO) 109 (<xref ref-type="bibr" rid="B17">Heidari et&#xa0;al., 2019</xref>) and slime mould algorithm (SMA) (<xref ref-type="bibr" rid="B30">Li et&#xa0;al., 2020</xref>). The slime mould optimization algorithm is an optimization algorithm proposed according to the vegetative growth process of a slime mould. The algorithm has the advantages of a simple structure, fast convergence speed, strong local search ability and relatively stable effect. In this paper, the optimization performance of the SMA is further improved, the improved SMA (ISMA) is used to optimize the hyperparameters of the DBN prediction model, and the optimal hyperparameter combination is used to construct the aquaculture water quality prediction model to achieve accurate prediction of water quality time series.</p>
<p>The main contributions of this paper include the following four points:</p>
<list list-type="simple">
<list-item>
<p>(1) In this paper, the multiscale decomposition of the water quality signal is carried out by VMD to reduce the complexity of the nonlinear dissolved oxygen time series, and the relatively stable subsequence is used to train the prediction model to improve the prediction accuracy.</p>
</list-item>
<list-item>
<p>(2) To set the number of VMD modes more reasonably, this paper calculates the mean absolute error (MAE) between the original signal and the decomposed mode reconstruction sequence and determines the mode decomposition number according to the change trend of the MAE value to prevent information loss and mode aliasing.</p>
</list-item>
<list-item>
<p>(3) In this paper, elite opposition-based learning and improved nonlinear convergence factors are used to improve the SMA with multiple strategies, which improves the diversity of the initial population of the algorithm, balances the global search ability and local search ability of the algorithm, and makes it have better convergence accuracy and stability.</p>
</list-item>
<list-item>
<p>(4) Through the ISMA, the training process of the DBN neural network is optimized to obtain the best parameter combination, which makes the model structure more reasonable and greatly improves the prediction accuracy of the time series.</p>
</list-item>
</list>
</sec>
<sec id="s2" sec-type="materials|methods">
<label>2</label>
<title>Material and methods</title>
<sec id="s2_1">
<label>2.1</label>
<title>Study area and data source</title>
<p>In this paper, the time series of dissolved oxygen in aquaculture water of marine ranches in Shandong Province, China, was used as a data sample to construct an accurate water quality prediction model. In recent years, Shandong Province has vigorously developed the construction of marine ranching, and more than 150 high-quality marine ranching projects have been built thus far. The authors of this paper deployed water quality sensors in 8 marine ranches on the Shandong Peninsula and established multiple aquaculture water quality data collection networks. Starting from June 2020, time series data, such as dissolved oxygen, pH, salinity, and water temperature, for aquaculture water quality indicators were collected year round, and the data were collected every ten minutes. <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref> shows the approximate locations of the marine ranches where water quality data were collected. <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref> shows the descriptive statistics of the dissolved oxygen time series collected from 8 marine ranches from June 1, 2021 to July 1, 2022.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>Approximate location of marine ranches where water quality data was collected.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g001.tif"/>
</fig>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Descriptive statistics of dissolved oxygen time series collected from 8 marine ranches.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left"/>
<th valign="top" align="center">Marine Ranching</th>
<th valign="top" align="center">Mean(mg/l)</th>
<th valign="top" align="center">STD(mg/l)</th>
<th valign="top" align="center">Min(mg/l)</th>
<th valign="top" align="center">Max(mg/l)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">Laizhou</td>
<td valign="top" align="center">5.88</td>
<td valign="top" align="center">0.59</td>
<td valign="top" align="center">4.53</td>
<td valign="top" align="center">6.83</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">Longkou</td>
<td valign="top" align="center">6.81</td>
<td valign="top" align="center">1.23</td>
<td valign="top" align="center">2.77</td>
<td valign="top" align="center">12.1</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">Yantai Laishan</td>
<td valign="top" align="center">6.75</td>
<td valign="top" align="center">0.45</td>
<td valign="top" align="center">5.49</td>
<td valign="top" align="center">8.19</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">Weihai Deming</td>
<td valign="top" align="center">8.59</td>
<td valign="top" align="center">1.02</td>
<td valign="top" align="center">4.77</td>
<td valign="top" align="center">11.8</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">Rongchen Chundao</td>
<td valign="top" align="center">6.71</td>
<td valign="top" align="center">0.87</td>
<td valign="top" align="center">5.66</td>
<td valign="top" align="center">13.1</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">Qingdao Luhaifeng</td>
<td valign="top" align="center">5.81</td>
<td valign="top" align="center">2.75</td>
<td valign="top" align="center">1.01</td>
<td valign="top" align="center">11.6</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">Qingdao jiaonan</td>
<td valign="top" align="center">5.71</td>
<td valign="top" align="center">0.73</td>
<td valign="top" align="center">1.58</td>
<td valign="top" align="center">8.61</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">Rizhao</td>
<td valign="top" align="center">6.61</td>
<td valign="top" align="center">1.21</td>
<td valign="top" align="center">4.46</td>
<td valign="top" align="center">10.9</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Variational mode decomposition</title>
<p>VMD is an adaptive, completely non recursive variational mode signal decomposition method that determines the frequency center and bandwidth of each component by iteratively searching for the optimal solution of the variational model. The nonstationary time series is decomposed into <inline-formula>
<mml:math display="inline" id="im1">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> relatively stationary intrinsic mode function (IMF) subsequences <inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> with different frequency scales. The center frequency of</p>
<p>each subsequence is <inline-formula>
<mml:math display="inline" id="im3">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The constraint condition is that the sum of the IMF components is equal to the original signal. The specific construction steps are as follows:</p>
<p>(1) Obtain the signal of each IMF component through the Hilbert transform, calculate its unilateral spectrum, and use exponential correction to modulate the spectrum of each mode function to the corresponding baseband [13], as shown in the following equation (1).</p>
<disp-formula>
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>*</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>j</mml:mi>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im4">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>represents the k IMF components obtained by the decomposition process, and <inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>represents the center frequency of each component, <inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is a generalized function, that is, the Dirac delta function, <inline-formula>
<mml:math display="inline" id="im7">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula>is the imaginary unit, and exponential <inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>j</mml:mi>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> correction is used to modulate the spectrum of each mode function to the corresponding fundamental frequency band (<xref ref-type="bibr" rid="B36">Niu et&#xa0;al., 2020</xref>).</p>
<p>(2) Calculate the square of the norm of the gradient of the demodulated signal and perform Gaussian smoothing to obtain the bandwidth of each mode signal, as shown in the following equation (2)</p>
<disp-formula>
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>*</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>j</mml:mi>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:msubsup>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mo>&#x2022;</mml:mo>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>indicates 2-norm processing and <inline-formula>
<mml:math display="inline" id="im10">
<mml:mo>*</mml:mo>
</mml:math>
</inline-formula>is the convolution operation.</p>
<p>(3) When construct a variational problem, the sum of the estimated bandwidths of each mode is the smallest, the constraint condition is that the sum of all modes is equal to the original signal <inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and the corresponding constraint variational expression is shown in equation (3).</p>
<disp-formula>
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mtext>&#xa0;&#xa0;</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munder>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>*</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>j</mml:mi>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:msubsup>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>(4) To find the optimal solution of the constrained variational problem, the augmented Lagrangian function is introduced by taking advantage of the quadratic penalty term and the Lagrangian multiplier to transform the constrained variational problem into an unconstrained variational problem, as shown in Equation (4).</p>
<disp-formula>
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo> <mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow> <mml:mo>}</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo> <mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow> <mml:mo>}</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:munder>
<mml:mstyle>
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:mo>&#x2016;</mml:mo>
<mml:msub>
<mml:mo>&#x2202;</mml:mo>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo> <mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>*</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow> <mml:mo>]</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>j</mml:mi>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2016;</mml:mo>
<mml:msubsup>
<mml:mo>&#xa0;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>+</mml:mo>
<mml:mo stretchy="false">&#x2016;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:munder>
<mml:mstyle>
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">&#x2016;</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mo stretchy="false">&#x2329;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:munder>
<mml:mstyle>
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">&#x232a;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im12">
<mml:mi>&#x3b1;</mml:mi>
</mml:math>
</inline-formula>is the quadratic penalty term, which can ensure the accuracy of signal reconstruction in a Gaussian noise environment. <inline-formula>
<mml:math display="inline" id="im13">
<mml:mi>&#x3bb;</mml:mi>
</mml:math>
</inline-formula>is the Lagrangian multiplication operator, which can maintain the strictness of the constraints (<xref ref-type="bibr" rid="B13">Dragomiretskiy and Zosso, 2014</xref>; <xref ref-type="bibr" rid="B55">Yang and Liu, 2022</xref>).</p>
<p>(5) Use the alternating direction method of multipliers (ADMM) to iteratively solve each IMF component <inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>and its corresponding center frequency <inline-formula>
<mml:math display="inline" id="im15">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The formulas are (5) and (6), respectively.</p>
<disp-formula>
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>u</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>f</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mover accent="true">
<mml:mi>u</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mover accent="true">
<mml:mi>&#x3bb;</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">/</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>&#x3b1;</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:msubsup>
<mml:mi>v</mml:mi>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:munderover>
<mml:mo>&#x222b;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mi>&#x221e;</mml:mi>
</mml:munderover>
<mml:mi>w</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>u</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo stretchy="false">/</mml:mo>
<mml:munderover>
<mml:mo>&#x222b;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mi>&#x221e;</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>u</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>w</italic> is the frequency, <inline-formula>
<mml:math display="inline" id="im16">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>f</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the Fourier transform of the original signal <italic>f</italic>(<italic>t</italic>), and <inline-formula>
<mml:math display="inline" id="im17">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>u</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im18">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>&#x3bb;</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> are the Fourier transforms of <inline-formula>
<mml:math display="inline" id="im19">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im20">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, respectively.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Slime mould algorithm</title>
<p>The SMA was proposed by Li et&#xa0;al. in 2020. The algorithm mainly simulates the behavior and morphological changes in slime moulds during foraging foraging (<xref ref-type="bibr" rid="B30">Li et&#xa0;al., 2020</xref>). The slime mould judges the location of the food according to the concentration of the food. The higher the concentration of food is, the stronger the propagating waves generated by the biological oscillator in the body. This causes an increase in the width of the veins, forming a network of veins with different thicknesses between multiple food sources and establishing the best path for finding food. In addition, after the slime mould obtains food, there is still a certain probability of searching the unknown area (<xref ref-type="bibr" rid="B60">Zubaidi et al., 2020</xref>). The position update formula of a slime mould individual is shown in (7).</p>
<disp-formula>
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext>r</mml:mtext>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>*</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mtable>
<mml:mtr>



<mml:mtd>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
<mml:mo>*</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>*</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mtable>
<mml:mtr>

<mml:mtd>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>*</mml:mo>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Among them, <inline-formula>
<mml:math display="inline" id="im21">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>and <inline-formula>
<mml:math display="inline" id="im22">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>represent the upper and lower boundaries of the search range, <inline-formula>
<mml:math display="inline" id="im23">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is a random oscillation ranging from -a to a and gradually approaches 0 as the number of iterations increases, <inline-formula>
<mml:math display="inline" id="im24">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>oscillates from -1to 1 and finally tends to 0. Moreover, <inline-formula>
<mml:math display="inline" id="im25">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>represents a random value in the [0,1] interval, z is a custom parameter that represents the proportion of randomly distributed slime mould individuals to the population and is generally 0.03, <italic>t</italic> is the current iteration number, and <inline-formula>
<mml:math display="inline" id="im26">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>represents the slime mould individual with the best fitness. <inline-formula>
<mml:math display="inline" id="im27">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>represents the position of the current iteration of the slime mould individual, and <inline-formula>
<mml:math display="inline" id="im28">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>and <inline-formula>
<mml:math display="inline" id="im29">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>are the positions of two random individuals. <inline-formula>
<mml:math display="inline" id="im30">
<mml:mi>W</mml:mi>
</mml:math>
</inline-formula>represents the weight coefficient.</p>
<p>The update formulas of the control parameter <inline-formula>
<mml:math display="inline" id="im31">
<mml:mi>p</mml:mi>
</mml:math>
</inline-formula>, parameter <inline-formula>
<mml:math display="inline" id="im32">
<mml:mi>a</mml:mi>
</mml:math>
</inline-formula>and parameter <inline-formula>
<mml:math display="inline" id="im33">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>in formula (7) are formulas (8), (9) and (10), respectively.</p>
<disp-formula>
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>tanh</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x22ef;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im34">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula>is the number of slime mould populations, and <inline-formula>
<mml:math display="inline" id="im35">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>represents the fitness value of the i-th slime mould individual. <inline-formula>
<mml:math display="inline" id="im36">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is the current optimal fitness value. The <inline-formula>
<mml:math display="inline" id="im37">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>function is a nonlinear activation function whose output value is in the interval [-1,1].</p>
<disp-formula>
<label>(9)</label>
<mml:math display="block" id="M9">
<mml:mrow>
<mml:mtext>a</mml:mtext>
<mml:mo>=</mml:mo>
<mml:mtext>arctanh</mml:mtext>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mtext>t</mml:mtext>
<mml:mo stretchy="false">/</mml:mo>
<mml:msub>
<mml:mtext>T</mml:mtext>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im38">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> is the current number of iterations, and <inline-formula>
<mml:math display="inline" id="im39">
<mml:mrow>
<mml:msub>
<mml:mtext>T</mml:mtext>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>is the maximum number of iterations. The <inline-formula>
<mml:math display="inline" id="im40">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>function is the reverse hyperbolic tangent function.</p>
<disp-formula>
<label>(10)</label>
<mml:math display="block" id="M10">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The value of <inline-formula>
<mml:math display="inline" id="im41">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> oscillates in the interval <inline-formula>
<mml:math display="inline" id="im42">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and the synergy between <inline-formula>
<mml:math display="inline" id="im43">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im44">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> simulates the selection behavior of slime moulds. The weight coefficient <inline-formula>
<mml:math display="inline" id="im45">
<mml:mi>W</mml:mi>
</mml:math>
</inline-formula>of slime mould individuals is related to their fitness value. The weight formula of individuals whose fitness value sequence is in the top 50% in the slime mould population is provided in (11).</p>
<disp-formula>
<label>(11)</label>
<mml:math display="block" id="M11">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>f</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>*</mml:mo>
<mml:mi>log</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>b</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">/</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>b</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The weight coefficient formula <inline-formula>
<mml:math display="inline" id="im46">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>of other slime mould individuals is provided in (12).</p>
<disp-formula>
<label>(12)</label>
<mml:math display="block" id="M12">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>*</mml:mo>
<mml:mi>log</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>b</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">/</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>b</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In Equations (11) and (12), <inline-formula>
<mml:math display="inline" id="im47">
<mml:mi>r</mml:mi>
</mml:math>
</inline-formula>represents a random number ranging from 0 to 1, and <inline-formula>
<mml:math display="inline" id="im48">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im49">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represent the best and worst fitness values for the current iteration, respectively.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Deep belief network</title>
<p>A DBN is a deep neural network composed of multiple layers of restricted Boltzmann machines (RBMs) and one layer of a back propagation (BP) neural network (<xref ref-type="bibr" rid="B19">Hinton and Salakhutdinov, 2006</xref>; <xref ref-type="bibr" rid="B18">Hinton et&#xa0;al., 2006</xref>). The RBM consists of a visible layer and a hidden layer. In the DBN structure, the hidden layer of the bottom RBM is the visible layer of the next RBM, and the output of the last RBM is used as the input of the BP neural network. The training process of the DBN is carried out layer by layer, and the RBM of the current layer can be trained only after the RBM of the previous layer is fully trained. The structure of a simple DBN model is shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref>.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>Structure diagram of the DBN model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g002.tif"/>
</fig>
<p>The optimization of the DBN model consists of two steps: unsupervised training and supervised fine-tuning. The DBN trains each layer of RBM separately, determines the weights and offsets of the first RBM, and uses the states of its hidden neurons as the input vector for the second RBM. After the second RBM is fully trained, the second RBM is stacked on top of the first RBM, and each layer of RMB is trained in turn, making sure to extract as much feature information as possible.</p>
<p>The last layer of the DBN is the BP neural network. During supervised tuning training, the BP algorithm is used to update the weights and biases of the model. Each layer of RBM can only ensure that the weights and bias values in its own layer are optimal for the feature vector mapping of this layer and not for the feature vector mapping of the entire DBN. The BP algorithm propagates the error information from top to bottom to each layer of the RBM and fine-tunes the entire DBN layer by layer. RBM is a shallow neural network with only two layers. The training time of RBM is significantly reduced compared with the deep neural network. The overall training of the DBN deep neural network is simplified to the training of multiple RBMs, which can improve the training efficiency and speed up the convergence speed. After training, the network is fine-tuned by the BP algorithm, so that the model converges to the local optimum, improves the convergence accuracy, and realizes the efficient training of the DBN neural network. The DBN prevents falling into a local optimum through unsupervised layer-by-layer training and improves the convergence speed and accuracy through supervised fine-tuning.</p>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Evaluation of the predictive models</title>
<p>The accuracy of the prediction model is measured by calculating the similarity between the predicted value and the actual value. Common evaluation indicators include mean absolute error (MAE), mean absolute percentage error (MAPE), mean squared error (MSE), Willmott indexr (WI)(<xref ref-type="bibr" rid="B52">Willmott et&#xa0;al., 2012</xref>) and goodness of fit (<inline-formula>
<mml:math display="inline" id="im50">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>). In this paper, the above indicators are used to evaluate the prediction performance of our model and other comparative models. Assuming that the predicted value is <inline-formula>
<mml:math display="inline" id="im51">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, the actual value is <inline-formula>
<mml:math display="inline" id="im52">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im53">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> is the number of samples, the formulas of each indicator are as follows: (13), (14), (15), (16) and (17).</p>
<disp-formula>
<label>(13)</label>
<mml:math display="block" id="M13">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(14)</label>
<mml:math display="block" id="M14">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(15)</label>
<mml:math display="block" id="M15">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(16)</label>
<mml:math display="block" id="M16">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>I</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mo>+</mml:mo>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(17)</label>
<mml:math display="block" id="M17">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>^</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <inline-formula>
<mml:math display="inline" id="im54">
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:math>
</inline-formula> is the mean of all samples.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Simulation experiment and result analysis</title>
<sec id="s3_1">
<label>3.1</label>
<title>Decomposition of dissolved oxygen time series</title>
<p>Aquaculture water quality data are easily affected by the external environment, biological activities and fishermen intervention. They have the characteristics of nonlinearity and instability and are affected by the accuracy and performance of water quality sensor acquisition equipment, and the data contain much noise. Therefore, training the model directly with the original dissolved oxygen time series limits the accuracy and stability of the prediction to a certain extent. Through the mode decomposition of VMD, multiple IMF subsequences with different frequency scales and relative stability are obtained. Using each subsequence for model training can greatly improve the prediction accuracy.</p>
<p>When applying VMD for mode decomposition, we can set the number of mode decomposition components according to the data characteristics. When the number of modes is too small, some important information in the original signal will be filtered, which will affect the accuracy of subsequent predictions. When the number of modes is too large, the center frequencies of adjacent mode components will be closer, resulting in mode overlap and excessive decomposition. In this paper, when determining the number of VMD modes, the MAE of the original signal and the&#xa0;decomposed mode reconstruction sequence is used as the optimization index, and the mode decomposition number is determined according to the change trend of the MAE value. The calculation of the MAE is shown in Equation (18).</p>
<disp-formula>
<label>(18)</label>
<mml:math display="block" id="M18">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>N</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>k</mml:mi>
</mml:munder>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>In the above formula, <inline-formula>
<mml:math display="inline" id="im55">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>is the original signal to be decomposed, <inline-formula>
<mml:math display="inline" id="im56">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>is the decomposed mode component, <inline-formula>
<mml:math display="inline" id="im57">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula>is the number of mode components, and <inline-formula>
<mml:math display="inline" id="im58">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>is the length of the time series. The VMD of 8640 dissolved oxygen data from Weihai Demingmarine ranching from June 1, 2021, to August 1, 2021, is taken as an example to optimize the mode decomposition number. In this paper, the number of decomposition components is set in the range of 2 to 10. After each decomposition step, the decomposed IMF sequence is reconstructed, and the MAE value of the reconstructed sequence and the original sequence are calculated. From the variation trend of the MAE in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>, it can be found that when the number of decomposition modes is 4, the value of the MAE tends to be stable, so the number of VMD modes of this dissolved oxygen time series is set to 4.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>The change curve of the MAE value.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g003.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref> shows the decomposition effect of this dissolved oxygen time series.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>VMD of the dissolved oxygen time series.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g004.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Improved slime mould algorithm</title>
<p>The SMA has a simple structure and strong global search ability, but it also has shortcomings, such as a weak shrinkage mechanism and the tendency to easily fall into a local optimum. To make the SMA have better convergence accuracy and more stability, this paper uses elite opposition-based learning and a nonlinear convergence factor to improve it and proposes a multi strategy ISMA.</p>
<p>The opposition-based learning (OBL) model proposed by Tizhoosh calculates the current solution and the opposite solution in the process of searching for a feasible solution to a problem and selects an item that is closer to the optimal solution for the next iteration (<xref ref-type="bibr" rid="B39">Rahnamayan et&#xa0;al., 2008</xref>). OBL has been applied to improve various intelligent algorithms (<xref ref-type="bibr" rid="B15">Gupta et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B45">Shekhawat and Saxena, 2020</xref>; <xref ref-type="bibr" rid="B48">Tubishat et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B51">Wang et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B29">Li et&#xa0;al., 2022a</xref>).</p>
<p>Elite OBL (EOBL) forms an elite population and its opposite population based on the individual with the best fitness and then selects an individual with better fitness from the two populations to form a new population (<xref ref-type="bibr" rid="B1">Abualigah et&#xa0;al., 2021</xref>).</p>
<p>Assuming that at the t-th iteration, <inline-formula>
<mml:math display="inline" id="im59">
<mml:mrow>
<mml:msubsup>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>e</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>is the elite solution of individual <inline-formula>
<mml:math display="inline" id="im60">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in the <inline-formula>
<mml:math display="inline" id="im61">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula> dimension, then its opposite solution is <inline-formula>
<mml:math display="inline" id="im62">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>E</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. Its solution formula is shown in equation (19).</p>
<disp-formula>
<label>(19)</label>
<mml:math display="block" id="M19">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>e</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
<mml:mo>*</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>e</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Among them, <inline-formula>
<mml:math display="inline" id="im63">
<mml:mi>&#x3bb;</mml:mi>
</mml:math>
</inline-formula>is a random value in the range of 0 to 1, and <inline-formula>
<mml:math display="inline" id="im64">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>and <inline-formula>
<mml:math display="inline" id="im65">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>are the minimum and maximum values of the j-th dimension individual, respectively. If the elite opposition solution <inline-formula>
<mml:math display="inline" id="im66">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>E</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>exceeds the boundary, it is reset by random generation, as shown in formula (20).</p>
<disp-formula>
<label>(19)</label>
<mml:math display="block" id="M20">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>E</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The performance of the slime mould optimization algorithm is greatly affected by the quality of the initial population. A high-quality initial population can speed up the convergence of the algorithm and help to find the global optimal solution. This paper applies the EOBL strategy to the initialization of the SMA population, calculates the fitness value, obtains the elite slime mould individuals and dynamic boundaries, and improves the quality and diversity of the initial population.</p>
<p>In the iterative optimization process of SMA, the change in parameter <inline-formula>
<mml:math display="inline" id="im67">
<mml:mi>a</mml:mi>
</mml:math>
</inline-formula>has an important influence on balancing the global search ability and local exploration ability. Parameter <inline-formula>
<mml:math display="inline" id="im68">
<mml:mi>a</mml:mi>
</mml:math>
</inline-formula>decreases rapidly in the early iterations, this decrease slows down inthe later iterations, and a smaller <inline-formula>
<mml:math display="inline" id="im69">
<mml:mi>a</mml:mi>
</mml:math>
</inline-formula>in the early stage is not conducive to global exploration. Therefore, this paper proposes a new nonlinear decreasing strategy, and the updated formula for parameter <inline-formula>
<mml:math display="inline" id="im70">
<mml:mi>a</mml:mi>
</mml:math>
</inline-formula>is shown in (21).</p>
<disp-formula>
<label>(21)</label>
<mml:math display="block" id="M21">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>*</mml:mo>
<mml:mi>cos</mml:mi>
<mml:msup>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
<mml:mo>*</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Among them, <inline-formula>
<mml:math display="inline" id="im71">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>is the current number of iterations, and <inline-formula>
<mml:math display="inline" id="im72">
<mml:mi>T</mml:mi>
</mml:math>
</inline-formula>is the maximum number of iterations.</p>
<p>As shown in <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref>, the parameter a in this paper decreases slowly in the early stage, which is beneficial to global exploration. In later iterations, the speed of convergence is accelerated, which is beneficial to the local search.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Convergence curve for parameter a.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g005.tif"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>DBN prediction model optimized based on the ISMA</title>
<p>In the construction of the DBN prediction model, several hyperparameter settings are involved, including the number of hidden layers, the number of nodes in each layer, the training times and learning rate in the unsupervised pretraining stage and the momentum. If the hyperparameter optimization is carried out by means of experimental verification, the process is slow, and it is difficult to obtain the best combination of hyperparameters. Therefore, this paper uses the ISMA to optimize the hyperparameters to build the prediction model.</p>
<p>The construction steps of an aquaculture water quality prediction model (VMD-ISMA-DBN) based on VMD and the ISMA to optimize the DBN are as follows.</p>
<list list-type="simple">
<list-item>
<p>(1) In view of the nonlinear and nonstationary characteristics of the dissolved oxygen series in aquaculture water quality, VMD was used to decompose the data series into multiple relatively stable IMF components.</p>
</list-item>
<list-item>
<p>(2) EOBL and a nonlinear convergence factor are applied to improve the optimization performance of the SMA to improve its convergence accuracy and stability.</p>
</list-item>
<list-item>
<p>(3) The optimization algorithm of DBN hyperparameters is studied, and a DBN prediction model optimized by the ISMA (ISMA-DBN) is constructed.</p>
</list-item>
<list-item>
<p>(4) Take each IMF subsequence decomposed by VMD as input samples to train the ISMA-DBN model, obtain the optimal hyperparameter combination of each sequence, and predict each subsequence.</p>
</list-item>
<list-item>
<p>(5) The prediction values of each IMF subsequence are superimposed to obtain the final prediction result of the original sequence, and the performance of the prediction model is verified by comparative experiments.</p>
</list-item>
</list>
<p>The structure diagram of the VMD-ISMA-DBN prediction model is shown in <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref>.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>Framework of the VMD-ISMA-DBN prediction model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g006.tif"/>
</fig>
<p>Using the dissolved oxygen data of the Laizhou marine ranch as the experimental sample of the VMD-ISMA-DBN model, the four IMF subsequences obtained by mode decomposition were trained and predicted. The first 80% of the data were used as the training set, and the last 20% of the data were used as the test set. <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> shows the convergence curves for each IMF sequence trained using the SMA-DBN model and the ISMA-DBN model respectively</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>Convergence curves of the IMF components.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g007.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref>, in the iterative optimization process of the four IMF subsequences, compared with SMA-DBN, ISMA-DBN has faster convergence speed, higher convergence accuracy, and stronger ability to avoid falling into local optimum. <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref> shows the optimal values of the hyperparameters of the DBN model optimized by the ISMA for each IMF sequence, including the learning rate of the pretraining (lr_p), the number of iterations for pretraining (epo_p), the learning rate for fine-tuning (lr_f), the number of iterations for fine-tuning (epo_f), the momentum, the&#xa0;batch size (B_S) and the number of hidden layers (nlayer). From the data in <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref>, it can be seen that the prediction of the two high-frequency components of IMF3 and IMF4 is relatively difficult, and the network structure is more complex than the two low-frequency components of IMF1 and IMF2.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Optimal hyperparameter values of the DBN for each IMF subsequence.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="center">IMFs</th>
<th valign="top" align="center">lr_p</th>
<th valign="top" align="center">epo_p</th>
<th valign="top" align="center">lr_f</th>
<th valign="top" align="center">epo_f</th>
<th valign="top" align="center">momentum</th>
<th valign="top" align="center">B_S</th>
<th valign="top" align="center">nlayer</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">IMF1</td>
<td valign="top" align="center">0.060</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">0.121</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">0.655</td>
<td valign="top" align="center">10</td>
<td valign="top" align="center">1</td>
</tr>
<tr>
<td valign="top" align="left">IMF2</td>
<td valign="top" align="center">0.089</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">0.144</td>
<td valign="top" align="center">106</td>
<td valign="top" align="center">0.555</td>
<td valign="top" align="center">24</td>
<td valign="top" align="center">2</td>
</tr>
<tr>
<td valign="top" align="left">IMF3</td>
<td valign="top" align="center">0.046</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">0.076</td>
<td valign="top" align="center">176</td>
<td valign="top" align="center">0.526</td>
<td valign="top" align="center">12</td>
<td valign="top" align="center">3</td>
</tr>
<tr>
<td valign="top" align="left">IMF4</td>
<td valign="top" align="center">0.020</td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">0.037</td>
<td valign="top" align="center">184</td>
<td valign="top" align="center">0.971</td>
<td valign="top" align="center">12</td>
<td valign="top" align="center">3</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref> shows the fitting effect of each IMF subsequence predicted by the VMD-ISMA-DBN model proposed in this paper.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Prediction effect of the VMD-ISMA-DBN model on IMF subsequences.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g008.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref> shows that after dividing the original time series into relatively stable IMF subsequences, the complexity of the series is reduced, and the prediction accuracy is greatly improved. The low-frequency components with strong regularity and large amplitudes have an accurate prediction effect. There are some errors in the prediction of the high-frequency signal, but due to its small amplitude, it has little effect on the final prediction after being superimposed with the prediction result of the low-frequency component.</p>
<p>The prediction results of each IMF component are superimposed to obtain the final prediction results of the original dissolved oxygen time series. As shown in <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>, the predicted value after superposition fits well with the actual value, and the model in this paper shows very accurate prediction performance.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>Final prediction effect of the VMD-ISMA-DBN model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g009.tif"/>
</fig>
</sec>
</sec>
<sec id="s4" sec-type="results">
<label>4</label>
<title>Results</title>
<sec id="s4_1">
<label>4.1</label>
<title>Ablation study</title>
<p>To verify the effectiveness of each component of VMD-ISMA-DBN in improving model performance, the following five prediction models were constructed for ablation research.</p>
<list list-type="simple">
<list-item>
<p>(1) A DBN is used to build a prediction model, the hyperparameters of the model are .manually selected through experience, and the original dissolved oxygen sequence is used as the input sample.</p>
</list-item>
<list-item>
<p>(2) The SMA is used to optimize the DBN model, the model hyperparameters are selected through the optimization algorithm, the original dissolved oxygen sequence is used as the input sample, and the model is named SMA-DBN.</p>
</list-item>
<list-item>
<p>(3) Only the EOBL mechanism is used to improve the SMA; the improved algorithm is used to optimize the DBN model, the original dissolved oxygen sequence is used as the input sample, and the model is named ISMA1-DBN.</p>
</list-item>
<list-item>
<p>(4) The SMA is improved only by changing the convergence factor. The DBN model is optimized with the ISMA, the original dissolved oxygen sequence is used as the input sample, and the model is named ISMA2-DBN.</p>
</list-item>
<list-item>
<p>(5) The SMA is improved by using the combination of the EOBL mechanism and by changing the convergence factor, and the ISMA is used to optimize the DBN. The original sequence is used as the input sample, and the model is named ISMA-DBN.</p>
</list-item>
</list>
<p>The above five models are compared with the VMD-ISMA-DBN model proposed in this paper, and the experimental results are shown in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>.</p>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>Results of the ablation experiments.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g010.tif"/>
</fig>
<p>The evaluation index values of each experimental model are shown in <xref ref-type="table" rid="T3">
<bold>Table&#xa0;3</bold>
</xref>.</p>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>The prediction performance evaluation index value of each model.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Model</th>
<th valign="top" align="center">MAE</th>
<th valign="top" align="center">MAPE</th>
<th valign="top" align="center">MSE</th>
<th valign="top" align="center">WI</th>
<th valign="top" align="center">
<italic>R<sup>2</sup>
</italic>
</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">DBN</td>
<td valign="top" align="center">0.1109</td>
<td valign="top" align="center">0.0129</td>
<td valign="top" align="center">0.0277</td>
<td valign="top" align="center">0.8992</td>
<td valign="top" align="center">0.8915</td>
</tr>
<tr>
<td valign="top" align="left">SMA-DBN</td>
<td valign="top" align="center">0.0929</td>
<td valign="top" align="center">0.0123</td>
<td valign="top" align="center">0.0216</td>
<td valign="top" align="center">0.9401</td>
<td valign="top" align="center">0.9319</td>
</tr>
<tr>
<td valign="top" align="left">ISMA1-DBN</td>
<td valign="top" align="center">0.0910</td>
<td valign="top" align="center">0.0118</td>
<td valign="top" align="center">0.0196</td>
<td valign="top" align="center">0.9602</td>
<td valign="top" align="center">0.9559</td>
</tr>
<tr>
<td valign="top" align="left">ISMA2-DBN</td>
<td valign="top" align="center">0.0886</td>
<td valign="top" align="center">0.0116</td>
<td valign="top" align="center">0.0200</td>
<td valign="top" align="center">0.9541</td>
<td valign="top" align="center">0.9512</td>
</tr>
<tr>
<td valign="top" align="left">ISMA-DBN</td>
<td valign="top" align="center">0.0881</td>
<td valign="top" align="center">0.0113</td>
<td valign="top" align="center">0.0189</td>
<td valign="top" align="center">0.9802</td>
<td valign="top" align="center">0.9672</td>
</tr>
<tr>
<td valign="top" align="left">VMD-ISMA-DBN</td>
<td valign="top" align="center">0.0629</td>
<td valign="top" align="center">0.0106</td>
<td valign="top" align="center">0.0165</td>
<td valign="top" align="center">0.9916</td>
<td valign="top" align="center">0.9729</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref> and <xref ref-type="table" rid="T3">
<bold>Table&#xa0;3</bold>
</xref>, the DBN model needs to adjust many hyperparameters, and the prediction error is large if adjusted purely by experience. The training process of the DBN model is optimized by the SMA, the setting of hyperparameters is more reasonable, and the prediction error is reduced. The two strategies of EOBL and the improved convergence factor are separately used to optimize the SMA. The ISMA further optimizes the hyperparameter combination of the DBN, and the prediction accuracy is further improved. The original dissolved oxygen time series is preprocessed by VMD, and the decomposed signal is smoother, which can reduce the difficulty of prediction and significantly improve the prediction performance. The prediction curve of the VMD-ISMA-DBN model proposed in this paper has a better fitting effect than the other methods in the maximum value and minimum value, and the prediction trend is closer to the actual curve, which illustrates the more accurate prediction effect.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Comparative experiments</title>
<p>To further verify the prediction performance of the VMD-ISMA-DBN model, it is compared with six other intelligent prediction models, namely, the autoregressive integrated moving average model (ARIMA) (<xref ref-type="bibr" rid="B53">Xuan et&#xa0;al. (2021)</xref>), random forest (RF) regressor (<xref ref-type="bibr" rid="B47">Tiyasha et&#xa0;al. (2021)</xref>), temporal convolutional network (TCN) (<xref ref-type="bibr" rid="B31">Li et&#xa0;al. (2022b)</xref>), extreme learning machine (ELM) (<xref ref-type="bibr" rid="B5">An et&#xa0;al. (2022)</xref>), gated recurrent unit (GRU) (<xref ref-type="bibr" rid="B11">Cao et&#xa0;al. (2020)</xref> and long short-term memory (LSTM) (<xref ref-type="bibr" rid="B8">Barzegar et&#xa0;al. (2020)</xref>) The main parameters of each model are shown in <xref ref-type="table" rid="T4">
<bold>Table&#xa0;4</bold>
</xref>.</p>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>The main parameters of each comparative model.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Model</th>
<th valign="top" align="center">Main hyperparameters</th>
<th valign="top" align="center">Value</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" rowspan="3" align="left">ARIMA</td>
<td valign="top" align="center">p: Number of autoregressive terms</td>
<td valign="top" align="center">4</td>
</tr>
<tr>
<td valign="top" align="center">d: Number of nonseasonal differences</td>
<td valign="top" align="center">1</td>
</tr>
<tr>
<td valign="top" align="center">q: Number of lagged forecast errors</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" rowspan="3" align="left">ELM</td>
<td valign="top" align="center">n: Number of input neurons</td>
<td valign="top" align="center">3</td>
</tr>
<tr>
<td valign="top" align="center">L: Number of hidden neurons</td>
<td valign="top" align="center">30</td>
</tr>
<tr>
<td valign="top" align="center">m: Number of output neurons</td>
<td valign="top" align="center">1</td>
</tr>
<tr>
<td valign="top" rowspan="2" align="left">RF</td>
<td valign="top" align="center">n estimators: Number of decision trees</td>
<td valign="top" align="center">30</td>
</tr>
<tr>
<td valign="top" align="center">max depth: Maximum depth of the tree</td>
<td valign="top" align="center">10</td>
</tr>
<tr>
<td valign="top" rowspan="3" align="left">LSTM</td>
<td valign="top" align="center">input size: Number of expected features in the input</td>
<td valign="top" align="center">6</td>
</tr>
<tr>
<td valign="top" align="center">hidden size: Dimension of the hidden layer state</td>
<td valign="top" align="center">10</td>
</tr>
<tr>
<td valign="top" align="center">num layers: Number of stacking layers of LSTM</td>
<td valign="top" align="center">2</td>
</tr>
<tr>
<td valign="top" rowspan="3" align="left">TCN</td>
<td valign="top" align="center">nb filters: Number of convolution kernel</td>
<td valign="top" align="center">20</td>
</tr>
<tr>
<td valign="top" align="center">kernel size: Size of revolution kernels</td>
<td valign="top" align="center">46</td>
</tr>
<tr>
<td valign="top" align="center">Optimizer: Optimizer of the model</td>
<td valign="top" align="center">Adam</td>
</tr>
<tr>
<td valign="top" rowspan="3" align="left">GRU</td>
<td valign="top" align="center">hidden size: Number of hidden layer nodes</td>
<td valign="top" align="center">8</td>
</tr>
<tr>
<td valign="top" align="center">num layers: Number of recurrent layers</td>
<td valign="top" align="center">2</td>
</tr>
<tr>
<td valign="top" align="center">batch size: Number of samples per training</td>
<td valign="top" align="center">32</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref> shows the prediction effect of each comparative model and VMD-ISMA-DBN on a 12-hour dissolved oxygen time series. It shows that the VMD-ISMA-DBN model proposed in this paper has a better prediction effect on dissolved oxygen water quality data than the other comparison models, and the prediction curve is more in line with the actual time series.</p>
<fig id="f11" position="float">
<label>Figure&#xa0;11</label>
<caption>
<p>Comparison of the prediction effects of each model and VMD-ISMA-DBN.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g011.tif"/>
</fig>
<p>The ARIMA model performs stationary preprocessing on nonstationary sequences by means of differencing, and it cannot capture nonlinear relationships well. For unstable and nonlinear water quality data, the hyperparameter optimization process is complicated, and the prediction accuracy is lower than that of other models. The RF regressor model integrates multiple decision trees, and overfitting may occur when it is used for the prediction of time series with considerable noise. Due to the complexity of its structure, it takes more time to train than other models. The ELM has the characteristics of few training parameters and a fast training speed. However, for aquaculture water quality data with noise interference, the prediction effect of the ELM model is unstable. The LSTM and GRU neural networks achieve good results in time series prediction and solve the long-term dependency problem of RNNs. The vanishing gradient problem may occur during the training process. The model structure of the LSTM and GRU models is relatively complex, and it is easy to consume much memory when the training sequence is long. The TCN prediction model has the advantages of a stable gradient, low training memory requirements and accepting variable length inputs. The TCN model achieves better performance than the LSTM and GRU models in the prediction of dissolved oxygen time series. The DBN has the advantages of easy expansion, fast training, and less convergence time. In this paper, the improved SMA is used to optimize the hyperparameters of the DBN, and VMD is used to decompose the dissolved oxygen time series. The model in this paper achieves higher prediction accuracy than the other comparative models.</p>
<p>To verify the generalization performance of the model in this paper, the dissolved oxygen data of 6 other marine ranches were selected for experimental verification, and different time spans were selected to study the short-term and long-term prediction performance of the model. The water quality data of all marine ranches were collected every 10 minutes, and approximately 140 pieces of effective dissolved oxygen data were collected every day. During the experiment, 80% of the data are selected as the training set, and 20% of the data are used as the test set. <xref ref-type="table" rid="T5">
<bold>Table&#xa0;5</bold>
</xref> shows the statistics of the experimental data.</p>
<table-wrap id="T5" position="float">
<label>Table&#xa0;5</label>
<caption>
<p>Statistics of the experimental data.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Marine ranching</th>
<th valign="top" align="center">Acquisition time</th>
<th valign="top" align="center">Training set</th>
<th valign="top" align="center">Testing set</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Longkou</td>
<td valign="top" align="center">2021.3.1-2021.3.15</td>
<td valign="top" align="center">1728</td>
<td valign="top" align="center">432</td>
</tr>
<tr>
<td valign="top" align="left">Yantai Laishan</td>
<td valign="top" align="center">2021.3.1-2021.4.1</td>
<td valign="top" align="center">3456</td>
<td valign="top" align="center">864</td>
</tr>
<tr>
<td valign="top" align="left">Qingdao Luhaifeng</td>
<td valign="top" align="center">2021.3.1-2021.6.1</td>
<td valign="top" align="center">10368</td>
<td valign="top" align="center">2592</td>
</tr>
<tr>
<td valign="top" align="left">Rongchen Chundao</td>
<td valign="top" align="center">2021.3.1-2021.9.1</td>
<td valign="top" align="center">20736</td>
<td valign="top" align="center">5184</td>
</tr>
<tr>
<td valign="top" align="left">Qingdao Jiaonan</td>
<td valign="top" align="center">2021.3.1-2021.12.1</td>
<td valign="top" align="center">31104</td>
<td valign="top" align="center">7776</td>
</tr>
<tr>
<td valign="top" align="left">Rizhao</td>
<td valign="top" align="center">2021.3.1-2022.3.1</td>
<td valign="top" align="center">41472</td>
<td valign="top" align="center">10368</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="f12">
<bold>Figure&#xa0;12</bold>
</xref> shows that the model in this paper achieves good prediction performance for the dissolved oxygen time series from the six marine ranches, and the prediction curve fits the actual data curve well, indicating that the prediction model has strong generalization performance and stability. Observing the prediction effect of different time spans from 15 days to 1 year, the prediction error of the long-term series increases to a certain extent, and the fitting effect of the data mutation decreases. The reason for this phenomenon may be the accumulation of prediction errors. The model in this paper eliminates the influence of data non stationarity on the prediction effect by decomposing the water quality data by VMD and optimizes the parameters of the DBN model through the ISMA, which makes the hyperparameter settings reasonable and improves the prediction accuracy. The experimental results show that the VMD-ISMA-DBN model proposed in this paper is suitable for the prediction of aquaculture water quality time series.</p>
<fig id="f12" position="float">
<label>Figure&#xa0;12</label>
<caption>
<p>Prediction effect of the VMD-ISMA-DBN model on water quality data from multiple marine ranches.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1126556-g012.tif"/>
</fig>
</sec>
</sec>
<sec id="s5" sec-type="conclusions">
<label>5</label>
<title>Conclusion</title>
<p>In order to accurately predict the change trend of dissolved oxygen time series in aquaculture water, this paper proposes a DBN model based on ISMA optimization, and uses the VMD algorithm to decompose the input samples to reduce the impact of data fluctuations on water quality prediction. Ablation study shows that this model can significantly improve the prediction performance of the stand-alone DBN model. Comparative experiments show that this model has higher prediction accuracy and better generalization performance than other commonly used intelligent prediction models.</p>
<p>In this paper, a univariate recursive forecasting method is used to establish a model, and the historical time series of dissolved oxygen is used to predict future values. This model does not consider the impact of environmental factors and other water quality indicators on dissolved oxygen, which limits the universality of the prediction model to a certain extent.</p>
<p>In the future, we will study the interaction between the spatiotemporal environment and water quality indicators, build a multivariate water quality prediction model, and study the optimization of the hyperparameters of the deep learning model&#xa0;by intelligent algorithms to further improve the prediction accuracy.</p>
</sec>
<sec id="s6" sec-type="data-availability">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary material. Further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec id="s7" sec-type="author-contributions">
<title>Author contributions</title>
<p>HY conceived the framework of the paper, designed simulation experiments and intelligent algorithms, and co-wrote the paper. MS collected experimental data, designed figures and tables, conducted paper reviewing, and performed critical corrections. SL analyzed the experimental data, conducted simulated experiments and algorithm design, and co-wrote the paper.</p>
</sec>
</body>
<back>
<sec id="s8" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s9" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abualigah</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Diabat</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Elaziz</surname> <given-names>M. A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Improved slime mould algorithm by opposition-based learning and levy flight distribution for global optimization and advances in real-world engineering problems</article-title>. <source>J. Ambient Intell. Human. Comput</source>. <volume>14</volume>, <page-range>1163&#x2013;1202</page-range> doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s12652-021-03372-w</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmadianfar</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Bozorg-Haddad</surname> <given-names>O.</given-names>
</name>
<name>
<surname>Chu</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Gradient-based optimizer: a new metaheuristic optimization algorithm</article-title>. <source>Inf. Sci.</source> <volume>540</volume>, <fpage>131</fpage>&#x2013;<lpage>159</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ins.2020.06.037</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmadianfar</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Heidari</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Noshadian</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Gandomi</surname> <given-names>A. H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Info: an efficient optimization algorithm based on weighted mean of vectors</article-title>. <source>Expert Syst. Appl.</source> <volume>195</volume>, <elocation-id>116516</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2022.116516</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alsattar</surname> <given-names>H. A.</given-names>
</name>
<name>
<surname>Zaidan</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Zaidan</surname> <given-names>B. B.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Novel meta-heuristic bald eagle search optimisation algorithm</article-title>. <source>Artif. Intell. Rev.</source> <volume>53</volume>, <fpage>2237</fpage>&#x2013;<lpage>2264</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s10462-019-09732-5</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>An</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Tan</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Ultra-short-term wind power prediction based on pvmd-esma-delm</article-title>. <source>Energy Rep.</source> <volume>8</volume>, <fpage>8574</fpage>&#x2013;<lpage>8588</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.egyr.2022.06.079</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Antanasijevi&#x107;</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Pocajt</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Peri&#x107;-Gruji&#x107;</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Risti&#x107;</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Modelling of dissolved oxygen in the danube river using artificial neural networks and monte carlo simulation uncertainty analysis</article-title>. <source>J. Hydrol.</source> <volume>519</volume>, <fpage>1895</fpage>&#x2013;<lpage>1907</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jhydrol.2014.10.009</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Areerachakul</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sophatsathit</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Lursinsap</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Integration of unsupervised and supervised neural networks to predict dissolved oxygen concentration in canals</article-title>. <source>Ecol. Model.</source> <volume>261-262</volume>, <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecolmodel.2013.04.002</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barzegar</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Aalami</surname> <given-names>M. T.</given-names>
</name>
<name>
<surname>Adamowski</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Short-term water quality variable prediction using a hybrid cnn&#x2013;lstm deep learning model</article-title>. <source>Stochastic Environ. Res. Risk Assess.</source> <volume>34</volume>, <fpage>415</fpage>&#x2013;<lpage>433</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s00477-020-01776-2</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bi</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Yuan</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Multi-indicator water quality prediction with attention-assisted bidirectional lstm and encoder-decoder</article-title>. <source>Inf. Sci</source>. <volume>625</volume>, <page-range>65&#x2013;80</page-range> doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ins.2022.12.091</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brooks</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Corsi</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Fienen</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Carvin</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Predicting recreational water quality advisories: a comparison of statistical methods</article-title>. <source>Environ. Model. Software</source> <volume>76</volume>, <fpage>81</fpage>&#x2013;<lpage>94</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.envsoft.2015.10.012</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cao</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Duan</surname> <given-names>Q.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Prediction of dissolved oxygen in pond culture water based on k-means clustering and gated recurrent unit neural network</article-title>. <source>Aquacul. Eng.</source> <volume>91</volume>, <elocation-id>102122</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.aquaeng.2020.102122</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Da-bi-sru for water quality prediction in smart mariculture</article-title>. <source>Comput. Electron. Agric.</source> <volume>200</volume>, <elocation-id>107219</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compag.2022.107219</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dragomiretskiy</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Zosso</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Variational mode decomposition</article-title>. <source>IEEE Trans. Signal Process.</source> <volume>62</volume>, <fpage>531</fpage>&#x2013;<lpage>544</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TSP.2013.2288675</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Emam</surname> <given-names>M. M.</given-names>
</name>
<name>
<surname>Houssein</surname> <given-names>E. H.</given-names>
</name>
<name>
<surname>Ghoniem</surname> <given-names>R. M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A modified reptile search algorithm for global optimization and image segmentation: case study brain mri images</article-title>. <source>Comput. Biol. Med.</source> <volume>152</volume>, <elocation-id>106404</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106404</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gupta</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Deep</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Heidari</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Moayedi</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Opposition-based learning harris hawks optimization with advanced transition rules: principles and analysis</article-title>. <source>Expert Syst. Appl.</source> <volume>158</volume>, <elocation-id>113510</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2020.113510</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hassan</surname> <given-names>M. M.</given-names>
</name>
<name>
<surname>Alam</surname> <given-names>M. G. R.</given-names>
</name>
<name>
<surname>Uddin</surname> <given-names>M. Z.</given-names>
</name>
<name>
<surname>Huda</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Almogren</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Fortino</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Human emotion recognition using deep belief network architecture</article-title>. <source>Inf. Fusion</source> <volume>51</volume>, <fpage>10</fpage>&#x2013;<lpage>18</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inffus.2018.10.009</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Heidari</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Mirjalili</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Faris</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Aljarah</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Mafarja</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Harris Hawks optimization: algorithm and applications</article-title>. <source>Future Generat. Comput. Syst.</source> <volume>97</volume>, <fpage>849</fpage>&#x2013;<lpage>872</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.future.2019.02.028</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hinton</surname> <given-names>G. E.</given-names>
</name>
<name>
<surname>Osindero</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Teh</surname> <given-names>Y.-W.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>A fast learning algorithm for deep belief nets</article-title>. <source>Neural Comput.</source> <volume>18</volume>, <fpage>1527</fpage>&#x2013;<lpage>1554</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1162/neco.2006.18.7.1527</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hinton</surname> <given-names>G. E.</given-names>
</name>
<name>
<surname>Salakhutdinov</surname> <given-names>R. R.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Reducing the dimensionality of data with neural networks</article-title>. <source>Science</source> <volume>313</volume>, <fpage>504</fpage>&#x2013;<lpage>507</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1126/science.1127647</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Zhong</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Multi-strategy assisted chaotic coot-inspired optimization algorithm for medical feature selection: a cervical cancer behavior risk study</article-title>. <source>Comput. Biol. Med.</source> <volume>151</volume>, <elocation-id>106239</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106239</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huan</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Cao</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Qin</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Prediction of dissolved oxygen in aquaculture based on eemd and lssvm optimized by the bayesian evidence framework</article-title>. <source>Comput. Electron. Agric.</source> <volume>150</volume>, <fpage>257</fpage>&#x2013;<lpage>265</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compag.2018.04.022</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Hassan</surname> <given-names>S. G.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Dissolved oxygen content interval prediction based on auto regression recurrent neural network</article-title>. <source>J. Ambient Intell. Human. Comput</source>. <volume>14</volume>, <page-range>7255&#x2013;7264</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s12652-021-03579-x</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jafari</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Rajaee</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Kisi</surname> <given-names>O.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Improved water quality prediction with hybrid wavelet-genetic programming model and shannon entropy</article-title>. <source>Natural Resour. Res.</source> <volume>29</volume>, <fpage>3819</fpage>&#x2013;<lpage>3840</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11053-020-09702-7</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Pei</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Xue</surname> <given-names>Y.</given-names>
</name>
<etal/>
</person-group>. (<year>2018</year>). <article-title>Text classification based on deep belief network and softmax regression</article-title>. <source>Neural Comput. Appl.</source> <volume>29</volume>, <fpage>61</fpage>&#x2013;<lpage>70</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s00521-016-2401-x</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khatami</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Khosravi</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Nguyen</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Lim</surname> <given-names>C. P.</given-names>
</name>
<name>
<surname>Nahavandi</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Medical image analysis using wavelet transform and deep belief networks</article-title>. <source>Expert Syst. Appl.</source> <volume>86</volume>, <fpage>190</fpage>&#x2013;<lpage>198</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2017.05.073</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kisi</surname> <given-names>O.</given-names>
</name>
<name>
<surname>Alizamir</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Docheshmeh Gorgij</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Dissolved oxygen prediction using a new ensemble method</article-title>. <source>Environ. Sci. pollut. Res.</source> <volume>27</volume>, <fpage>9589</fpage>&#x2013;<lpage>9603</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11356-019-07574-w</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kuremoto</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Kimura</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Kobayashi</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Obayashi</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Time series forecasting using a deep belief network with restricted boltzmann machines</article-title>. <source>Neurocomputing</source> <volume>137</volume>, <fpage>47</fpage>&#x2013;<lpage>56</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.neucom.2013.03.047</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Heidari</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Mirjalili</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Slime mould algorithm: a new method for stochastic optimization</article-title>. <source>Future Generat. Comput. Syst.</source> <volume>111</volume>, <fpage>300</fpage>&#x2013;<lpage>323</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.future.2020.03.055</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Zhu</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Yue</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A hybrid model for dissolved oxygen prediction in aquaculture based on multi-scale features</article-title>. <source>Inf. Process. Agric.</source> <volume>5</volume>, <fpage>11</fpage>&#x2013;<lpage>20</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.inpa.2017.11.002</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>An</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Jiao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>Q.</given-names>
</name>
</person-group> (<year>2022</year>b). <article-title>Lstm-tcn: dissolved oxygen prediction in aquaculture, based on combined model of long short-term memory network and temporal convolutional network</article-title>. <source>Environ. Sci. pollut. Res.</source> <volume>29</volume>, <fpage>39545</fpage>&#x2013;<lpage>39556</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11356-022-18914-8</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Lai</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>a). <article-title>A chaotic strategy-based quadratic opposition-based learning adaptive variable-speed whale optimization algorithm</article-title>. <source>Math. Comput. Simulation</source> <volume>193</volume>, <fpage>71</fpage>&#x2013;<lpage>99</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.matcom.2021.10.003</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Multi-scale prediction of water temperature using empirical mode decomposition with back-propagation neural networks</article-title>. <source>Comput. Electrical Eng.</source> <volume>49</volume>, <fpage>1</fpage>&#x2013;<lpage>8</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compeleceng.2015.10.003</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ma</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Hybrid decision tree-based machine learning models for short-term water quality prediction</article-title>. <source>Chemosphere</source> <volume>249</volume>, <fpage>126169</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.chemosphere.2020.126169</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mirjalili</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Lewis</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>The whale optimization algorithm</article-title>. <source>Adv. Eng. Software</source> <volume>95</volume>, <fpage>51</fpage>&#x2013;<lpage>67</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.advengsoft.2016.01.008</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Naruei</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Keynia</surname> <given-names>F.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Wild horse optimizer: a new meta-heuristic algorithm for solving engineering optimization problems</article-title>. <source>Eng. Comput</source>. <volume>38</volume>, <page-range>3025&#x2013;3056</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s00366-021-01438-z</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Niu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>W.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A hybrid stock price index forecasting model based on variational mode decomposition and lstm network</article-title>. <source>Appl. Intell.</source> <volume>50</volume>, <fpage>4296</fpage>&#x2013;<lpage>4309</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compag.2019</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Peraza-V&#xe1;zquez</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Pe&#xf1;a-Delgado</surname> <given-names>A. F.</given-names>
</name>
<name>
<surname>Echavarr&#xed;a-Castillo</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Morales-Cepeda</surname> <given-names>A. B.</given-names>
</name>
<name>
<surname>Velasco-&#xc1;lvarez</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Ruiz-Perez</surname> <given-names>F.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A bio-inspired method for engineering design optimization inspired by dingoes hunting strategies</article-title>. <source>Math. Problem. Eng.</source> <volume>2021</volume>, <fpage>9107547</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1155/2021/9107547</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pipelzadeh</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Mastouri</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Modeling of contaminant concentration using the classification-based model integrated with data preprocessing algorithms</article-title>. <source>J. Hydroinformat.</source> <volume>23</volume>, <fpage>639</fpage>&#x2013;<lpage>654</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.2166/hydro.2021.138</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rahnamayan</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Tizhoosh</surname> <given-names>H. R.</given-names>
</name>
<name>
<surname>Salama</surname> <given-names>M. M. A.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Opposition-based differential evolution</article-title>. <source>IEEE Trans. Evolution. Comput.</source> <volume>12</volume>, <fpage>64</fpage>&#x2013;<lpage>79</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TEVC.2007.894200</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rajaee</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Khani</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Ravansalar</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Artificial intelligence-based single and hybrid models for prediction of water quality in rivers: a review</article-title>. <source>Chemomet. Intelligent Lab. Syst.</source> <volume>200</volume>, <elocation-id>103978</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.chemolab.2020.103978</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rashedi</surname> <given-names>E.</given-names>
</name>
<name>
<surname>Nezamabadi-pour</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Saryazdi</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Gsa: a gravitational search algorithm</article-title>. <source>Inf. Sci.</source> <volume>179</volume>, <fpage>2232</fpage>&#x2013;<lpage>2248</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ins.2009.03.004</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ren</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>An</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Research of dissolved oxygen prediction in recirculating aquaculture systems based on deep belief network</article-title>. <source>Aquacul. Eng.</source> <volume>90</volume>, <elocation-id>102085</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.aquaeng.2020.102085</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ren</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A method for predicting dissolved oxygen in aquaculture water in an aquaponics system</article-title>. <source>Comput. Electron. Agric.</source> <volume>151</volume>, <fpage>384</fpage>&#x2013;<lpage>391</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compag.2018.06.013</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rozario</surname> <given-names>A. P. R.</given-names>
</name>
<name>
<surname>Devarajan</surname> <given-names>N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Monitoring the quality of water in shrimp ponds and forecasting of dissolved oxygen using fuzzy c means clustering based radial basis function neural networks</article-title>. <source>J. Ambient Intell. Human. Comput.</source> <volume>12</volume>, <fpage>4855</fpage>&#x2013;<lpage>4862</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s12652-020-01900-8</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shekhawat</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Saxena</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Development and applications of an intelligent crow search algorithm based on opposition based learning</article-title>. <source>ISA Trans.</source> <volume>99</volume>, <fpage>210</fpage>&#x2013;<lpage>230</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.isatra.2019.09.004</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ta</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Research on a dissolved oxygen prediction method for recirculating aquaculture systems based on a convolution neural network</article-title>. <source>Comput. Electron. Agric.</source> <volume>145</volume>, <fpage>302</fpage>&#x2013;<lpage>310</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compag.2017.12.037</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tiyasha</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Tung</surname> <given-names>T. M.</given-names>
</name>
<name>
<surname>Bhagat</surname> <given-names>S. K.</given-names>
</name>
<name>
<surname>Tan</surname> <given-names>M. L.</given-names>
</name>
<name>
<surname>Jawad</surname> <given-names>A. H.</given-names>
</name>
<name>
<surname>Mohtar</surname> <given-names>W. H. M. W.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>Functionalization of remote sensing and on-site data for simulating surface water dissolved oxygen: development of hybrid tree-based artificial intelligence models</article-title>. <source>Mar. pollut. Bull.</source> <volume>170</volume>, <elocation-id>112639</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.marpolbul.2021.112639</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tubishat</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Idris</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Shuib</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Abushariah</surname> <given-names>M. A.</given-names>
</name>
<name>
<surname>Mirjalili</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection</article-title>. <source>Expert Syst. Appl.</source> <volume>145</volume>, <elocation-id>113122</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2019.113122</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>G.-G.</given-names>
</name>
<name>
<surname>Deb</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Cui</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Monarch butterfly optimization</article-title>. <source>Neural Comput. Appl.</source> <volume>31</volume>, <fpage>1995</fpage>&#x2013;<lpage>2014</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s00521-015-1923-y</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Han</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Song</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Research on multi-modal autonomous diagnosis algorithm of covid-19 based on whale optimized support vector machine and improved d-s evidence fusion</article-title>. <source>Comput. Biol. Med.</source> <volume>150</volume>, <elocation-id>106181</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106181</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Jia</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Abualigah</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>R.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>A hybrid ssa and sma with mutation opposition-based learning for constrained engineering problems</article-title>. <source>Comput. Intell. Neurosci.</source> <volume>2021</volume>, <fpage>6379469</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1155/2021/6379469</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Willmott</surname> <given-names>C. J.</given-names>
</name>
<name>
<surname>Robeson</surname> <given-names>S. M.</given-names>
</name>
<name>
<surname>Matsuura</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>A refined index of model performance</article-title>. <source>Int. J. Climatol.</source> <volume>32</volume>, <fpage>2088</fpage>&#x2013;<lpage>2094</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1002/joc.2419</pub-id>
</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xuan</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Tian</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Liao</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Statistical comparison between sarima and ann&#x2019;s performance for surface water quality time series prediction</article-title>. <source>Environ. Sci. pollut. Res.</source> <volume>28</volume>, <fpage>33531</fpage>&#x2013;<lpage>33544</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11356-021-13086-3</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xue</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Shen</surname> <given-names>B.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A novel swarm intelligence optimization approach: sparrow search algorithm</article-title>. <source>Syst. Sci. Control Eng.</source> <volume>8</volume>, <fpage>22</fpage>&#x2013;<lpage>34</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1080/21642583.2019.1708830</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Heidari</surname> <given-names>A. A.</given-names>
</name>
<name>
<surname>Gandomi</surname> <given-names>A. H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Hunger games search: visions, conception, implementation, deep analysis, perspectives, and towards performance shifts</article-title>. <source>Expert Syst. Appl.</source> <volume>177</volume>, <elocation-id>114864</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.eswa.2021.114864</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Water quality prediction in sea cucumber farming based on a gru neural network optimized by an improved whale optimization algorithm</article-title>. <source>PeerJ Comput. Sci.</source> <volume>8</volume>, <fpage>1000</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.7717/peerj-cs.1000</pub-id>
</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jia</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.-G.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Duan</surname> <given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A temporal lasso regression model for the emergency forecasting of the suspended sediment concentrations in coastal oceans: accuracy and interpretability</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>100</volume>, <elocation-id>104206</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.engappai.2021.104206</pub-id>
</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.-G.</given-names>
</name>
<name>
<surname>Jeng</surname> <given-names>D.-S.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A physics-informed statistical learning framework for forecasting local suspended sediment concentrations in marine environment</article-title>. <source>Water Res.</source> <volume>218</volume>, <elocation-id>118518</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.watres.2022.118518</pub-id>
</citation>
</ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Atom search optimization and its application to solve a hydrogeologic parameter estimation problem</article-title>. <source>Knowledge-Based Syst.</source> <volume>163</volume>, <fpage>283</fpage>&#x2013;<lpage>304</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.knosys.2018.08.030</pub-id>
</citation>
</ref>
<ref id="B60">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zubaidi</surname> <given-names>S. L.</given-names>
</name>
<name>
<surname>Abdulkareem</surname> <given-names>I. H.</given-names>
</name>
<name>
<surname>Hashim</surname> <given-names>K. S.</given-names>
</name>
<name>
<surname>Al-Bugharbee</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ridha</surname> <given-names>H. M.</given-names>
</name>
<name>
<surname>Gharghan</surname> <given-names>S. K.</given-names>
</name>
<etal/>
</person-group>. (<year>2020</year>). <article-title>Hybridised artificial neural network model with slime mould algorithm: a novel methodology for prediction of urban stochastic water demand</article-title>. <source>Water</source> <volume>12</volume>, <fpage>2692</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/w12102692</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>