# Classification of Marine Mammals Using the Trained Multilayer Perceptron Neural Network with the Whale Algorithm Developed with the Fuzzy System

Authors: Ali Hosseini Nejad Takhti; Abbas Saffari; Diego Martín; Mohammad Khishe; Mokhtar Mohammadi
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

The existence of various sounds from different natural and unnatural sources in the deep sea has caused the classification and identification of marine mammals intending to identify different endangered species to become one of the topics of interest for researchers and activist fields. In this paper, first, an experimental data set was created using a designed scenario. The whale optimization algorithm (WOA) is then used to train the multilayer perceptron neural network (MLP-NN). However, due to the large size of the data, the algorithm has not determined a clear boundary between the exploration and extraction phases. Next, to support this shortcoming, the fuzzy inference is used as a new approach to developing and upgrading WOA called FWOA. Fuzzy inference by setting FWOA control parameters can well define the boundary between the two phases of exploration and extraction. To measure the performance of the designed categorizer, in addition to using it to categorize benchmark datasets, five benchmarking algorithms CVOA, WOA, ChOA, BWO, and PGO were also used for MLPNN training. The measured criteria are concurrency speed, ability to avoid local optimization, and the classification rate. The simulation results on the obtained data set showed that, respectively, the classification rate in MLPFWOA, MLP-CVOA, MLP-WOA, MLP-ChOA, MLP-BWO, and MLP-PGO classifiers is equal to 94.98, 92.80, 91.34, 90.24, 89.04, and 88.10. As a result, MLP-FWOA performed better than other algorithms.


---

## Body

## 1. Introduction

The deep oceans make up 95% of the oceans’ volume, which is the largest habitat on Earth[1]. Creatures are continually being explored in the depths of the ocean with new ways of life [2, 3]. Much research has been conducted in the depths of the ocean, but unfortunately, this research is not enough, and many hidden secrets in the ocean remain unknown [4].Various species of marine mammals, including whales and dolphins, live in the ocean. Underwater audio signal processing is the newest way to measure the presence, abundance, and migratory marine mammal patterns [5–7]. The use of human-based methods and intelligent methods is one method of recognizing whales and dolphins [8]. Initially, human operator-based methods were used to identify whales and dolphins. Its advantages include simplicity and ease of work. However, the main disadvantage is the dependence on the operator’s psychological state and inefficiency in environments where the signal-to-noise ratio is low [9].To eliminate these defects, automatic target recognition (ATR) based on soft calculations is used [10, 11]. Then, contour-based recognition was used for recognition of whales and dolphins due to its time complexity and low identification rate [12, 13, 14]. The next item from the subset of intelligent methods is the ATR method based on soft computing [15], which is wildly popular due to its versatility and parallel structure [16, 17].The MLP-NN neural network, due to its simple structure, high performance, and low computational complexity, has become a useful tool for automatically recognizing targets [18–20]. In the past, MLP-NN training used gradient-based methods and error propagation, but these algorithms had a low speed of convergence and were stuck in local minima [21–23].Therefore, this paper presents a new hybrid method of MLP-NN training using FWOA to classify marine mammals. The main contributions of this work are as follows:(i)
Practical test design to obtain a real data set from the sound produced by dolphins and whales(ii)
Classifier design using MLP-NN to classify dolphins and whales(iii)
MLP-NN training using the proposed FWOA hybrid technique(iv)
MLP-NN training using new metaheuristic algorithms (CVOA, ChOA, BWO, PGO) and WOA as benchmark algorithmsIn the following paragraphs, the paper is structured in such a manner that Section2 designs an experiment for data collection. Section 3 will cover how to extract a feature. Section 4 describes WOA and how to fuzzy. Section 5 will simulate and discuss it, and finally, Section 6 will conduct conclusions and recommendations.


### 1.1. Background and Related Work

MLP-NNs are a commonly used technology in the field of soft computing [11, 24]. These networks may be used to address nonlinear issues. Learning is a fundamental component of all neural networks and is classified as unsupervised and supervised learning. In most cases, back-propagation techniques or standard [25, 26] are also used as a supervised learning approach for MLP-NNs. Back-propagation is a gradient-based technique with limitations such as slower convergence, making it unsuitable for real world applications. The primary objective of the neural network learning mechanism is to discover the optimal weighted edge and bias combination that produces the fewest errors in network training and test samples [27, 28]. Nevertheless, the majority of MLP-NN faults will remain high for an extended period of time throughout the learning process, after which they will be reduced by the learning algorithm. This is particularly prevalent in mechanisms relying on gradients, such as back-propagation algorithms. In addition, the back-propagation algorithm’s convergence is highly dependent on the initial values of the learning rate and the magnitude of the motion. Incorrect values for these variables may potentially result in algorithm diverging. Numerous research works have been conducted to address this issue using the back-propagation algorithm [29], but there is not enough optimization that has occurred, and each solution has unintended consequences. We have seen an increase in the usage of meta-heuristic methods for neural network training in recent years. The following (Table 1) discusses many works on neural network training using different meta-heuristic techniques.Table 1
Some related studies.
PaperTypeApplicationTraining algorithmsYear[30]Feed-forward NNSonar image classificationGenetic algorithm (GA)1989[31]MLP NNMagnetic body detection in a magnetic fieldSimulated annealing (SA)1994[32]MLP NNPredicting the solubility of gases in polymersParticle swarm optimizer (PSO)2013[33]MLP NNParkinson’s disease diagnosisSocial-spider optimization (SSA)2014[34]ANNArtificial intelligenceRunge Kutta method2015[35]MLP NNXOR, heart, iris, balloon, and breast cancer datasetMoth-flame optimization (MFO)2016[36]MLP NNSonar dataset classificationGray wolf optimization (GWO)2016[37]Feed-forward NNSonar dataset classificationParticle swarm optimizer (PSO)2017[38]Algorithm improvement23 benchmark functions and solving infinite impulse response model identificationLévy flight trajectory-based WOA (LWOA)2017[39]MLP NNBig dataBiogeography-based optimization (BBO)2018[40]MLP NNUCI dataset (benchmark)Monarch butterfly optimization (MBO)2018[41]Algorithm improvementFive standard engineering optimization problemsLWOA2018[42]MLP NNSonar target classificationDragonfly optimization algorithm (DOA)2019[42]MLP NNSonar dataset classificationImproved whale2019[43]MLP NNClassification of EEG signalsPSOGSA2020[44]ANNPrediction of urban stochastic water demandSlime mould algorithm (SMA)2020[45]Algorithm improvementOptimize star sensor calibrationHybrid WOA-LM algorithm2020[46]Feed-forward NNCOVID19 detectionColony predation algorithm (CPA)2020[47]MLP NNXOR, balloon, Iris, breast cancer, and heartHarris hawks optimization (HHO)2020[48]Deep convolutional NNCOVID19 detectionSine-cosine (SCA)2021[49]ANNPredicting ground vibrationHunger games search optimization (HGS)2021[50]MLP NNSonar dataset classificationFuzzy grasshopper optimization algorithm (FGOA)2022GA and SA are likely to minimize local optimization but have a slower convergence rate. This is inefficient in real-time processing applications. Although PSO is quicker than evolutionary algorithms, it often cannot compensate for poor solution quality by increasing the number of iterations. PSOGSA is a fairly sophisticated algorithm, and its performance is insufficient for solving problems with a high dimension. BBO requires lengthy computations. Despite their minimal complexity and rapid convergence speed, GWO, SCA, and IWT fall victim to local optimization and so are not appropriate for applications requiring global optimization. The primary cause for being stuck in local optimizations is a mismatch between the exploration and extraction stages. Various methods are provided to solve problems such as getting stuck in local optimizations and slow convergence speed in WOA, including parameterization ɑ by the linear control strategy (LCS) and arcsine-based nonlinear control strategy (NCS-arcsine) to establish the right balance between exploration and extraction [51, 52]. LCS and NCS-arcsine strategies usually do not provide appropriate solutions when used for high-dimensional problems.On the other hand, the no free launch (NFL) theorem logically states that meta-heuristic algorithms do not have the same answer in dealing with different problems [29]. Due to the problems mentioned and considering the NFL theory in this article, a fuzzy whale algorithm called Fuzzy-WOA is introduced for the MLP-NN training problem to identify whales and dolphins.To investigate the performance of the FWOA, we design an underwater data accusation scenario, create an experimental dataset, and compare it to a well-known benchmark dataset (Watkins et al. 1992). To address the time-varying multipath and fluctuating channel effects, a unique two cepstrum liftering feature extraction technique is used.


## 1.1. Background and Related Work

MLP-NNs are a commonly used technology in the field of soft computing [11, 24]. These networks may be used to address nonlinear issues. Learning is a fundamental component of all neural networks and is classified as unsupervised and supervised learning. In most cases, back-propagation techniques or standard [25, 26] are also used as a supervised learning approach for MLP-NNs. Back-propagation is a gradient-based technique with limitations such as slower convergence, making it unsuitable for real world applications. The primary objective of the neural network learning mechanism is to discover the optimal weighted edge and bias combination that produces the fewest errors in network training and test samples [27, 28]. Nevertheless, the majority of MLP-NN faults will remain high for an extended period of time throughout the learning process, after which they will be reduced by the learning algorithm. This is particularly prevalent in mechanisms relying on gradients, such as back-propagation algorithms. In addition, the back-propagation algorithm’s convergence is highly dependent on the initial values of the learning rate and the magnitude of the motion. Incorrect values for these variables may potentially result in algorithm diverging. Numerous research works have been conducted to address this issue using the back-propagation algorithm [29], but there is not enough optimization that has occurred, and each solution has unintended consequences. We have seen an increase in the usage of meta-heuristic methods for neural network training in recent years. The following (Table 1) discusses many works on neural network training using different meta-heuristic techniques.Table 1
Some related studies.
PaperTypeApplicationTraining algorithmsYear[30]Feed-forward NNSonar image classificationGenetic algorithm (GA)1989[31]MLP NNMagnetic body detection in a magnetic fieldSimulated annealing (SA)1994[32]MLP NNPredicting the solubility of gases in polymersParticle swarm optimizer (PSO)2013[33]MLP NNParkinson’s disease diagnosisSocial-spider optimization (SSA)2014[34]ANNArtificial intelligenceRunge Kutta method2015[35]MLP NNXOR, heart, iris, balloon, and breast cancer datasetMoth-flame optimization (MFO)2016[36]MLP NNSonar dataset classificationGray wolf optimization (GWO)2016[37]Feed-forward NNSonar dataset classificationParticle swarm optimizer (PSO)2017[38]Algorithm improvement23 benchmark functions and solving infinite impulse response model identificationLévy flight trajectory-based WOA (LWOA)2017[39]MLP NNBig dataBiogeography-based optimization (BBO)2018[40]MLP NNUCI dataset (benchmark)Monarch butterfly optimization (MBO)2018[41]Algorithm improvementFive standard engineering optimization problemsLWOA2018[42]MLP NNSonar target classificationDragonfly optimization algorithm (DOA)2019[42]MLP NNSonar dataset classificationImproved whale2019[43]MLP NNClassification of EEG signalsPSOGSA2020[44]ANNPrediction of urban stochastic water demandSlime mould algorithm (SMA)2020[45]Algorithm improvementOptimize star sensor calibrationHybrid WOA-LM algorithm2020[46]Feed-forward NNCOVID19 detectionColony predation algorithm (CPA)2020[47]MLP NNXOR, balloon, Iris, breast cancer, and heartHarris hawks optimization (HHO)2020[48]Deep convolutional NNCOVID19 detectionSine-cosine (SCA)2021[49]ANNPredicting ground vibrationHunger games search optimization (HGS)2021[50]MLP NNSonar dataset classificationFuzzy grasshopper optimization algorithm (FGOA)2022GA and SA are likely to minimize local optimization but have a slower convergence rate. This is inefficient in real-time processing applications. Although PSO is quicker than evolutionary algorithms, it often cannot compensate for poor solution quality by increasing the number of iterations. PSOGSA is a fairly sophisticated algorithm, and its performance is insufficient for solving problems with a high dimension. BBO requires lengthy computations. Despite their minimal complexity and rapid convergence speed, GWO, SCA, and IWT fall victim to local optimization and so are not appropriate for applications requiring global optimization. The primary cause for being stuck in local optimizations is a mismatch between the exploration and extraction stages. Various methods are provided to solve problems such as getting stuck in local optimizations and slow convergence speed in WOA, including parameterization ɑ by the linear control strategy (LCS) and arcsine-based nonlinear control strategy (NCS-arcsine) to establish the right balance between exploration and extraction [51, 52]. LCS and NCS-arcsine strategies usually do not provide appropriate solutions when used for high-dimensional problems.On the other hand, the no free launch (NFL) theorem logically states that meta-heuristic algorithms do not have the same answer in dealing with different problems [29]. Due to the problems mentioned and considering the NFL theory in this article, a fuzzy whale algorithm called Fuzzy-WOA is introduced for the MLP-NN training problem to identify whales and dolphins.To investigate the performance of the FWOA, we design an underwater data accusation scenario, create an experimental dataset, and compare it to a well-known benchmark dataset (Watkins et al. 1992). To address the time-varying multipath and fluctuating channel effects, a unique two cepstrum liftering feature extraction technique is used.


## 2. The Experiment Design and Data Acquisition

As shown in Figure1, to obtain a real data set of sound produced by dolphins and whales from a research ship called the Persian Gulf Explorer and a Sonobuoy, a UDAQ_Lite data acquisition board and three hydrophones (Model B& k 8013) were obtained and were used with equal distance to increase the dynamic range. This test was performed in Bushehr port. The array’s length is selected based on the water depth, and Figure 2 shows the hydrophones’ location.Figure 1
Items needed to collect data sets in: (a) Persian gulf explorer. (b) Research sonobuoys. (c) Hydrophone model 8103 of B&K company. (d) UDAQ_Lite data collection board.
(a)(b)(c)(d)Figure 2
Test scenario and location of the hydrophones.The raw data included 170 samples of pantropical spotted dolphin (8 sightings), 180 samples of spinner dolphin (five sightings), 180 cases of striped dolphin (eight sightings), 105 cases of humpback whale (seven sightings), 95 samples of minke whale (five sightings), and 120 samples of the sperm whale (four sightings). The experiment was developed and performed in the manner shown in Figure2.


### 2.1. The Ambient Noise Reduction and Reverberation Suppression

For example, the sounds emitted by marine mammals (dolphins and whales) recorded by the hydrophone array are consideredx (t), y (t), z (t), and the original sound of dolphins and whales is considered s (t). The mathematical model of the output of hydrophones is in(1)xt=∫−∞tht−τsτ,yt=∫−∞tgt−τsτ,zt=∫−∞tqt−τsτ.In equation (1), the Environment Response Functions (ERF) are denoted by h (t), g (t), and q (t). ERFs are not known, and “tail” is considered uncorrelated [53], and naturally, the first frame of sound produced by marine mammals does not reach the hydrophone array at one time. Due to the sound pressure level (SPL) in the Hydrophone B&K 8103 and reference, which deals with the underwater audio standard, the recorded sounds must be preamplified by a factor of 106.The frequency domain SPL is then transformed using the Hamming window and fast Fourier transform (FFT). Following that, (2) reduces the frequency bandwidth to 1 Hz.(2)SPL1=SPLm−10logΔf.SPLm is the obtained SPL at each fundamental frequency center in dB; re 1μPa, SPL1 is the SPL reduced to 1 Hz bandwidth in dB; re 1 μPa, and Δf represents the bandwidth for each 1/3 Octave band filter. To reduce the square mean error (MSE) between ambient noise and marine mammal noise, a Wiener filter was utilized [54]. Following that, the results were computed using (3) to identify sounds with a low SNR, less than 3 dB, that should be eliminated from the database.(3)SPLv=10log10SPLT10−10SPLA10,where T, V, and A represent all the available signals, sound, and ambient sound, respectively. After that, the SPLs were recalculating at a standard measuring distance of 1 m as follows:(4)SPL=SPL1+20logr.Figure3 illustrates the block diagram for ambient noise reduction and reverberation suppression.Figure 3
The block diagram of the ambient noise reduction and reverberation suppression system.In the next part, the effect of reverberation must be removed. In this regard, the common phase is added to the band (reducing the phase change process using the delay between the cohesive parts or the initial sound is called the common phase) [55]. Therefore, a cross-correlation pass function by adjusting each frequency band’s gain eliminates noncorrelated signals and passes the correlated signals. Finally, the output signals from each frequency band are merged to form the estimated signal, i. e., S^. The basic design for removing reverberation is shown in Figure 4. Figure 5 illustrates typical representations of dolphin and whale sounds and melodies, as well as their spectra.Figure 4
The reverberation removal section’s block diagram.Figure 5
Typical sound presentations produced by dolphins and whales and their spectrogram. (a) Pantropical spotted dolphin. (b) Spinner dolphin. (c) Striped dolphin. (d) Humpback whale. (e) Minke whale. (f) Sperm whale.
(a)(b)(c)(d)(e)(f)


## 2.1. The Ambient Noise Reduction and Reverberation Suppression

For example, the sounds emitted by marine mammals (dolphins and whales) recorded by the hydrophone array are consideredx (t), y (t), z (t), and the original sound of dolphins and whales is considered s (t). The mathematical model of the output of hydrophones is in(1)xt=∫−∞tht−τsτ,yt=∫−∞tgt−τsτ,zt=∫−∞tqt−τsτ.In equation (1), the Environment Response Functions (ERF) are denoted by h (t), g (t), and q (t). ERFs are not known, and “tail” is considered uncorrelated [53], and naturally, the first frame of sound produced by marine mammals does not reach the hydrophone array at one time. Due to the sound pressure level (SPL) in the Hydrophone B&K 8103 and reference, which deals with the underwater audio standard, the recorded sounds must be preamplified by a factor of 106.The frequency domain SPL is then transformed using the Hamming window and fast Fourier transform (FFT). Following that, (2) reduces the frequency bandwidth to 1 Hz.(2)SPL1=SPLm−10logΔf.SPLm is the obtained SPL at each fundamental frequency center in dB; re 1μPa, SPL1 is the SPL reduced to 1 Hz bandwidth in dB; re 1 μPa, and Δf represents the bandwidth for each 1/3 Octave band filter. To reduce the square mean error (MSE) between ambient noise and marine mammal noise, a Wiener filter was utilized [54]. Following that, the results were computed using (3) to identify sounds with a low SNR, less than 3 dB, that should be eliminated from the database.(3)SPLv=10log10SPLT10−10SPLA10,where T, V, and A represent all the available signals, sound, and ambient sound, respectively. After that, the SPLs were recalculating at a standard measuring distance of 1 m as follows:(4)SPL=SPL1+20logr.Figure3 illustrates the block diagram for ambient noise reduction and reverberation suppression.Figure 3
The block diagram of the ambient noise reduction and reverberation suppression system.In the next part, the effect of reverberation must be removed. In this regard, the common phase is added to the band (reducing the phase change process using the delay between the cohesive parts or the initial sound is called the common phase) [55]. Therefore, a cross-correlation pass function by adjusting each frequency band’s gain eliminates noncorrelated signals and passes the correlated signals. Finally, the output signals from each frequency band are merged to form the estimated signal, i. e., S^. The basic design for removing reverberation is shown in Figure 4. Figure 5 illustrates typical representations of dolphin and whale sounds and melodies, as well as their spectra.Figure 4
The reverberation removal section’s block diagram.Figure 5
Typical sound presentations produced by dolphins and whales and their spectrogram. (a) Pantropical spotted dolphin. (b) Spinner dolphin. (c) Striped dolphin. (d) Humpback whale. (e) Minke whale. (f) Sperm whale.
(a)(b)(c)(d)(e)(f)


## 3. Average Cepstral Features and Cepstral Liftering Features

The effect of ambient noise and reverberation decreases after detecting the audio signal frames obtained in the preprocessing stage. In the next step, the detected signal frames enter the feature extraction stage. The sounds made by dolphins and whales emitted from a distance to the hydrophone experience changes in size, phase, and density. Due to the time-varying multipath phenomenon, fluctuating channels complicate the challenge of recognizing dolphins and whales. The cepstral factors combined with the cepstral liftering feature may considerably reduce the impacts of multipath, whilst the average cepstral coefficients can significantly minimize the time-varying effects of shallow underwater channels [56]. As a result, this section recommends the use of cepstral features, such as mean cepstral features and cepstral liftering features, in order to construct a suitable data set. Cepstrum indices of greater and lower values indicate that the channel response cepstrum and the original sound of dolphins and whale cepstrum are distinct. [57]. They are located in distinct regions of the liftering cepstrum. Therefore, by reducing time liftering, the quality of the features is increased. Following removing noise and reverberation, the frequency domain frames of SPLs (S (k)) are passed to the portion extracting cepstrum features. The following equation determines the cepstrum characteristics of the sound produced by dolphin and whale signals.(5)cn=∑l=1Mlog∑k=0N−1Sk2Hlkcosn/1−0.5π/M,where S(k) indicates the frequency domain frames of sounds generated by dolphins and whales, N signifies the number of discrete frequencies employed in the FFT, and Hl (k) denotes the transfer function of the Mel-scaled triangular filter with l = 0,1, ..., M. Ultimately, using the discrete cosine transform (DCT), the cepstral coefficients are converted to the time domain as c (n).As previously stated, the sound generated by dolphins and whales is obtained via a method called low-time liftering. Consequently, (6) is recommended to separate the sound that originated from the whole sound.(6)wen=1,0≤n≤Lc,0,Lc≤n≤N2.Lc indicates the liftering window’s length, which is typically 15 or 20. The ultimate features may be computed by multiplying the cepstrum c (n) by and using the logarithm and DFT functions as described in the following equations:(7)cen=wencn,(8)cLn=LogDFTcen.Finally, the feature vector would be represented using(9)xm=cL0,cL1,⋯,cLP−1T.The first 512-cepstrum points (out of 8192 points in one frame for a sampling rate of 8192 Hz, expect for zeroth indexcym0 are corresponded to 62.5 ms liftering coefficients and are windowed from the N indices, which is equivalent to one frame length to reduce the liftering coefficients to 32 features. Prior to averaging, the duration of subframes is five seconds. Ten prior frames compose 50 s average cepstral features throughout the averaging liftering technique, smoothing 10 frame results in the final average cepstral features. As a result, the average cepstral feature vector has 32 elements. The Xm vector would then be used as an input signal for an MLP-NN in the subsequent phase.To summarize, the number of inputs to a neural network equals P. The whole feature extraction step is shown in Figure6. To summarize, Figure 7 depicts the result of this step.Figure 6
The procedure of extracting cepstrum liftering features.Figure 7
The typical visualization produces sound cepstrum features (striped dolphin).


## 4. Design of an FWOA-MLPNN for Automatic Detection of Sound Produced by Marine Mammals

MLP-NN is the simplest and most widely used neural network [58, 59]. Important applications of MLP-NN include automatic target recognition systems. For this reason, this article uses MLP-NN as an identifier [60]. MLP-NN is amongst the most durable neural networks available and is often used to model systems with a high degree of nonlinearity. In addition, the MLP-NN is a feed-forward network able of doing more precise nonlinear fits. Despite what has been said, one of the challenges facing MLP-NN is always training and adjusting the edges’ bias and weight [61].The steps for using meta-heuristic algorithms to teach MLPNN are as follows: the first phase is to determine how to display the connection weights. The second phase involves evaluating the fitness function in order to determine the connection weights, which may be thought of as the mean square error (MSE) for recognition issues. The third step employs the evolutionary process to minimize the fitness function, that is represented by the MSE. Figure8 and equation (10) illustrate the technical design of the evolutionary technique for connection weight training.(10)V⟶=W⟶.θ⟶=W11.W12.⋯.Wih.b1.b2.⋯.bh.M11.M12.⋯.Mhm,where n represents the input nodes’ amount, Wij indicating the node’s connection weight to the jth node, θjdenotes the bias (threshold) of the jth hidden neuron.Figure 8
MLP-NN as a search agent for a meta-heuristic method.As noted before, the MSE is a frequently used criterion for assessing MLP-NNs, as the following equation demonstrates.(11)MSE=∑i=1moik−dik2,where m is the number of neurons in the MLP outputs, dik is the optimal output of the ith input unit in cases where kth training sample is utilized, and oik denotes the real output of the ith input unit in cases where the kth training sample is observed in the input. To be successful, the MLP must be tuned to a collection of training samples. As a result, MLP performance is calculated as follows:(12)E=∑k=1T∑i=1moik−dik2/T.T denotes the number of training samples,dik denotes the optimal output related to ith input when using kth the training sample, m denotes the number of outputs, and Oikindicates the input’s real output when using kth the training sample. Finally, the recognition system requires a meta-heuristic method to fine-tune the parameters indicated above. The next subsection proposes an instructor based on an improved whale optimization algorithm (WOA) with fuzzy logic called FWOA.


### 4.1. Fuzzy WOA

This section upgrades WOA using fuzzy inference. In this regard, in the first subsection, it will review WOA, and in the second subsection, it will describe the fuzzy method for upgrading WOA.


#### 4.1.1. Whale Optimization Algorithm

The WOA optimization algorithm was introduced in 2016, inspired by the way whales were hunted by Mirjalili and Lewis [62]. WOA starts with a set of random solutions. In each iteration, the search agents update their position by using three operators: encircling prey, bubble-net attack (extraction phase), and bait search (exploration phase). In encircling prey, whales detect prey and encircle it. The WOA assumes that the best solution right now is his prey. Once the optimal search agent is discovered, all other search agents will update their position to that of the optimal search agent. The following equations express this behavior:(13)D⟶=C⟶∙X∗⟶t−X⟶t,(14)X⟶t+1=X∗⟶t−A⟶∙D⟶,where t is the current iteration, A⟶ and C⟶ are the coefficient vectors, X∗⟶ is the place vector which is the best solution so far, and X⟶ is the place vector. It should be noted that in each iteration of the algorithm, if there is a better answer, X∗⟶ should be updated. The vectors A⟶ and C⟶ are obtained using the following equations:(15)A⟶=2α⟶∙r⟶−α⟶,(16)C⟶=2∙r⟶,where α⟶ decreases linearly from 2 to zero during repetitions and r⟶ is a random vector in the distance [0, 1]. During the bubble-net assault, the whale swims simultaneously around its victim and along a contraction circle in a spiral pattern. To describe this concurrent behavior, it is anticipated that the whale would adjust its location during optimization using either the contractile siege mechanism or the spiral model. (17) is the mathematical model for this phase.(17)X⟶t+1=X∗⟶t−A⟶∙D⟶,ifp<0.5,D⟶∙ebi∙cos2πl,ifp≥0.5,where D⟶ is derived from (8) and denotes the distance i between the whale and its prey (the best solution ever obtained). A constant b is used to define the logarithmic helix shape; l is a random number between −1 and +1. p is a random number between zero and one. Vector A is used with random values ​​between −1 and 1 to bring search agents closer to the reference whale. In the search for prey to update the search agent’s position, random agent selection is used instead of using the best search agent’s data. The mathematical model is in the form of the following equations:(18)D⟶=C⟶∙Xrand⟶∙X⟶,(19)X⟶t+1=Xrand⟶−A⟶∙D⟶.Xrand⟶ is the randomly chosen position vector (random whale) for the current population, and vector A⟶ is utilized with random values larger or smaller to one to drive the search agent away from the reference whale. Figure 9 shows the FWOA flowchart, and Figure 10 shows the pseudocode of the FWOA. In the next section, we will describe the proposed fuzzy system.Figure 9
Flowchart of the WOA.Figure 10
Pseudocode of the FWOA.


#### 4.1.2. Proposed Fuzzy System for Tuning Control Parameters

The proposed fuzzy model receives the normalized performance of each whale in the population (normalized fitness value) and the current values ​​of the parametersα⟶ and C⟶. The output also shows the amount of change using the symbols ∆α and ∆C. The NFV value for each whale is obtained as follows:(20)NFV=fitness−fitnessminfitnessmin−fitnessmax.The NFV value is in the range of [0. 1]. This paper’s optimization problem is of the minimization type, in which the fitness of each whale is obtained directly by the optimal amount of these functions. (21) and (22) update the parameters α⟶ and C⟶ for each whale which are as follows:(21)α⟶t+1=α⟶t+∆α,(22)C⟶t+1=C⟶t+∆C.The fuzzy system is responsible for updating the parametersα⟶ and C⟶ of each member of the population (whale) and the three inputs of this system are the current value of parameters α⟶ and C⟶, NFV. Initially, these values ​​are “fuzzification” by membership functions. Then, their membership value is obtained using μ. These values ​​apply to a set of rules and give the values ​​∆α and ∆C. After determining these values, the “defuzzification” process is performed to estimate the numerical values ​​∆α and ∆C. Finally, these values ​​are applied in (12) and (13) to update the parameters ​​∆α and ∆C. The fuzzy system used in this article is of the Mamdani type. Figure 11 shows the proposed fuzzy model and membership functions used to adjust the whale algorithm’s control parameters. The adjustment range for membership functions is obtained using the primary [62] of the WOA. Many experiments were performed for all types of membership functions, including trimf, trapmf, gbellmf, gaussmf, gauss2mf, sigmf, dsigmf, psigmf, pimf, smf, and zmf. Comparison of the results showed that trimf input and output membership functions are more suitable for using the data set obtained in Sections 2 and 3.Figure 11
A proposed fuzzy model for setting parametersα⟶ and C⟶.The semantic values ​​used in the membership functions of the input variablesα⟶ , C⟶, and NFV are low, medium, and high. The semantic values ​​used in the output variables ∆α and ∆C are NE (negative), ZE (zero), and PO (positive). The fuzzy rules used are presented in Table 2, and how to train MLP-NN using FWOA is shown in Figure 12.Table 2
Applied fuzzy rules.
If (NFV is low) and (α⟶ is low), then (∆α is ZE)If (NFV is low) and (α⟶ is medium), then (∆α is NE)If (NFV is low) and (α⟶ is high), then (∆α is NE)If (NFV is medium) and (α⟶ is low), then (∆α is PO)If (NFV is medium) and (α⟶ is medium), then (∆α is ZE)If (NFV is medium) and (α⟶ is high), then (∆α is NE)If (NFV is high) and (α⟶ is low), then (∆α is PO)If (NFV is high) and (α⟶ is medium), then (∆α is ZE)If (NFV is high) and (α⟶ is high), then (∆α is NE)If (NFV is low) and (C⟶ is low), then (∆C is PO)If (NFV is low) and (C⟶ is medium), then (∆C is PO)If (NFV is low) and (C⟶ is high), then (∆C is ZE)If (NFV is medium) and (C⟶ is low), then (∆C is PO)If (NFV is medium) and (C⟶ is medium), then (∆C is ZE)If (NFV is medium) and (C⟶ is high), then (∆C is NE)If (NFV is high) and (C⟶ is low), then (∆C is PO)If (NFV is high) and (C⟶ is medium), then (∆C is ZE)If (NFV is high) and (C⟶ is high), then (∆C is NE)Figure 12
How to train MLP-NN using FWOA.


## 4.1. Fuzzy WOA

This section upgrades WOA using fuzzy inference. In this regard, in the first subsection, it will review WOA, and in the second subsection, it will describe the fuzzy method for upgrading WOA.


### 4.1.1. Whale Optimization Algorithm

The WOA optimization algorithm was introduced in 2016, inspired by the way whales were hunted by Mirjalili and Lewis [62]. WOA starts with a set of random solutions. In each iteration, the search agents update their position by using three operators: encircling prey, bubble-net attack (extraction phase), and bait search (exploration phase). In encircling prey, whales detect prey and encircle it. The WOA assumes that the best solution right now is his prey. Once the optimal search agent is discovered, all other search agents will update their position to that of the optimal search agent. The following equations express this behavior:(13)D⟶=C⟶∙X∗⟶t−X⟶t,(14)X⟶t+1=X∗⟶t−A⟶∙D⟶,where t is the current iteration, A⟶ and C⟶ are the coefficient vectors, X∗⟶ is the place vector which is the best solution so far, and X⟶ is the place vector. It should be noted that in each iteration of the algorithm, if there is a better answer, X∗⟶ should be updated. The vectors A⟶ and C⟶ are obtained using the following equations:(15)A⟶=2α⟶∙r⟶−α⟶,(16)C⟶=2∙r⟶,where α⟶ decreases linearly from 2 to zero during repetitions and r⟶ is a random vector in the distance [0, 1]. During the bubble-net assault, the whale swims simultaneously around its victim and along a contraction circle in a spiral pattern. To describe this concurrent behavior, it is anticipated that the whale would adjust its location during optimization using either the contractile siege mechanism or the spiral model. (17) is the mathematical model for this phase.(17)X⟶t+1=X∗⟶t−A⟶∙D⟶,ifp<0.5,D⟶∙ebi∙cos2πl,ifp≥0.5,where D⟶ is derived from (8) and denotes the distance i between the whale and its prey (the best solution ever obtained). A constant b is used to define the logarithmic helix shape; l is a random number between −1 and +1. p is a random number between zero and one. Vector A is used with random values ​​between −1 and 1 to bring search agents closer to the reference whale. In the search for prey to update the search agent’s position, random agent selection is used instead of using the best search agent’s data. The mathematical model is in the form of the following equations:(18)D⟶=C⟶∙Xrand⟶∙X⟶,(19)X⟶t+1=Xrand⟶−A⟶∙D⟶.Xrand⟶ is the randomly chosen position vector (random whale) for the current population, and vector A⟶ is utilized with random values larger or smaller to one to drive the search agent away from the reference whale. Figure 9 shows the FWOA flowchart, and Figure 10 shows the pseudocode of the FWOA. In the next section, we will describe the proposed fuzzy system.Figure 9
Flowchart of the WOA.Figure 10
Pseudocode of the FWOA.


### 4.1.2. Proposed Fuzzy System for Tuning Control Parameters

The proposed fuzzy model receives the normalized performance of each whale in the population (normalized fitness value) and the current values ​​of the parametersα⟶ and C⟶. The output also shows the amount of change using the symbols ∆α and ∆C. The NFV value for each whale is obtained as follows:(20)NFV=fitness−fitnessminfitnessmin−fitnessmax.The NFV value is in the range of [0. 1]. This paper’s optimization problem is of the minimization type, in which the fitness of each whale is obtained directly by the optimal amount of these functions. (21) and (22) update the parameters α⟶ and C⟶ for each whale which are as follows:(21)α⟶t+1=α⟶t+∆α,(22)C⟶t+1=C⟶t+∆C.The fuzzy system is responsible for updating the parametersα⟶ and C⟶ of each member of the population (whale) and the three inputs of this system are the current value of parameters α⟶ and C⟶, NFV. Initially, these values ​​are “fuzzification” by membership functions. Then, their membership value is obtained using μ. These values ​​apply to a set of rules and give the values ​​∆α and ∆C. After determining these values, the “defuzzification” process is performed to estimate the numerical values ​​∆α and ∆C. Finally, these values ​​are applied in (12) and (13) to update the parameters ​​∆α and ∆C. The fuzzy system used in this article is of the Mamdani type. Figure 11 shows the proposed fuzzy model and membership functions used to adjust the whale algorithm’s control parameters. The adjustment range for membership functions is obtained using the primary [62] of the WOA. Many experiments were performed for all types of membership functions, including trimf, trapmf, gbellmf, gaussmf, gauss2mf, sigmf, dsigmf, psigmf, pimf, smf, and zmf. Comparison of the results showed that trimf input and output membership functions are more suitable for using the data set obtained in Sections 2 and 3.Figure 11
A proposed fuzzy model for setting parametersα⟶ and C⟶.The semantic values ​​used in the membership functions of the input variablesα⟶ , C⟶, and NFV are low, medium, and high. The semantic values ​​used in the output variables ∆α and ∆C are NE (negative), ZE (zero), and PO (positive). The fuzzy rules used are presented in Table 2, and how to train MLP-NN using FWOA is shown in Figure 12.Table 2
Applied fuzzy rules.
If (NFV is low) and (α⟶ is low), then (∆α is ZE)If (NFV is low) and (α⟶ is medium), then (∆α is NE)If (NFV is low) and (α⟶ is high), then (∆α is NE)If (NFV is medium) and (α⟶ is low), then (∆α is PO)If (NFV is medium) and (α⟶ is medium), then (∆α is ZE)If (NFV is medium) and (α⟶ is high), then (∆α is NE)If (NFV is high) and (α⟶ is low), then (∆α is PO)If (NFV is high) and (α⟶ is medium), then (∆α is ZE)If (NFV is high) and (α⟶ is high), then (∆α is NE)If (NFV is low) and (C⟶ is low), then (∆C is PO)If (NFV is low) and (C⟶ is medium), then (∆C is PO)If (NFV is low) and (C⟶ is high), then (∆C is ZE)If (NFV is medium) and (C⟶ is low), then (∆C is PO)If (NFV is medium) and (C⟶ is medium), then (∆C is ZE)If (NFV is medium) and (C⟶ is high), then (∆C is NE)If (NFV is high) and (C⟶ is low), then (∆C is PO)If (NFV is high) and (C⟶ is medium), then (∆C is ZE)If (NFV is high) and (C⟶ is high), then (∆C is NE)Figure 12
How to train MLP-NN using FWOA.


## 4.1.1. Whale Optimization Algorithm

The WOA optimization algorithm was introduced in 2016, inspired by the way whales were hunted by Mirjalili and Lewis [62]. WOA starts with a set of random solutions. In each iteration, the search agents update their position by using three operators: encircling prey, bubble-net attack (extraction phase), and bait search (exploration phase). In encircling prey, whales detect prey and encircle it. The WOA assumes that the best solution right now is his prey. Once the optimal search agent is discovered, all other search agents will update their position to that of the optimal search agent. The following equations express this behavior:(13)D⟶=C⟶∙X∗⟶t−X⟶t,(14)X⟶t+1=X∗⟶t−A⟶∙D⟶,where t is the current iteration, A⟶ and C⟶ are the coefficient vectors, X∗⟶ is the place vector which is the best solution so far, and X⟶ is the place vector. It should be noted that in each iteration of the algorithm, if there is a better answer, X∗⟶ should be updated. The vectors A⟶ and C⟶ are obtained using the following equations:(15)A⟶=2α⟶∙r⟶−α⟶,(16)C⟶=2∙r⟶,where α⟶ decreases linearly from 2 to zero during repetitions and r⟶ is a random vector in the distance [0, 1]. During the bubble-net assault, the whale swims simultaneously around its victim and along a contraction circle in a spiral pattern. To describe this concurrent behavior, it is anticipated that the whale would adjust its location during optimization using either the contractile siege mechanism or the spiral model. (17) is the mathematical model for this phase.(17)X⟶t+1=X∗⟶t−A⟶∙D⟶,ifp<0.5,D⟶∙ebi∙cos2πl,ifp≥0.5,where D⟶ is derived from (8) and denotes the distance i between the whale and its prey (the best solution ever obtained). A constant b is used to define the logarithmic helix shape; l is a random number between −1 and +1. p is a random number between zero and one. Vector A is used with random values ​​between −1 and 1 to bring search agents closer to the reference whale. In the search for prey to update the search agent’s position, random agent selection is used instead of using the best search agent’s data. The mathematical model is in the form of the following equations:(18)D⟶=C⟶∙Xrand⟶∙X⟶,(19)X⟶t+1=Xrand⟶−A⟶∙D⟶.Xrand⟶ is the randomly chosen position vector (random whale) for the current population, and vector A⟶ is utilized with random values larger or smaller to one to drive the search agent away from the reference whale. Figure 9 shows the FWOA flowchart, and Figure 10 shows the pseudocode of the FWOA. In the next section, we will describe the proposed fuzzy system.Figure 9
Flowchart of the WOA.Figure 10
Pseudocode of the FWOA.


## 4.1.2. Proposed Fuzzy System for Tuning Control Parameters

The proposed fuzzy model receives the normalized performance of each whale in the population (normalized fitness value) and the current values ​​of the parametersα⟶ and C⟶. The output also shows the amount of change using the symbols ∆α and ∆C. The NFV value for each whale is obtained as follows:(20)NFV=fitness−fitnessminfitnessmin−fitnessmax.The NFV value is in the range of [0. 1]. This paper’s optimization problem is of the minimization type, in which the fitness of each whale is obtained directly by the optimal amount of these functions. (21) and (22) update the parameters α⟶ and C⟶ for each whale which are as follows:(21)α⟶t+1=α⟶t+∆α,(22)C⟶t+1=C⟶t+∆C.The fuzzy system is responsible for updating the parametersα⟶ and C⟶ of each member of the population (whale) and the three inputs of this system are the current value of parameters α⟶ and C⟶, NFV. Initially, these values ​​are “fuzzification” by membership functions. Then, their membership value is obtained using μ. These values ​​apply to a set of rules and give the values ​​∆α and ∆C. After determining these values, the “defuzzification” process is performed to estimate the numerical values ​​∆α and ∆C. Finally, these values ​​are applied in (12) and (13) to update the parameters ​​∆α and ∆C. The fuzzy system used in this article is of the Mamdani type. Figure 11 shows the proposed fuzzy model and membership functions used to adjust the whale algorithm’s control parameters. The adjustment range for membership functions is obtained using the primary [62] of the WOA. Many experiments were performed for all types of membership functions, including trimf, trapmf, gbellmf, gaussmf, gauss2mf, sigmf, dsigmf, psigmf, pimf, smf, and zmf. Comparison of the results showed that trimf input and output membership functions are more suitable for using the data set obtained in Sections 2 and 3.Figure 11
A proposed fuzzy model for setting parametersα⟶ and C⟶.The semantic values ​​used in the membership functions of the input variablesα⟶ , C⟶, and NFV are low, medium, and high. The semantic values ​​used in the output variables ∆α and ∆C are NE (negative), ZE (zero), and PO (positive). The fuzzy rules used are presented in Table 2, and how to train MLP-NN using FWOA is shown in Figure 12.Table 2
Applied fuzzy rules.
If (NFV is low) and (α⟶ is low), then (∆α is ZE)If (NFV is low) and (α⟶ is medium), then (∆α is NE)If (NFV is low) and (α⟶ is high), then (∆α is NE)If (NFV is medium) and (α⟶ is low), then (∆α is PO)If (NFV is medium) and (α⟶ is medium), then (∆α is ZE)If (NFV is medium) and (α⟶ is high), then (∆α is NE)If (NFV is high) and (α⟶ is low), then (∆α is PO)If (NFV is high) and (α⟶ is medium), then (∆α is ZE)If (NFV is high) and (α⟶ is high), then (∆α is NE)If (NFV is low) and (C⟶ is low), then (∆C is PO)If (NFV is low) and (C⟶ is medium), then (∆C is PO)If (NFV is low) and (C⟶ is high), then (∆C is ZE)If (NFV is medium) and (C⟶ is low), then (∆C is PO)If (NFV is medium) and (C⟶ is medium), then (∆C is ZE)If (NFV is medium) and (C⟶ is high), then (∆C is NE)If (NFV is high) and (C⟶ is low), then (∆C is PO)If (NFV is high) and (C⟶ is medium), then (∆C is ZE)If (NFV is high) and (C⟶ is high), then (∆C is NE)Figure 12
How to train MLP-NN using FWOA.


## 5. Simulation Results and Discussion

The evaluation of the IEEE CEC-2017 benchmark functions is presented in this section, followed by a discussion of the results achieved for the classification of marine mammals.


### 5.1. Evaluation of IEEE CEC-2017 Benchmark Functions

The CEC-2017 benchmark functions and dimension size are shown in Table3. Table 6 shows the parameters selected in the algorithms used for the benchmark functions. In all algorithms, the maximum number of iterations is 100, and the population size is 180.Table 3
IEEE CEC-2017 benchmark test functions.
No.FunctionsDimfminf1Shifted and rotated bent cigar function30100f2Shifted and rotated sum of different power function30200f3Shifted and rotated Zakharov function30300f4Shifted and rotated Rosenbrock’s function30400f5Shifted and rotated Rastrigin’s function30500f6Shifted and rotated expanded Scaffer’s function30600f7Shifted and rotated Lunacek Bi_Rastrigin function30700f8Shifted and rotated noncontinuous Rastrigin’s function30800f9Shifted and rotated Lévy function30900f10Shifted and rotated Schwefel’s function301000f11Hybrid function 1 (N = 3)301100f12Hybrid function 2 (N = 3)301200f13Hybrid function 3 (N = 3)301300f14Hybrid function 4 (N = 4)301400f15Hybrid function 5 (N = 4)301500f16Hybrid function 6 (N = 4)301600f17Hybrid function 6 (N = 5)301700f18Hybrid function 6 (N = 5)301800f19Hybrid function 6 (N = 5)301900f20Hybrid function 6 (N = 6)302000f21Composition function 1 (N = 3)302100f22Composition function 2 (N = 3)302200f23Composition function 3 (N = 4)302300As shown in Table4, the FWOA algorithm has achieved more encouraging results compared to CVOA, WOA, ChOA, BWO, and PGO. From a more detailed comparison of WOA with its upgraded version with a fuzzy subsystem (FWOA), it can be seen that the improvement and upgrade of WOA have been successful.Table 4
AVG and STD deviation of the best optimal solution for 40 independent runs on IEEE CEC-2017 benchmark test functions.
FUNCAlgorithmCVOAWOAFWOAChOAPGOBWOf1AVG1.08E + 033.41E + 113.91E + 014.04E + 021.24E + 111.72E + 11STD4.48E + 046.06E + 083.41E + 024.34E + 022.38E + 102.83E + 08f2AVG3.01E + 036.51E + 083.20E + 029.81E + 046.76E + 086.15E + 08STD7.81E + 049.04E + 089.87E + 017.77E + 051.41E + 082.82E + 07f3AVG2.40E + 037.07E + 036.96E + 032.46E + 037.08E + 037.49E + 05STD1.21E + 038.96E + 029.55E + 047.71E + 025.26E + 041.32E + 03f4AVG4.79E + 011.47E + 035.13E + 035.43E + 011.70E + 041.62E + 04STD1.38E + 021.96E + 029.75E + 013.38E + 026.15E + 032.48E + 03f5AVG6.68E + 038.91E + 015.20E + 015.66E + 018.12E + 038.10E + 03STD2.68E + 021.30E + 021.80E + 001.10E + 022.83E + 022.36E + 02f6AVG6.38E + 036.78E + 036.01E + 016.01E + 016.78E + 036.55E + 03STD5.21E + 014.86E + 015.32E − 023.11E − 026.23E + 017.26E + 01f7AVG1.12E + 041.36E + 047.53E + 018.30E + 031.26E + 021.44E + 04STD7.55E + 023.86E + 029.37E + 012.63E + 007.17E + 026.71E + 02f8AVG9.31E + 031.13E + 048.80E + 018.71E + 011.05E + 041.12E + 04STD2.27E + 021.24E + 022.52E + 022.09E + 022.53E + 022.28E + 02f9AVG4.03E + 049.02E + 041.04E + 041.08E + 048.87E + 029.18E + 04STD8.67E + 011.26E + 023.21E + 032.31E + 011.02E + 042.14E + 04f10AVG4.66E + 048.43E + 022.13E + 042.01E + 027.48E + 048.35E + 02STD5.35E + 013.33E + 015.94E + 021.21E + 047.92E + 033.43E + 01f11AVG1.23E + 046.92E + 041.23E + 041.24E + 043.16E + 043.17E + 04STD2.87E + 021.71E + 011.55E + 036.34E + 021.12E + 045.68E + 03f12AVG1.31E + 076.21E + 086.26E + 025.68E + 031.34E + 081.28E + 05STD7.82E + 042.34E + 084.55E + 021.08E + 069.70E + 073.41E + 07f13AVG1.61E + 033.36E + 089.85E + 041.59E + 052.58E + 093.81E + 07STD1.13E + 031.52E + 089.45E + 021.66E + 062.04E + 071.35E + 07f14AVG4.64E + 041.65E + 052.73E + 032.49E + 061.25E + 082.22E + 04STD3.56E + 041.05E + 072.35E + 032.22E + 056.77E + 041.30E + 04f15AVG5.32E + 041.02E + 074.97E + 041.49E + 054.41E + 076.90E + 09STD4.33E + 049.34E + 064.60E + 042.10E + 034.11E + 053.08E + 08f16AVG2.85E + 026.03E + 042.44E + 042.41E + 023.71E + 043.66E + 04STD3.03E + 039.41E + 032.94E + 022.86E + 014.47E + 031.95E + 03f17AVG2.43E + 024.11E + 041.95E + 021.97E + 022.55E + 042.65E + 04STD2.76E + 011.03E + 029.28E + 021.39E + 032.53E + 031.15E + 03f18AVG1.35E + 071.27E + 061.01E + 071.01E + 076.55E + 054.47E + 05STD1.35E + 051.04E + 065.08E + 051.50E + 073.44E + 071.99E + 05f19AVG8.86E + 049.87E + 061.81E + 031.81E + 036.41E + 051.13E + 07STD6.38E + 049.43E + 066.26E + 041.42E + 053.01E + 074.85E + 06f20AVG2.63E + 042.78E + 042.26E + 022.26E + 022.75E + 022.77E + 04STD2.01E + 031.06E + 032.22E + 021.40E + 011.99E + 031.47E + 03f21AVG2.43E + 042.38E + 042.36E + 042.38E + 042.62E + 022.58E + 04STD2.52E + 026.12E + 025.14E + 033.33E + 023.87E + 021.68E + 02f22AVG5.53E + 023.95E + 044.31E + 024.31E + 028.76E + 024.91E + 05STD2.23E + 023.34E + 011.26E + 022.13E + 011.32E + 041.95E + 04f23AVG3.14E + 043.47E + 042.73E + 042.73E + 023.22E + 042.96E + 02STD7.76E + 022.33E + 011.44E + 032.61E + 028.91E + 022.72E + 02


### 5.2. Classification of Marine Mammals

In this section, to show the power and efficiency of MLP-FWOA, in addition to using the sounds obtained in Sections2 and 3, the reference dataset (Watkins et al. 1992) is also used. As already mentioned, To obtain the data set, the Xm vector is assumed to be an input for the MLP-WOA. The Xm dimension is 680 × 42, which indicates that there are 42 features and 680 samples in the data set. In addition, the benchmark dataset has a dimension of 410 × 42. In MLP-FWOA, the number of input nodes is equal to the number of features. The 10-fold cross-validation method is used to evaluate the models. Therefore, first, the data are divided into ten parts, and each time nine parts are used for training and another part for testing. Figure 13 shows the 10-fold cross-validation. The final classification rate for each classifier is calculated using the average of the ten classification rates obtained.Figure 13
The 10-fold cross-validation.To have a fair comparison between the algorithms, the condition of stopping 300 iterations is considered. There is no specific equation for obtaining the number of hidden layer neurons, so (23) is used to obtain [63].(23)H=2×N+1,where N indicates the total number of inputs and H indicates the total number of hidden nodes. Furthermore, the number of output neurons corresponds to the number of marine mammal classifications, namely six.For a comprehensive assessment of FWOA performance, this algorithm is compared with WOA [62], ChOA [64], PGO [65], CVOA [66], and BWO [67] benchmark algorithms.In all population base algorithms, population size is a hyper parameter that plays a direct role in the algorithm’s performance in the search space. For this reason, many experiments were performed with different population numbers, some of which are shown in Table5. The results showed that for the proposed model, a population of 180 is the most appropriate value. In other words, with an increasing population, in addition to no significant improvement in model performance, complexity increases, and processing time increases. Table 6 illustrates the fundamental parameters and major values of various benchmark methods. The classification rate to adjust the population size of different algorithms for the data set is obtained from parts 2 and 3.Table 5
Classification rate (CR%) to adjust the population size of different algorithms for the data set is obtained from parts 2 and 3.
AlgorithmWOAFWOAChOAPGOCVOABWOPopulation sizeCR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)6031.280.31435.670.24631.000.25422.140.37733.160.73327.420.4118037.980.37742.110.29935.113.00829.060.40838.93986.434.731.81910046.850.46159.613.11345.310.35535.020.48348.701.07543.042.16712059.980.52264.783.78556.210.47748.600.56761.581.30653.892.48314071.250.60875.000.40767.180.51963.750.65873.771.66866.823.15016082.650.82088.250.48581.990.68680.090.63384.351.76178.503.44518091.420.79194.970.53190.660.79488.620.71592.731.80989.154.17319092.021.08794.991.01091.100.81989.221.76492.982.06089.834.89020092.641.96495.001.97392.000.92191.453.23493.072.36490.135.789Table 6
The initial parameters and primary values of the benchmark algorithms.
AlgorithmParameterValueWOAaLinearly decreased from 2 to 0Population size180FWOAaTuning by fuzzy systemPopulation size180ChOAa[1, 1]fLinearly decreased from 2 to 0Population size180PGODR0.3DRS0.15EDR0.8Population size180CVOAP-die0.05P_isolation0.8P_superspreader0.1P_reinfection0.02Social_distancing8P_travel0.1Pandemic_duration30Population size180BWOPP0.6CR0.44PM0.4Population size180The classifiers’ performance is then tested for the classification rate, local minimum avoidance, and convergence speed. Each method is run 40 times, and the classification rate, mean, and standard deviation of the smallest error, the A20-index [68], and the p value are listed in Tables 7 and 8. The mean and standard deviation of the smallest error, the A20-index, and the p value all reflect how well the method avoids local optimization.Table 7
Results obtained from different algorithms for dataset reference [42].
AlgorithmMSE (AVE ± STD)p valuesA20 indexAUC (%)Classification rate %MLP-CVOA0.1089 ± 0.12850.045194.6892.1283MLP-WOA0.1156 ± 0.13011.8534e-31193.0990.6422MLP-FWOA0.1002 ± 0.11540.027197.7193.0150MLP-ChOA0.1383 ± 0.13892.1464e-61192.7189.9476MLP-PGO0.1694 ± 0.16523.0081e-77191.4888.1115MLP-BWO0.1495 ± 0.15432.9813e-43188.9789.1014Table 8
Results obtained from different algorithms for datasets obtained in parts 2 and 3.
AlgorithmMSE (AVE ± STD)p valuesA20 indexAUC (%)Classification rate %MLP-CVOA0.0857 ± 0.10210.009194.3292.8027MLP-WOA0.0908 ± 0.16220.042193.0591.3455MLP-FWOA0.0689 ± 0.10310.013195.8994.9801MLP-ChOA0.1090 ± 0.10761.0589e-34192.7690.2410MLP-PGO0.1596 ± 0.11673.0013e-11190.6688.1004MLP-BWO0.1194 ± 0.16222.9854e-64184.2589.0478Figure 14
Convergence diagram of different training algorithms for dataset reference [42].Figures14 and 16 show a comprehensive comparison of the convergence speed and syntax and the classifiers’ final error rate. Figures 15 and 17 show a receiver operating characteristic for datasets.Figure 15
Receiver operating characteristic for dataset reference [42].
(a)(b)Figure 16
Convergence diagram of different training algorithms for datasets obtained in parts 2 and 3.Figure 17
Receiver operating characteristic for datasets obtained in parts 2 and 3.
(a)(b)The simulation was conducted in MATLAB 2020a by using a personal computer with a 2.3 GHz processor and 5 GB RAM.As shown in Figures14 and 16., among the benchmark algorithms used for MLP training, FWOA has the highest convergence speed. PGO has the lowest convergence speed by adjusting control parameters by fuzzy inference, correctly detecting the boundary between the exploration and extraction phases. As shown in Tables 7 and 8, MLP-FWOA has the highest classification rate, and MLP-PGO has the lowest classification rate among the classifiers. The STD values, shown in Tables 7 and 8, indicate that the MLP-FWOA results rank first in the two datasets, confirming that the FWOA performs better than other standard training algorithms and demonstrates the FWOA’s ability to avoid getting caught up in local optimism. A p value of less than 0.05 indicates a significant difference between FWOA and other algorithms. According to Tables 7 and 8, a20-index is 1 for all predictive classifiers. It confirms that all models can provide good results for similar data as well.Adding a subsystem to a metaheuristic algorithm increases its complexity. However, a comparison of the convergence curves in Figures14 and 16 shows that the FWOA achieved the global optimum faster than the other algorithms used. Other algorithms were stuck in the local optimum if they converged. In particular, by comparing the WOA and FWOA in Figures 14 and 16, it can be seen that using an auxiliary (fuzzy system) subsystem is necessary to avoid getting caught up in the local optimum in the WOA. In general, using a fuzzy system to improve WOA increases complexity. However, the convergence curves and better performance of FWOA than other algorithms used show a reduction in computational cost. The reduced MSE of this method compared to other algorithms employed is more indicative that despite increased complexity, FWOA performance is improving.


## 5.1. Evaluation of IEEE CEC-2017 Benchmark Functions

The CEC-2017 benchmark functions and dimension size are shown in Table3. Table 6 shows the parameters selected in the algorithms used for the benchmark functions. In all algorithms, the maximum number of iterations is 100, and the population size is 180.Table 3
IEEE CEC-2017 benchmark test functions.
No.FunctionsDimfminf1Shifted and rotated bent cigar function30100f2Shifted and rotated sum of different power function30200f3Shifted and rotated Zakharov function30300f4Shifted and rotated Rosenbrock’s function30400f5Shifted and rotated Rastrigin’s function30500f6Shifted and rotated expanded Scaffer’s function30600f7Shifted and rotated Lunacek Bi_Rastrigin function30700f8Shifted and rotated noncontinuous Rastrigin’s function30800f9Shifted and rotated Lévy function30900f10Shifted and rotated Schwefel’s function301000f11Hybrid function 1 (N = 3)301100f12Hybrid function 2 (N = 3)301200f13Hybrid function 3 (N = 3)301300f14Hybrid function 4 (N = 4)301400f15Hybrid function 5 (N = 4)301500f16Hybrid function 6 (N = 4)301600f17Hybrid function 6 (N = 5)301700f18Hybrid function 6 (N = 5)301800f19Hybrid function 6 (N = 5)301900f20Hybrid function 6 (N = 6)302000f21Composition function 1 (N = 3)302100f22Composition function 2 (N = 3)302200f23Composition function 3 (N = 4)302300As shown in Table4, the FWOA algorithm has achieved more encouraging results compared to CVOA, WOA, ChOA, BWO, and PGO. From a more detailed comparison of WOA with its upgraded version with a fuzzy subsystem (FWOA), it can be seen that the improvement and upgrade of WOA have been successful.Table 4
AVG and STD deviation of the best optimal solution for 40 independent runs on IEEE CEC-2017 benchmark test functions.
FUNCAlgorithmCVOAWOAFWOAChOAPGOBWOf1AVG1.08E + 033.41E + 113.91E + 014.04E + 021.24E + 111.72E + 11STD4.48E + 046.06E + 083.41E + 024.34E + 022.38E + 102.83E + 08f2AVG3.01E + 036.51E + 083.20E + 029.81E + 046.76E + 086.15E + 08STD7.81E + 049.04E + 089.87E + 017.77E + 051.41E + 082.82E + 07f3AVG2.40E + 037.07E + 036.96E + 032.46E + 037.08E + 037.49E + 05STD1.21E + 038.96E + 029.55E + 047.71E + 025.26E + 041.32E + 03f4AVG4.79E + 011.47E + 035.13E + 035.43E + 011.70E + 041.62E + 04STD1.38E + 021.96E + 029.75E + 013.38E + 026.15E + 032.48E + 03f5AVG6.68E + 038.91E + 015.20E + 015.66E + 018.12E + 038.10E + 03STD2.68E + 021.30E + 021.80E + 001.10E + 022.83E + 022.36E + 02f6AVG6.38E + 036.78E + 036.01E + 016.01E + 016.78E + 036.55E + 03STD5.21E + 014.86E + 015.32E − 023.11E − 026.23E + 017.26E + 01f7AVG1.12E + 041.36E + 047.53E + 018.30E + 031.26E + 021.44E + 04STD7.55E + 023.86E + 029.37E + 012.63E + 007.17E + 026.71E + 02f8AVG9.31E + 031.13E + 048.80E + 018.71E + 011.05E + 041.12E + 04STD2.27E + 021.24E + 022.52E + 022.09E + 022.53E + 022.28E + 02f9AVG4.03E + 049.02E + 041.04E + 041.08E + 048.87E + 029.18E + 04STD8.67E + 011.26E + 023.21E + 032.31E + 011.02E + 042.14E + 04f10AVG4.66E + 048.43E + 022.13E + 042.01E + 027.48E + 048.35E + 02STD5.35E + 013.33E + 015.94E + 021.21E + 047.92E + 033.43E + 01f11AVG1.23E + 046.92E + 041.23E + 041.24E + 043.16E + 043.17E + 04STD2.87E + 021.71E + 011.55E + 036.34E + 021.12E + 045.68E + 03f12AVG1.31E + 076.21E + 086.26E + 025.68E + 031.34E + 081.28E + 05STD7.82E + 042.34E + 084.55E + 021.08E + 069.70E + 073.41E + 07f13AVG1.61E + 033.36E + 089.85E + 041.59E + 052.58E + 093.81E + 07STD1.13E + 031.52E + 089.45E + 021.66E + 062.04E + 071.35E + 07f14AVG4.64E + 041.65E + 052.73E + 032.49E + 061.25E + 082.22E + 04STD3.56E + 041.05E + 072.35E + 032.22E + 056.77E + 041.30E + 04f15AVG5.32E + 041.02E + 074.97E + 041.49E + 054.41E + 076.90E + 09STD4.33E + 049.34E + 064.60E + 042.10E + 034.11E + 053.08E + 08f16AVG2.85E + 026.03E + 042.44E + 042.41E + 023.71E + 043.66E + 04STD3.03E + 039.41E + 032.94E + 022.86E + 014.47E + 031.95E + 03f17AVG2.43E + 024.11E + 041.95E + 021.97E + 022.55E + 042.65E + 04STD2.76E + 011.03E + 029.28E + 021.39E + 032.53E + 031.15E + 03f18AVG1.35E + 071.27E + 061.01E + 071.01E + 076.55E + 054.47E + 05STD1.35E + 051.04E + 065.08E + 051.50E + 073.44E + 071.99E + 05f19AVG8.86E + 049.87E + 061.81E + 031.81E + 036.41E + 051.13E + 07STD6.38E + 049.43E + 066.26E + 041.42E + 053.01E + 074.85E + 06f20AVG2.63E + 042.78E + 042.26E + 022.26E + 022.75E + 022.77E + 04STD2.01E + 031.06E + 032.22E + 021.40E + 011.99E + 031.47E + 03f21AVG2.43E + 042.38E + 042.36E + 042.38E + 042.62E + 022.58E + 04STD2.52E + 026.12E + 025.14E + 033.33E + 023.87E + 021.68E + 02f22AVG5.53E + 023.95E + 044.31E + 024.31E + 028.76E + 024.91E + 05STD2.23E + 023.34E + 011.26E + 022.13E + 011.32E + 041.95E + 04f23AVG3.14E + 043.47E + 042.73E + 042.73E + 023.22E + 042.96E + 02STD7.76E + 022.33E + 011.44E + 032.61E + 028.91E + 022.72E + 02


## 5.2. Classification of Marine Mammals

In this section, to show the power and efficiency of MLP-FWOA, in addition to using the sounds obtained in Sections2 and 3, the reference dataset (Watkins et al. 1992) is also used. As already mentioned, To obtain the data set, the Xm vector is assumed to be an input for the MLP-WOA. The Xm dimension is 680 × 42, which indicates that there are 42 features and 680 samples in the data set. In addition, the benchmark dataset has a dimension of 410 × 42. In MLP-FWOA, the number of input nodes is equal to the number of features. The 10-fold cross-validation method is used to evaluate the models. Therefore, first, the data are divided into ten parts, and each time nine parts are used for training and another part for testing. Figure 13 shows the 10-fold cross-validation. The final classification rate for each classifier is calculated using the average of the ten classification rates obtained.Figure 13
The 10-fold cross-validation.To have a fair comparison between the algorithms, the condition of stopping 300 iterations is considered. There is no specific equation for obtaining the number of hidden layer neurons, so (23) is used to obtain [63].(23)H=2×N+1,where N indicates the total number of inputs and H indicates the total number of hidden nodes. Furthermore, the number of output neurons corresponds to the number of marine mammal classifications, namely six.For a comprehensive assessment of FWOA performance, this algorithm is compared with WOA [62], ChOA [64], PGO [65], CVOA [66], and BWO [67] benchmark algorithms.In all population base algorithms, population size is a hyper parameter that plays a direct role in the algorithm’s performance in the search space. For this reason, many experiments were performed with different population numbers, some of which are shown in Table5. The results showed that for the proposed model, a population of 180 is the most appropriate value. In other words, with an increasing population, in addition to no significant improvement in model performance, complexity increases, and processing time increases. Table 6 illustrates the fundamental parameters and major values of various benchmark methods. The classification rate to adjust the population size of different algorithms for the data set is obtained from parts 2 and 3.Table 5
Classification rate (CR%) to adjust the population size of different algorithms for the data set is obtained from parts 2 and 3.
AlgorithmWOAFWOAChOAPGOCVOABWOPopulation sizeCR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)CR%Time (s)6031.280.31435.670.24631.000.25422.140.37733.160.73327.420.4118037.980.37742.110.29935.113.00829.060.40838.93986.434.731.81910046.850.46159.613.11345.310.35535.020.48348.701.07543.042.16712059.980.52264.783.78556.210.47748.600.56761.581.30653.892.48314071.250.60875.000.40767.180.51963.750.65873.771.66866.823.15016082.650.82088.250.48581.990.68680.090.63384.351.76178.503.44518091.420.79194.970.53190.660.79488.620.71592.731.80989.154.17319092.021.08794.991.01091.100.81989.221.76492.982.06089.834.89020092.641.96495.001.97392.000.92191.453.23493.072.36490.135.789Table 6
The initial parameters and primary values of the benchmark algorithms.
AlgorithmParameterValueWOAaLinearly decreased from 2 to 0Population size180FWOAaTuning by fuzzy systemPopulation size180ChOAa[1, 1]fLinearly decreased from 2 to 0Population size180PGODR0.3DRS0.15EDR0.8Population size180CVOAP-die0.05P_isolation0.8P_superspreader0.1P_reinfection0.02Social_distancing8P_travel0.1Pandemic_duration30Population size180BWOPP0.6CR0.44PM0.4Population size180The classifiers’ performance is then tested for the classification rate, local minimum avoidance, and convergence speed. Each method is run 40 times, and the classification rate, mean, and standard deviation of the smallest error, the A20-index [68], and the p value are listed in Tables 7 and 8. The mean and standard deviation of the smallest error, the A20-index, and the p value all reflect how well the method avoids local optimization.Table 7
Results obtained from different algorithms for dataset reference [42].
AlgorithmMSE (AVE ± STD)p valuesA20 indexAUC (%)Classification rate %MLP-CVOA0.1089 ± 0.12850.045194.6892.1283MLP-WOA0.1156 ± 0.13011.8534e-31193.0990.6422MLP-FWOA0.1002 ± 0.11540.027197.7193.0150MLP-ChOA0.1383 ± 0.13892.1464e-61192.7189.9476MLP-PGO0.1694 ± 0.16523.0081e-77191.4888.1115MLP-BWO0.1495 ± 0.15432.9813e-43188.9789.1014Table 8
Results obtained from different algorithms for datasets obtained in parts 2 and 3.
AlgorithmMSE (AVE ± STD)p valuesA20 indexAUC (%)Classification rate %MLP-CVOA0.0857 ± 0.10210.009194.3292.8027MLP-WOA0.0908 ± 0.16220.042193.0591.3455MLP-FWOA0.0689 ± 0.10310.013195.8994.9801MLP-ChOA0.1090 ± 0.10761.0589e-34192.7690.2410MLP-PGO0.1596 ± 0.11673.0013e-11190.6688.1004MLP-BWO0.1194 ± 0.16222.9854e-64184.2589.0478Figure 14
Convergence diagram of different training algorithms for dataset reference [42].Figures14 and 16 show a comprehensive comparison of the convergence speed and syntax and the classifiers’ final error rate. Figures 15 and 17 show a receiver operating characteristic for datasets.Figure 15
Receiver operating characteristic for dataset reference [42].
(a)(b)Figure 16
Convergence diagram of different training algorithms for datasets obtained in parts 2 and 3.Figure 17
Receiver operating characteristic for datasets obtained in parts 2 and 3.
(a)(b)The simulation was conducted in MATLAB 2020a by using a personal computer with a 2.3 GHz processor and 5 GB RAM.As shown in Figures14 and 16., among the benchmark algorithms used for MLP training, FWOA has the highest convergence speed. PGO has the lowest convergence speed by adjusting control parameters by fuzzy inference, correctly detecting the boundary between the exploration and extraction phases. As shown in Tables 7 and 8, MLP-FWOA has the highest classification rate, and MLP-PGO has the lowest classification rate among the classifiers. The STD values, shown in Tables 7 and 8, indicate that the MLP-FWOA results rank first in the two datasets, confirming that the FWOA performs better than other standard training algorithms and demonstrates the FWOA’s ability to avoid getting caught up in local optimism. A p value of less than 0.05 indicates a significant difference between FWOA and other algorithms. According to Tables 7 and 8, a20-index is 1 for all predictive classifiers. It confirms that all models can provide good results for similar data as well.Adding a subsystem to a metaheuristic algorithm increases its complexity. However, a comparison of the convergence curves in Figures14 and 16 shows that the FWOA achieved the global optimum faster than the other algorithms used. Other algorithms were stuck in the local optimum if they converged. In particular, by comparing the WOA and FWOA in Figures 14 and 16, it can be seen that using an auxiliary (fuzzy system) subsystem is necessary to avoid getting caught up in the local optimum in the WOA. In general, using a fuzzy system to improve WOA increases complexity. However, the convergence curves and better performance of FWOA than other algorithms used show a reduction in computational cost. The reduced MSE of this method compared to other algorithms employed is more indicative that despite increased complexity, FWOA performance is improving.


## 6. Conclusions and Recommendations

In this paper, to classify marine mammals, a fuzzy model of control parameters of the whale optimization algorithm was designed to train an MLP-NN. CVOA, WOA, FWOA, Ch0A, PGO, and BWO algorithms have been used for the MLP-NN training stage. As the simulation results show, FWOA has a powerful performance in identifying the boundary between the exploration and extraction phases. For this reason, it can identify the global optimal and avoid local optimization. The results indicate that MLP-FWOA, MLP-CVOA, MLP-WOA, MLP-ChOA, MLPBWO, and MLP-PGO have better performance for classifying the sound produced by marine mammals. The convergence curve also shows that FWOA converges faster than the other five benchmark algorithms in convergence speed.Due to the complex environment of the sea and various unwanted signals such as reverberation, clutter, and types of noise in the seabed, lack of access to data sets with a specific signal-to-noise ratio is one of the main limitations of the research.For future research directions, we recommend the following list of topics:(i)
MLP-NN training using other metaheuristic algorithms for the classification of marine mammals(ii)
Using other artificial neural networks and using deep learning for the classification of marine mammals(iii)
Direct use of metaheuristic algorithms as classifiers for classification of marine mammals.



---

*Source: 3216400-2022-10-18.xml*