<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">40643</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.040643</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Intelligent Fish Behavior Classification Using Modified Invasive Weed Optimization with Ensemble Fusion Model</article-title>
<alt-title alt-title-type="left-running-head">Intelligent Fish Behavior Classification Using Modified Invasive Weed Optimization with Ensemble Fusion Model</alt-title>
<alt-title alt-title-type="right-running-head">Intelligent Fish Behavior Classification Using Modified Invasive Weed Optimization with Ensemble Fusion Model</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Keerthi Samhitha</surname><given-names>B.</given-names></name><email>samhithab711@gmail.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Subhashini</surname><given-names>R.</given-names></name></contrib>
<aff><institution>School of Computing, Sathyabama Institute of Science and Technology</institution>, <addr-line>Chennai, 600 119</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: B. Keerthi Samhitha. Email: <email>samhithab711@gmail.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>11</day><month>9</month><year>2023</year></pub-date>
<volume>37</volume>
<issue>3</issue>
<fpage>3125</fpage>
<lpage>3142</lpage>
<history>
<date date-type="received">
<day>26</day>
<month>3</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>5</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Keerthi Samhitha and Subhashini</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Keerthi Samhitha and Subhashini</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_40643.pdf"></self-uri>
<abstract>
<p>Accurate and rapid detection of fish behaviors is critical to perceive health and welfare by allowing farmers to make informed management decisions about recirculating the aquaculture system while decreasing labor. The classic detection approach involves placing sensors on the skin or body of the fish, which may interfere with typical behavior and welfare. The progress of deep learning and computer vision technologies opens up new opportunities to understand the biological basis of this behavior and precisely quantify behaviors that contribute to achieving accurate management in precision farming and higher production efficacy. This study develops an intelligent fish behavior classification using modified invasive weed optimization with an ensemble fusion (IFBC-MIWOEF) model. The presented IFBC-MIWOEF model focuses on identifying the distinct kinds of fish behavior classification. To accomplish this, the IFBC-MIWOEF model designs an ensemble of Deep Learning (DL) based fusion models such as VGG-19, DenseNet, and EfficientNet models for fish behavior classification. In addition, the hyperparameter tuning of the DL models is carried out using the MIWO algorithm, which is derived from the concepts of oppositional-based learning (OBL) and the IWO algorithm. Finally, the softmax (SM) layer at the end of the DL model categorizes the input into distinct fish behavior classes. The experimental validation of the IFBC-MIWOEF model is tested using fish videos, and the results are examined under distinct aspects. An Extensive comparative study pointed out the improved outcomes of the IFBC-MIWOEF model over recent approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Fish behavior</kwd>
<kwd>aquaculture</kwd>
<kwd>computer vision</kwd>
<kwd>deep learning</kwd>
<kwd>invasive weed optimization</kwd>
<kwd>fusion model</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The demand for aquatic products has significantly increased over the past 20 years due to the world population&#x2019;s fast growth [<xref ref-type="bibr" rid="ref-1">1</xref>]. Many countries&#x2019; principal source of fishery products has shifted to fish farming due to the rapidly increasing demand for aquatic goods. However, the lack of efficient fish health and management practices and welfare monitoring is causing this industry to suffer tremendous losses on a global scale [<xref ref-type="bibr" rid="ref-2">2</xref>]. Animals frequently engage in complex interactions with one another and with their environment. Tools that measure behavior automatically and simultaneously provide in-depth knowledge of the relationship between the external environment and behavior are required since it is possible to distinguish behavioral activities from video files [<xref ref-type="bibr" rid="ref-3">3</xref>]. In fish farming research, how the yield and efficiency can be improved turns out to be a significant problem, and this becomes a severe issue that should be sorted out that limits the growth of the aquaculture sector [<xref ref-type="bibr" rid="ref-4">4</xref>]. The premise for solving this issue is obtaining the fish&#x2019;s behavior analysis via the behavior trajectory, identifying the irregularities and rules to guide the breeding and thwart the occurrence of abnormal conditions [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>To proceed with the fish behavior analysis, the location and recognition become essential for the fish after examining the fish&#x2019;s behavior. Currently, the prevailing techniques for analysis and recognition are categorized into quantitative and qualitative methods [<xref ref-type="bibr" rid="ref-6">6</xref>]. Qualitative techniques have three types. Firstly, the complete manual approaches for analysis and recognition, like the manual marking technique or manual observation approach. Secondly, the fluorescent-related credit and manual analysis approach employed fluorescent markers to locate the fish and physically analyze the behavior [<xref ref-type="bibr" rid="ref-7">7</xref>]. Thirdly the video-related award and manual analysis approach. Thirdly, a feature was put into the fish&#x2019;s body, and the video was utilized for tracking the marker in the fish&#x2019;s body. This approach so far requires physical behavior analysis for fish [<xref ref-type="bibr" rid="ref-8">8</xref>]. The following two types of techniques were all invasive; thus, such techniques results in the stress behavior of fish, and the behavior analysis only is performed manually. These methods were laborious and time-consuming, and the behavior analysis outcomes were vulnerable to subjective elements. In addition, only the qualitative effects are acquired instead of the quantitative results, and the behavior trajectory may not be plotted.</p>
<p>To make a solution to the issue, the subjective elements can influence the manual analysis, and the quantitative outcomes may not be attained; the quantitative approaches were suggested for analyzing the fish behavior. The quantitative methods have two kinds. One is related to appearance features for recognizing the objects and obtaining the behavior trajectory, like infrared reflection and shape matching [<xref ref-type="bibr" rid="ref-9">9</xref>]. Another is related to image processing for identifying objects and obtaining the behavior trajectory, like the optical flow method and inter-frame difference technique. Introducing the Computer Vision (CV) approach in aquaculture has created new options for accurately and efficiently observing fish behavior. Conventional CV methods to identify fish behavior depend on deriving significant features, namely trajectory, motion patterns, and clustering index [<xref ref-type="bibr" rid="ref-10">10</xref>]. Deep learning (DL) techniques have revolutionized the ability to mechanically examine videos utilized for live fish identification, water quality monitoring, species classification, behavior analysis, and biomass estimation. The benefit of DL is it can mechanically learn to extract image features and exhibits remarkable performance in identifying sequential activities.</p>
<p>Deep learning algorithms have produced accurate target detection and tracking. However, it is still necessary to create strategies for recognizing fish behavior to consider the complex underwater environment and swift target movement. In reaction to environmental stimuli, fish typically alter their swimming technique. Due to the chance that two dissimilar kinds of activities in a video sequence display comparable activity, the success probability of recognition is lowered. For instance, both eating exercise and threatening behavior involve fish moving quickly after being aroused. An extensive range of various activity states is also included in one category of behavior. For instance, hypoxic fish are sinking on the tank&#x2019;s side and actively congregating there. Therefore, tiny alterations among dissimilar behavior categories and frequent samples of the similar action pose the biggest obstacles to implementing deep learning in fish behavior identification.</p>
<p>This study proposes an IFBC-MIWOEF model that uses temporal and spatial feature information to read a school of fish&#x2019;s behavior states from video data to overcome the abovementioned challenges. Our work has made the following main contributions: (1) An innovative method for detecting fish activity based on deep learning. (2) The proposed framework combines the RGB and optical flow image elements to identify the five fish behaviors. (3) The suggested framework exhibits good performance and acceptable outcomes. By automatically identifying fish behavior in real-time from video clips using our suggested method, we lay the framework for aquaculture to develop into a more intelligent industry.</p>
<p>This study develops an intelligent fish behavior classification using modified invasive weed optimization with an ensemble fusion (IFBC-MIWOEF) model. The IFBC-MIWOEF model&#x2019;s recognition and classification of various types of fish behavior is one of its main objectives. Primarily, the input videos are collected, and the frame conversion process takes place. The VGG-19, DenseNet, and EfficientNet models also employ a fusion-based feature extraction method. Additionally, the IWO algorithm and OBL concept are combined to create the MIWO algorithm, which is used to tune the hyperparameters of the DL models. Further, the input is divided into various fish behavior classes by the softmax (SM) layer after the DL model. Several simulations utilizing various measures were run to show the effectiveness of the IFBC-MIWOEF model.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>A thorough analysis of the models for categorizing fish behavior is provided in this section. Iqbal et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] provided an automatic mechanism for classifying and detecting fish. It is helpful for marine biologists to get a better understanding of their habitats and fish species. The presented method depends on Deep Convolutional Neural Networks (DCNN). It employs a minimized version of the AlexNet method and has two fully connected (FC) layers and four convolutional layers. A comparison was made with the other DL methodologies, namely AlexNet and VGGNet. Jalal et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] projected a hybrid method combining Gaussian mixture methods and optical flow with YOLO Deep Neural Networks (DNN) to locate and categorize fish in unrestricted underwater footage. The YOLO-related object detection mechanism was initially used to capture just the static and visible fish. And removes this restriction of YOLO, enabling it to detect freely moving fish, invisible in the background, utilizing temporary data obtained through optical flow and Gaussian mixture methods.</p>
<p>For automatic fish species categorization, Tamou et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] used transfer learning (TL) in conjunction with CNN AlexNet. The pre-trained AlexNet, either with or without finetuning, generates features from foreground fish photos of the existing underwater data set. Chhabra et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] suggested a fish classifier system that functions in a natural underwater atmosphere to detect fishes with nutritional or medicinal significance. The article used a hybrid DL method, whereas the Stacking ensemble method was employed for detecting and classifying fishes from images, and a pre-trained VGG16 technique was utilized for Feature Extraction. According to [<xref ref-type="bibr" rid="ref-15">15</xref>], machine vision is offered to assess fish appetite, and CNN automatically scores fish feeding intensity. Following were the specific implementation steps. First, photos taken throughout the feeding process have been collected, and a data set has been expanded using noise-invariant data expansion and rotation, scale, and translation (RST) augmentation methods. Afterward, a CNN was trained over the trained data set, and the fish appetite level could be graded using the trainable CNN method.</p>
<p>Farooq et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a novel method to identify unusual crowd behavior in surveillance footage. The main goal of this study is to identify crowd divergence behaviors that may result in dangerous scenarios like stampedes. We categorize crowd activity using a convolution neural network (CNN) trained on motion-shape images (MSIs), and we provide the potential for physically capturing motion in photographs. The finite-time Lyapunov exponent (FTLE) field is generated after the optical flow (OPF), which was initially determined, has been integrated. The coherent Lagrangian structure (LCS) represents crowd-dominant motion in the FTLE field. It is suggested to transform LCS-to-grayscale MSIs using ridge extraction. Not to mention that CNN has received supervised training to foresee divergence or typical behaviors for each unidentified image. Describe a deep-fusion model that utilizes the numerous convolutional layers of a deep neural network&#x2019;s hierarchical feature exits effectively and efficiently in [<xref ref-type="bibr" rid="ref-17">17</xref>]. We specifically recommend a network that combines multiscale data from the network&#x2019;s surface to deep layers to transform the input image into a density map. The final crowd size is calculated by adding the peaks on the density map. On the benchmark datasets UCF_CC_50, ShanghaiTech, and UCF-QNRF, experiments are conducted to evaluate the performance of the future deep network.</p>
<p>Alzahrani et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] proposed a framework for a deep model that automatically classifies crowd behavior based on motion and appearance. This study first extracts dense trajectories from the input video segment and then projects those trajectories onto the image plane to generate the trajectory image. The trajectory image effectively depicts the scene&#x2019;s relative motion. We employ a stack of trajectory images to teach a deep convolutional network a compact and potent representation of scene motion. Reference [<xref ref-type="bibr" rid="ref-19">19</xref>] proposed a technique for initializing a dynamical system described by optical flow, a high-level measure of overall movement, by superimposing a grid of particles over a scene. The dynamical scheme&#x2019;s time integration generates brief particle trajectories (tracks), which reflect dense but transient motion designs in scene fragments. Then, trackless are expanded into longer routes, clustered using an unsupervised clustering technique, and compared for similarity using the longest common subsequence.</p>
<p>Knausg&#x000E5;rd et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] published a two-step DL method to characterize temperate fishes without prefiltering. The primary stage is to identify every fish species, regardless of sex or species, that can be seen in the image. From now on, make use of the YOLO object detection technique. Each fish in the picture is classified in the second stage using a CNN without prefiltering and the Squeeze-and-Excitation (SE) structure. And uses Transfer Learning (TL) to progress the classifier&#x2019;s performance and get around the poorly trained samples of temperate fish. A new image-related technique for fish identification was suggested by Revanesh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] to drastically reduce the number of undersized fish caught during commercial trawling. The suggestion concerns the trawl&#x2019;s direct-located Deep Vision imaging mechanism&#x2019;s acquisition of stereo images and processing those data. The pre-processing of the photos correctly accounted for the camera responses&#x2019; non-linearity. Afterward, each fish in the pictures may be localized and segmented using a Mask Recurrent Convolutional Neural Networks (RCNN) framework.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Model</title>
<p>To identify and categorize various types of fish behavior, a novel IFBC-MIWOEF model has been established in this work. Primarily, the input videos are collected, and the frame conversion process takes place. Then, the fusion-based feature extraction process is carried out through three DL models, namely VGG-19, DenseNet, and EfficientNet. The performance of the DL algorithms can be improvised using the MIWO algorithm-based hyperparameter tuning process. The SM layer assigns the correct class labels to the input video frames at the very end. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> portrays the block diagram of the IFBC-MIWOEF method.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Block diagram of IFBC-MIWOEF method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Data Collection</title>
<p>A collection of behavior films of fish of various sizes, times, and quantities can be collected over three months to conduct the experiment in the best possible way and verify the proposed technique&#x2019;s effectiveness. Since fishes typically act in groups, every fish was photographed using the top camera [<xref ref-type="bibr" rid="ref-22">22</xref>]. The video is frequently downloaded into our computer from the memory card of network cameras and preserved there. In 24 h, several stages of fish behavior will be observed and recorded for the study. Other behaviors that are influenced by the environment, besides general behaviors like feeding, include fish startle stimulation, hypoxia, and hypothermia. They are categorized as hypothermia, eating, normal, hypoxic, and terrifying behaviors using expert experiences and talents.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Fusion Based Feature Extraction</title>
<p>The DL mechanisms are combined in the weighted voting-based ensemble approach, and the highest results are carefully selected using this method. Each vector is utilized for training the voting mechanism, and the fitness function (FF) is then used to determine the tenfold cross-validation accuracy. Consider the <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>D</mml:mi></mml:math></inline-formula> base classification models and <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>n</mml:mi></mml:math></inline-formula> number of classes for voting, the predictive class <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of weighted voting for each sample, <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>k</mml:mi></mml:math></inline-formula> is defined by</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mtext>arg max</mml:mtext></mml:mrow><mml:mi>j</mml:mi></mml:munder><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:mrow><mml:mtext>Ji</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>Now, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:mrow><mml:mtext>Ji</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> indicates the binary variable. After the <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>i</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> base classification technique categorizes the <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>k</mml:mi></mml:math></inline-formula> sample into the <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>j</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> classes, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:mrow><mml:mtext>Ji</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>; then, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:mrow><mml:mtext>Ji</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0.</mml:mn></mml:math></inline-formula> <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> signifies the weight of <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>i</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> based organization perfect.</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo>{</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mtext>is the true class of instance&#xA0;</mml:mtext></mml:mrow><mml:mi>k</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mtext>Size of test instances</mml:mtext></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>VGG-19 Model</title>
<p>Recently, many standard deep learning modules, like VGGNet, AlexNet, Inception, ResNet, Xception, DenseNet, and so on, have been utilized to detect plant disease. VGG network comprises multiple convolutional and pooling layers with various filter counts [<xref ref-type="bibr" rid="ref-23">23</xref>]. VGGNet consists of VGG16 and VGG19 modules. VGG16 has sixteen convolutional and pooling layers with the FC layer. VGG19 comprises nineteen convolutional and pooling layers with FC. The parameter count produced in the VGGNet is 140 million. The VGGNet is pre-trained on a larger dataset (ImageNet) with 1000 classes.</p>
<p>In this study, we employed shallow VGG module that takes nine layers of VGG19 that consist of 2 <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:math></inline-formula>-pooling and 7 convolution layers. Because there were fewer parameters, VGG stacked smaller filters together rather than using bigger ones. Instead of using massive filters, VGG uses smaller, deeper filters. It now has the same effective receptive field as if there were just one 7 &#x00D7; 7 convolutional layer. The input size applied in the presented model is <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mn>256</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>256</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> and afterward implementing the pooling and convolution operations the output size is <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mn>64</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>64</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>256</mml:mn></mml:math></inline-formula>. We used a global average pooling layer instead of an FC layer, which lowers the parameter count and dropout layer. The dropout layer is essential in reducing the network&#x2019;s over-fitting issues.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>DenseNet Model</title>
<p>DenseNet is a network with many connections. Dense Blocks and Transition Layers are the two components that make up this structure. All levels in this network are directly connected in a feed-forward fashion. Prior layers&#x2019; feature maps are inputs for each layer. ReLU activation, 3 3 Convolution, and Batch Normalisation comprise a Dense Block. Between every two Dense Blocks are transition layers. These include Average Pooling, Batch Normalisation, and 1&#x02212;1 Convolution. Each dense block&#x2019;s feature maps are the same size for concatenation.</p>
<p>DenseNet is CNN, where every layer in the network is interconnected with each successive layer in a feedforward manner [<xref ref-type="bibr" rid="ref-24">24</xref>]. The input layer is a concatenation of feature map of each preceding layer. Specifically, for a network with <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>L</mml:mi></mml:math></inline-formula> layer. For <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msup><mml:mi>l</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> layers in the network, it encompasses <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>l</mml:mi></mml:math></inline-formula> input that comprises of concatenation of each preceding layer feature map and passes the resulting feature maps to the succeeding <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>L</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> layer. Therefore, the network has an overall of <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle></mml:math></inline-formula> links among the layers. As a result, the network needs fewer limitations than traditional CNN because duplicate feature maps do not need to be re-learned. Densely connected patterns also minimize the effects of gradient vanishing issues in training deep architecture since every layer has direct access to the rise from the original input signal and the loss function, which enhances the flow of gradient and data over the network.</p>
<p>A DenseNet comprises <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>L</mml:mi></mml:math></inline-formula> layers in which every implement a nonlinear conversion <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> whereby <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>l</mml:mi></mml:math></inline-formula> indicates the index of layer, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represent a compound purpose of rectified linear unit (ReLU), a batch normalization (BN), and a convolution (Conv). The densely connected input of layer <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>l</mml:mi></mml:math></inline-formula> is formulated as follows.</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>x</mml:mi><mml:mi>l</mml:mi></mml:math></inline-formula> indicates the input of layer and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> refers to the concatenation of feature map from <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mn>0</mml:mn></mml:math></inline-formula> to <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> layer. Transition block (TB) and dense block (DB) are the study 2 major components of the network. A dense block comprises several dense layers (DL) whereby every dense layer comprises <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> convolutinal layers. Concerning the dense block, there exist transition block that comprises <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> convolutinal and <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> average pooling and normalization layers. The DenseNet design is implemented as DenseNetl21, which has 4 dense blocks, each of which has 6, 12, 24, and 16 dense layers.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>EfficientNet Model</title>
<p>The EfficientNet family&#x2019;s EfficientNetB0 baseline network is recommended to have the lowest memory requirements while having the most excellent accuracy and FLOPS requirements feasible [<xref ref-type="bibr" rid="ref-25">25</xref>&#x2013;<xref ref-type="bibr" rid="ref-27">27</xref>]. The network&#x2019;s width and depth (number of channels and layers) can be changed, or the picture resolution can be raised so that the network can learn fine-grained features from the image. However, as this method includes dimensioning gain as scaling rises, multiple manual adjustments should be made to obtain an optimal match for each model. The EfficientNet family has emerged as a solution to the problem using the compound scaling strategy that the researcher provided. The method usages a multiple constant to uniform scaling network resolution, depth, and width.</p>
<p><disp-formula id="ueqn-4">
<mml:math id="mml-ueqn-4" display="block"><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2248;</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, the network depth is signified by the period, the network width is signified as <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>w</mml:mi></mml:math></inline-formula>, and the resolution can be signified as <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>r</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>/are constant that is calculated by the smaller grid search. The researcher found the optimal values <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> to be <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mo>=</mml:mo></mml:math></inline-formula> 1.2, <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mo>=</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mn>1.1</mml:mn><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mn>1.15</mml:mn></mml:math></inline-formula> on fixed values of <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. In addition, the network structure makes use of somewhat large mobile inverted bottleneck convolution (MBConv).</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Hyperparameter Tuning</title>
<p>This study uses the MIWO technique to change the DL model hyperparameters in the best possible way. The IWO algorithm is a population-based optimization technique that finds a mathematical function by mimicking the randomness and compatibility of weed colonies [<xref ref-type="bibr" rid="ref-28">28</xref>&#x2013;<xref ref-type="bibr" rid="ref-30">30</xref>]. Weed is one of the powerful herbs that aggressive growth habit provides a significant risk to the crops. It proves to be adaptable and very resistant to changes in the environment. As a result, considering its features, an effective optimization technique is accomplished. This approach tries to imitate a weed community&#x2019;s randomness, resistance, and adaptability. This technique is based on the agricultural phenomenon named colonies of IWs. A plant is called a weed if it grows unintentionally in an area and obstructs human needs and activities, even though it may have other uses and benefits in some places. Mehrabian and Lucas 2006, developed a mathematical optimization algorithm inspired by the colonized weed named the &#x201C;Invasive Weed Optimization (IWO) Algorithm.&#x201D; Using essential weed colony characteristics, including growth, competition, and seeding, this method is efficient and straightforward in its convergence to the best solution [<xref ref-type="bibr" rid="ref-31">31</xref>&#x2013;<xref ref-type="bibr" rid="ref-33">33</xref>].</p>
<p>To imitate the habitat behaviors of weeds, some key characteristics of the procedure are given in the following:</p>
<p>Initial populace: A limited number of seeds are discrete in the search space.</p>
<p>Reproduction: Each seed grows into a flowering plant that then releases another source, depending on the fitness levels. The number of grains of grass linearly reduces from <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> in the following:</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>Spectral Spread: The seed generated by the group in the standard distribution with a standard deviation (SD) and mean planting location is generated using the following formula:</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>f</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>, the number of maximum iterations can be represented as <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>T</mml:mi></mml:math></inline-formula>, the current SD is denoted as <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the non-linear modulation index is signified by <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>n</mml:mi></mml:math></inline-formula>.</p>
<p>This guarantees that the fall of grain in the variety reduces non-linearly at every stage, which eliminates unfitting plants and results in more appropriate plants and presentations of the transfer mode from to selection of <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>K</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula> <xref ref-type="fig" rid="fig-2">Fig. 2</xref> demonstrates the flowchart of IWO.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flowcharts of IWO</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-2.tif"/>
</fig>
<p>Competitive deprivation: The herb population remains constant by removing the grass with the lowest fitness when the number of grasses in the colony reaches its maximum (Pmax). This process is done as often as necessary, and then the grass&#x2019;s most minor colony cost function is saved. The oppositional-based learning (OBL) notion is used to compute the MIWO algorithm [<xref ref-type="bibr" rid="ref-34">34</xref>&#x2013;<xref ref-type="bibr" rid="ref-36">36</xref>].</p>
<p>To improve the convergence speed and the possibility of defining the global optimum of the typical IWO technique [<xref ref-type="bibr" rid="ref-37">37</xref>&#x2013;<xref ref-type="bibr" rid="ref-39">39</xref>], this work presents an improved version of the proposed method named the MIWO approach. During the primary iteration of the technique [<xref ref-type="bibr" rid="ref-40">40</xref>&#x2013;<xref ref-type="bibr" rid="ref-42">42</xref>], afterward creating the immediate random solutions (that is, rats&#x2019; positions), the opposite places of all the answers are made dependent upon the model of the opposite number [<xref ref-type="bibr" rid="ref-43">43</xref>,<xref ref-type="bibr" rid="ref-44">44</xref>]. To describe the initialized novel population, it is necessary to determine the model of opposite numbers. Assume that <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>N</mml:mi></mml:math></inline-formula>-dimension vector <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>X</mml:mi></mml:math></inline-formula> is as follows:</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>whereas <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>. Afterward the opposite point of <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> that represented by <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula>, is expressed as:</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math></disp-formula></p>
<p>For applying the model of opposite numbers from the population initialized of AO technique, assume <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> that an arbitrarily created solution from <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>N</mml:mi></mml:math></inline-formula> dimension problems space (that is, candidate solution). To this arbitrary solution, their opposite is created utilizing <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref> and expressed by <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula>. Next, both solutions <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mo stretchy="false">(</mml:mo></mml:math></inline-formula>viz., <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are estimated by the objective function <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>f</mml:mi></mml:math></inline-formula>. Thus, if <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is superior to <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> (that is <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, the agent <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is exchanged by <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula>; else, it continues with <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. So, during the primary iteration, a primary solution and its opposite were estimated concurrently to continue with superior (fitter) beginning agents.</p>
<p>The MIWO system generates an FF to enhance classifier presentation. It resolves a positive integer to indicate the higher version of the applicant outcomes. This study assumed that FF was provided in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>, which would reduce the classification error rate.</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">R</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">b</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2217;</mml:mo><mml:mn>100</mml:mn></mml:math></disp-formula></p>
<fig id="fig-9">
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-9.tif"/>
</fig>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Softmax Classification</title>
<p>The feature extraction map is used to learn mappings between output classes and features that typically involve the FC layer and have each input from one layer connected with each activation unit of the succeeding layers. They are used in the network tail&#x2019;s classification function, where a layer with many neurons matching several output classes is used. In a multiclass classification problem, the <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">x</mml:mi></mml:mrow></mml:math></inline-formula> the function is applied to normalize the output into decimal values for the input probability. The class with maximum likelihood is represented as a target predictive class for the input. For organization problems with <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>K</mml:mi></mml:math></inline-formula> class, the <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mrow><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">M</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">x</mml:mi></mml:mrow></mml:math></inline-formula> purpose is arithmetically expressed as</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><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:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>, <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>i</mml:mi></mml:math></inline-formula> indicates several classes from one to <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>K</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> dimensional output, and <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> characterizes the probability of input as <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> class.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussion</title>
<p>Three publicly available datasets, VGG-19, EfficientNet, and DenseNet, are used in this study to assess and associate the performance of the proposed framework with other existing methodologies. Pytorch was used to create the recommended network, and an NVIDIA Titan Xp GPU was used to train it. CUDA Toolkit 10.2, Pytorch 1.4, Anaconda 3, and Ubuntu 16.04 (64-bit) were all used in the test setup.</p>
<p>The experimental validation of the IFBC-MIWOEF technique is examined through several simulations. The dataset is represented in <xref ref-type="table" rid="table-1">Table 1</xref> as 5000 samples with five class labels.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Details of the dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Class</th>
<th>No. of key frames</th>
</tr>
</thead>
<tbody>
<tr>
<td>Feeding (Fed)</td>
<td>1000</td>
</tr>
<tr>
<td>Hypoxia (Hyp)</td>
<td>1000</td>
</tr>
<tr>
<td>Hypothermia (Hypot)</td>
<td>1000</td>
</tr>
<tr>
<td>Frightening (Frg)</td>
<td>1000</td>
</tr>
<tr>
<td>Normal (Nor)</td>
<td>1000</td>
</tr>
<tr>
<td>Total number of key frames</td>
<td>5000</td>
</tr>
</tbody>
</table>
</table-wrap> 
<p>The confusion matrices for classifying fish behavior produced by the IFBC-MIWOEF model are shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The IFBC-MIWOEF approach identified 788 samples under the FED class, 734 samples under the HYP class, 758 samples under the HYPOT class, 770 examples under the FRG class, and 771 examples under the NOR class with 80% of the TR dataset. Additionally, the IFBC-MIWOEF approach identified 679 samples under the FED class, 663 samples under the HYP class, 657 samples under the HYPOT class, and 681 samples under the FRG class 691 examples under the NOR class with 70% of the TR data. The IFBC-MIWOEF approach has also classified 290 examples under the FED class, 292 models under the HYP class, 281 samples under the HYPOT class, 295 under the FRG class, and 276 examples under the NOR class using only 30% of the TS data.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Confusion matrices of IFBC-MIWOEF approach (a) 80% of TR data, (b) 20% of TS data, (c) 70% of TR data, and (d) 30% of TS data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-3a.tif"/><graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-3b.tif"/>
</fig>
<p>The consequences of the IFBC-MIWOEF model using 80% TR and 20% TS data are briefly presented in <xref ref-type="table" rid="table-2">Table 2</xref>. On 80% of the TR dataset, <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the general organization result of the IFBC-MIWOEF model. According to the figure, the IFBC-MIWOEF approach has shown improved outcomes across the board. For illustration, the IFBC-MIWOEF method has categorized examples under the FED class with <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.52%, <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.98%, <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.81%, <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.96%, and <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.39%. Meanwhile, the IFBC-MIWOEF technique has classified samples under HYP class with <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.65%, <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.57%, <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 92.44%, <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.94%, and <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 93.98%. Eventually, the IFBC-MIWOEF approach has classified samples under NOR class with <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.90%, <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.72%, <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.74%, <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.44%, and <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.23%.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Result analysis of IFBC-MIWOEF methodology with dissimilar class labels under 80:20 of TR and TS dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Labels</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>Specificity</th>
<th>F-score</th>
</tr>
</thead>
<tbody>
<tr>
<th align="center" colspan="6">Training phase (80%)</th>
</tr>
<tr>
<td>FED</td>
<td>98.52</td>
<td>95.98</td>
<td>96.81</td>
<td>98.96</td>
<td>96.39</td>
</tr>
<tr>
<td>HYP</td>
<td>97.65</td>
<td>95.57</td>
<td>92.44</td>
<td>98.94</td>
<td>93.98</td>
</tr>
<tr>
<td>HYPOT</td>
<td>97.88</td>
<td>93.46</td>
<td>95.95</td>
<td>98.35</td>
<td>94.69</td>
</tr>
<tr>
<td>FRG</td>
<td>98.10</td>
<td>94.94</td>
<td>95.65</td>
<td>98.72</td>
<td>95.30</td>
</tr>
<tr>
<td>NOR</td>
<td>98.90</td>
<td>97.72</td>
<td>96.74</td>
<td>99.44</td>
<td>97.23</td>
</tr>
<tr>
<td>Average</td>
<td>98.21</td>
<td>95.54</td>
<td>95.52</td>
<td>98.88</td>
<td>95.52</td>
</tr>
<tr>
<td align="center" colspan="6">Testing phase (20%)</td>
</tr>
<tr>
<td>FED</td>
<td>98.20</td>
<td>94.68</td>
<td>95.70</td>
<td>98.77</td>
<td>95.19</td>
</tr>
<tr>
<td>HYP</td>
<td>97.10</td>
<td>94.47</td>
<td>91.26</td>
<td>98.61</td>
<td>92.84</td>
</tr>
<tr>
<td>HYPOT</td>
<td>97.50</td>
<td>94.26</td>
<td>93.81</td>
<td>98.48</td>
<td>94.03</td>
</tr>
<tr>
<td>FRG</td>
<td>98.00</td>
<td>93.53</td>
<td>96.41</td>
<td>98.39</td>
<td>94.95</td>
</tr>
<tr>
<td>NOR</td>
<td>99.00</td>
<td>97.54</td>
<td>97.54</td>
<td>99.37</td>
<td>97.54</td>
</tr>
<tr>
<td>Average</td>
<td>97.96</td>
<td>94.90</td>
<td>94.94</td>
<td>98.72</td>
<td>94.91</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Result analysis of IFBC-MIWOEF method under 80% of TR data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-4.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> depicts the total organization consequences of the IFBC-MIWOEF technique on 20% of TS data. The figure indicates that the IFBC-MIWOEF technique has demonstrated improved outcomes under each class label. For example, the IFBC-MIWOEF method has classified samples under the FED class with <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.20%, <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.68%, <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.70%, <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.77%, and <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 95.19%. Meanwhile, the IFBC-MIWOEF method has classified samples under HYP class with <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.10%, <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.47%, <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 91.26%, <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.61%, and <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 92.84%. Eventually, the IFBC-MIWOEF model has classified samples under NOR class with <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99%, <inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.54%, <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.54%, <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.37%, and <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.54%.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Result analysis of IFBC-MIWOEF method under 20% of TS data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-5.tif"/>
</fig>
<p>A brief fish behavior categorization result using the IFBC-MIWOEF methodology under the 70% TR and 30% TS dataset is provided in <xref ref-type="table" rid="table-3">Table 3</xref>. The overall classification results of the IFBC-MIWOEF technique are shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref> using data from 70% of the TR dataset. According to the figure, the IFBC-MIWOEF technique has improved results for each class label. For example, the IFBC-MIWOEF technique has classified samples under the FED class with <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.91%, <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97%, <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.56%, <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.25%, and <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.28%. Meanwhile, the IFBC-MIWOEF technique has classified samples under HYP class with <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.31%, <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.37%, <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.12%, <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.11%, and <inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 95.74%. Eventually, the IFBC-MIWOEF organization has classified examples under NOR class with <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.60%, <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.24%, <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.91%, <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.03%, and <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.58%.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Result analysis of IFBC-MIWOEF method with distinct class labels under 70:30 of data</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Labels</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>Specificity</th>
<th>F-score</th>
</tr>
</thead>
<tbody>
<tr>
<th align="center" colspan="6">Training phase (70%)</th>
</tr>
<tr>
<td>FED</td>
<td>98.91</td>
<td>97.00</td>
<td>97.56</td>
<td>99.25</td>
<td>97.28</td>
</tr>
<tr>
<td>HYP</td>
<td>98.31</td>
<td>96.37</td>
<td>95.12</td>
<td>99.11</td>
<td>95.74</td>
</tr>
<tr>
<td>HYPOT</td>
<td>98.23</td>
<td>96.62</td>
<td>94.40</td>
<td>99.18</td>
<td>95.49</td>
</tr>
<tr>
<td>FRG</td>
<td>98.57</td>
<td>95.38</td>
<td>97.56</td>
<td>98.82</td>
<td>96.46</td>
</tr>
<tr>
<td>NOR</td>
<td>98.60</td>
<td>96.24</td>
<td>96.91</td>
<td>99.03</td>
<td>96.58</td>
</tr>
<tr>
<td>Average</td>
<td>98.53</td>
<td>96.32</td>
<td>96.31</td>
<td>99.08</td>
<td>96.31</td>
</tr>
<tr>
<td align="center" colspan="6">Testing phase (30%)</td>
</tr>
<tr>
<td>FED</td>
<td>98.40</td>
<td>96.67</td>
<td>95.39</td>
<td>99.16</td>
<td>96.03</td>
</tr>
<tr>
<td>HYP</td>
<td>98.13</td>
<td>94.50</td>
<td>96.37</td>
<td>98.58</td>
<td>95.42</td>
</tr>
<tr>
<td>HYPOT</td>
<td>97.87</td>
<td>96.90</td>
<td>92.43</td>
<td>99.25</td>
<td>94.61</td>
</tr>
<tr>
<td>FRG</td>
<td>98.27</td>
<td>93.95</td>
<td>97.68</td>
<td>98.41</td>
<td>95.78</td>
</tr>
<tr>
<td>NOR</td>
<td>98.53</td>
<td>96.17</td>
<td>96.17</td>
<td>99.09</td>
<td>96.17</td>
</tr>
<tr>
<td>Average</td>
<td>98.24</td>
<td>95.64</td>
<td>95.61</td>
<td>98.90</td>
<td>95.60</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Result analysis of IFBC-MIWOEF method under 70% of TR data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-6.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> demonstrates the total organization consequences of the IFBC-MIWOEF method on 30% of the TS dataset. The figure shows that the IFBC-MIWOEF method has demonstrated improved outcomes under each class label. For example, the IFBC-MIWOEF method has classified samples under the FED class with <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.40%, <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.67%, <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.39%, <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.16%, and <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.03%. Meanwhile, the IFBC-MIWOEF system has classified samples under HYP class with <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.13%, <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.50%, <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.37%, <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.58%, and <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 95.42%. Eventually, the IFBC-MIWOEF method has classified samples under NOR class with <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.53%, <inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.17%, <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.17%, <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.09%, and <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.17%.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Result analysis of IFBC-MIWOEF method under 30% of TS data</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-7.tif"/>
</fig>
<p><xref ref-type="table" rid="table-4">Table 4</xref> demonstrates the comparison study of the IFBC-MIWOEF model with other models. <xref ref-type="fig" rid="fig-8">Fig. 8</xref> reports a comparative review of the IFBC-MIWOEF with existing methodologies. The graph showed that the LeNet5 model performed poorly, with an <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of only 87.15%. Followed by, the Bi-LSTM, 3D-residual networks, CNN-LSTM, and GRU models have reported slightly improved <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 93.14%, 90.07%, 93.95%, and 92.67% correspondingly. Along with that, the fusion OFD-DL model has proficient reasonable <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 96.18%. However, the IFBC-MIWOEF model has shown maximum performance with <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.53%.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Comparative analysis of IFBC-MIWOEF approach with existing methodologies</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Accuracy</th>
<th>Computational time (sec)</th>
</tr>
</thead>
<tbody>
<tr>
<td>IFBC-MIWOEF</td>
<td>98.53</td>
<td>6.51</td>
</tr>
<tr>
<td>LeNet5</td>
<td>87.15</td>
<td>7.34</td>
</tr>
<tr>
<td>Bi-LSTM</td>
<td>93.14</td>
<td>11.90</td>
</tr>
<tr>
<td>3D residual networks</td>
<td>90.07</td>
<td>9.42</td>
</tr>
<tr>
<td>CNN-LSTM</td>
<td>93.95</td>
<td>7.58</td>
</tr>
<tr>
<td>GRU</td>
<td>92.67</td>
<td>7.46</td>
</tr>
<tr>
<td>Fusion OFD-DL</td>
<td>96.18</td>
<td>12.59</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-8">
<label>Figure 8</label>
<caption>
<title><inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of IFBC-MIWOEF approach with existing methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_40643-fig-8.tif"/>
</fig>
<p>The experimental results proved that the IFBC-MIWOEF model performed better than other models at recognising fish behaviour.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>To identify and categorize different forms of fish behavior, a novel IFBC-MIWOEF model was developed in this study. Primarily, the input videos are collected, and the frame conversion process takes place. Then, the fusion-based feature extraction process is carried out through three DL algorithms, namely VGG-19, DenseNet, and EfficientNet. The performance of the DL models can be improvised using the MIWO algorithm-based hyperparameter tuning process. Finally, the SM layer assigns the incoming video frames appropriate class labels. To demonstrate the efficacy of the IFBC-MIWOEF model, a series of imitations were performed using distinct processes. An Extensive comparative study pointed out the better outcomes of the IFBC-MIWOEF model over current methods. Thus, the presented IFBC-MIWOEF approach can be treated as a professional fish behavior recognition and classification tool.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The data used to support the findings of this study are available from the corresponding author upon request.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Application of machine learning in intelligent fish aquaculture: A review</article-title>,&#x201D; <source>Aquaculture</source>, vol. <volume>540</volume>, pp. <fpage>736724</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Xie</surname></string-name></person-group>, &#x201C;<article-title>Deep learning in aquaculture: A review</article-title>,&#x201D; <source>Journal of Computers</source>, vol. <volume>31</volume>, no. <issue>1</issue>, pp. <fpage>294</fpage>&#x2013;<lpage>319</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Fu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Aquatic toxic analysis by monitoring fish behavior using computer vision: A recent progress</article-title>,&#x201D; <source>Journal of Toxicology</source>, vol. <volume>2018</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Susmita</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Mohan</surname></string-name></person-group>, &#x201C;<article-title>Digital mammogram inferencing system using intuitionistic fuzzy theory</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>41</volume>, no. <issue>3</issue>, pp. <fpage>1099</fpage>&#x2013;<lpage>1115</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B. V.</given-names> <surname>Deep</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Dash</surname></string-name></person-group>, &#x201C;<article-title>Underwater fish species recognition using deep learning techniques</article-title>,&#x201D; in <conf-name>6th Int. Conf. on Signal Processing and Integrated Networks (SPIN)</conf-name>, <publisher-loc>Noida, India</publisher-loc>, pp. <fpage>665</fpage>&#x2013;<lpage>669</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Song</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Computer vision models in intelligent aquaculture with emphasis on fish detection and behavior analysis: A review</article-title>,&#x201D; <source>Archives of Computational Methods in Engineering</source>, vol. <volume>28</volume>, no. <issue>4</issue>, pp. <fpage>2785</fpage>&#x2013;<lpage>2816</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Xu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Matzner</surname></string-name></person-group>, &#x201C;<article-title>Underwater fish detection using deep learning for water power applications</article-title>,&#x201D; in <conf-name>Int. Conf. on Computational Science and Computational Intelligence (CSCI)</conf-name>, <publisher-loc>Las Vegas, NV, USA</publisher-loc>, pp. <fpage>313</fpage>&#x2013;<lpage>318</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Miao</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Du</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Automatic recognition methods of fish feeding behavior in aquaculture: A review</article-title>,&#x201D; <source>Aquaculture</source>, vol. <volume>528</volume>, pp. <fpage>735508</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Banan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Nasiri</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Taheri-Garavand</surname></string-name></person-group>, &#x201C;<article-title>Deep learning-based appear-ance features extraction for automated carp species identification</article-title>,&#x201D; <source>Aquacultural Engineering</source>, vol. <volume>89</volume>, pp. <fpage>102053</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Jaishankar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Pundir</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Patel</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Arulkumar</surname></string-name></person-group>, &#x201C;<article-title>Blockchain for securing healthcare data using squirrel search optimization algorithm</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>32</volume>, no. <issue>3</issue>, pp. <fpage>1815</fpage>&#x2013;<lpage>1829</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z. A.</given-names> <surname>Ali</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Riaz</surname></string-name></person-group>, &#x201C;<article-title>Automatic fish species classification using deep convolutional neural networks</article-title>,&#x201D; <source>Wireless Personal Communications</source>, vol. <volume>116</volume>, no. <issue>2</issue>, pp. <fpage>1043</fpage>&#x2013;<lpage>1053</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Jalal</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Salman</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mian</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Shafait</surname></string-name></person-group>, &#x201C;<article-title>Fish detection and species classification in underwater environments using deep learning with temporal information</article-title>,&#x201D; <source>Ecological Informatics</source>, vol. <volume>57</volume>, pp. <fpage>101088</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. B.</given-names> <surname>Tamou</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Benzinou</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Nasreddine</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Ballihi</surname></string-name></person-group>, &#x201C;<article-title>Underwater live fish recognition by deep learning</article-title>,&#x201D; in <conf-name>Int. Conf. on Image and Signal Processing</conf-name>, <publisher-loc>Cherbourg, France</publisher-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>275</fpage>&#x2013;<lpage>283</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H. S.</given-names> <surname>Chhabra</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Srivastava</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Nijhawan</surname></string-name></person-group>, &#x201C;<article-title>A hybrid deep learning ap-proach for automatic fish classification</article-title>,&#x201D; in <conf-name>Proc. of ICETIT 2019</conf-name>, <conf-loc>Institutional Area, Janakpuri New Delhi</conf-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>427</fpage>&#x2013;<lpage>436</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Sun</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Evaluation of fish feeding intensity in aquaculture using a convolutional neural network and machine vision</article-title>,&#x201D; <source>Aquaculture</source>, vol. <volume>507</volume>, pp. <fpage>457</fpage>&#x2013;<lpage>465</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. U.</given-names> <surname>Farooq</surname></string-name>, <string-name><given-names>M. N. M.</given-names> <surname>Saad</surname></string-name> and <string-name><given-names>S. D.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Motion-shape-based deep learning approach for divergence behavior detection in high-density crowd</article-title>,&#x201D; <source>Visual Computer</source>, vol. <volume>38</volume>, pp. <fpage>1553</fpage>&#x2013;<lpage>1577</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. D.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Salih</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Zafar</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Noorwali</surname></string-name></person-group>, &#x201C;<article-title>A deep-fusion network for crowd counting in high-density crowded scenes</article-title>,&#x201D; <source>International Journal Computer Intelligence System</source>, vol. <volume>14</volume>, pp. <fpage>168</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. J.</given-names> <surname>Alzahrani</surname></string-name> and <string-name><given-names>S. D.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Characterization of different crowd behaviors using novel deep learning framework</article-title>,&#x201D; <source>Turkish Journal of Electrical Engineering &#x0026; Computer Sciences</source>, vol. <volume>29</volume>, pp. <fpage>169</fpage>&#x2013;<lpage>185</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. D.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Bandini</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Basalamah</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Vizzari</surname></string-name></person-group>, &#x201C;<article-title>Analysing crowd behavior in naturalistic conditions: Identifying sources and sinks and characterizing main flows</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>177</volume>, no. <issue>5</issue>, pp. <fpage>543</fpage>&#x2013;<lpage>563</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. M.</given-names> <surname>Knausg&#x00E5;rd</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Wiklund</surname></string-name>, <string-name><given-names>T. K.</given-names> <surname>S&#x00F8;rdalen</surname></string-name>, <string-name><given-names>K. T.</given-names> <surname>Halvorsen</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Kleiven</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Temperate fish detection and classification: A deep learning-based approach</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>52</volume>, no. <issue>6</issue>, pp. <fpage>6988</fpage>&#x2013;<lpage>7001</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Revanesh</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Sridhar</surname></string-name> and <string-name><given-names>J. M.</given-names> <surname>Acken</surname></string-name></person-group>, &#x201C;<article-title>CB-ALCA: A cluster-based adaptive lightweight cryptographic algorithm for secure routing in wireless sensor networks</article-title>,&#x201D; <source>International Journal of Information and Computer Security</source>, vol. <volume>11</volume>, no. <issue>6</issue>, pp. <fpage>637</fpage>&#x2013;<lpage>662</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Muhammad</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Du</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Automatic recognition of fish behavior with a fusion of RGB and optical flow data based on deep learning</article-title>,&#x201D; <source>Animals</source>, vol. <volume>11</volume>, no. <issue>10</issue>, pp. <fpage>2774</fpage>, <year>2021</year>; <pub-id pub-id-type="pmid">34679796</pub-id></mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. R.</given-names> <surname>Hassan</surname></string-name>, <string-name><given-names>M. F.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>M. Z.</given-names> <surname>Uddin</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Ghoshal</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Hassan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Prostate cancer classification from ultrasound and MRI images using deep learning based Explainable Artificial Intelligence</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>127</volume>, pp. <fpage>462</fpage>&#x2013;<lpage>472</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Saravanakumar</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Priscilla</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Prabha</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kavitha</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Arun</surname></string-name></person-group>, &#x201C;<article-title>An efficient on-demand virtual machine migration in cloud using common de-ployment model</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>42</volume>, no. <issue>1</issue>, pp. <fpage>245</fpage>&#x2013;<lpage>256</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. R.</given-names> <surname>Bhukya</surname></string-name>, <string-name><given-names>B. M.</given-names> <surname>Hardas</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Ch</surname></string-name></person-group>, &#x201C;<article-title>An automated word embedding with parameter tuned model for web crawling</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>32</volume>, no. <issue>3</issue>, pp. <fpage>1617</fpage>&#x2013;<lpage>1632</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Pretty Diana Cyril</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Rene Beulah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Harshavardhan</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Sivabalaselvamani</surname></string-name></person-group>, &#x201C;<article-title>An automated learning model for sentiment analysis and data classification of Twitter data using balanced CA-SVM</article-title>,&#x201D; <source>Concurrent Engineering: Research and Applications</source>, vol. <volume>29</volume>, no. <issue>4</issue>, pp. <fpage>386</fpage>&#x2013;<lpage>395</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. V.</given-names> <surname>Rajaram</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Mohan</surname></string-name></person-group>, &#x201C;<article-title>Intelligent deep learning based bidirectional long short term memory model for automated reply of e-mail client prototype</article-title>,&#x201D; <source>Pattern Recognition Letters</source>, vol. <volume>152</volume>, no. <issue>10</issue>, pp. <fpage>340</fpage>&#x2013;<lpage>347</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Harshavardhan</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Velmurugan</surname></string-name></person-group>, &#x201C;<article-title>Chaotic salp swarm optimization-based energy-aware VMP technique for cloud data centers</article-title>,&#x201D; <source>Computational Intelligence and Neuroscience</source>, vol. <volume>2022</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Deepak Kumar</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Prasanthi</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Venkatesh</surname></string-name></person-group>, &#x201C;<article-title>An intelligent cognitive-inspired computing with big data analytics framework for sentiment analysis and classification</article-title>,&#x201D; <source>Information Processing &#x0026; Management</source>, vol. <volume>59</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. K.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Sah Tyagi</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Subramani</surname></string-name></person-group>, &#x201C;<article-title>Metaheuristic optimization-based resource allocation technique for cybertwin-driven 6G on IoE environment</article-title>,&#x201D; <source>IEEE Transactions on Industrial Informatics</source>, vol. <volume>18</volume>, no. <issue>7</issue>, pp. <fpage>4884</fpage>&#x2013;<lpage>4892</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. M.</given-names> <surname>Hardas</surname></string-name> and <string-name><given-names>S. B.</given-names> <surname>Pokle</surname></string-name></person-group>, &#x201C;<article-title>Optimization of peak to average power reduction in OFDM</article-title>,&#x201D; <source>Journal of Communications Technology and Electronics</source>, vol. <volume>62</volume>, pp. <fpage>1388</fpage>&#x2013;<lpage>1395</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Alotaibi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alghamdi</surname></string-name> and <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name></person-group>, &#x201C;<article-title>An efficient metaheuristic-based clustering with routing protocol for underwater wireless sensor networks</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>22</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Satish Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Jothilakshmi</surname></string-name>, <string-name><given-names>B. C.</given-names> <surname>James</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Arulkumar</surname></string-name></person-group>, &#x201C;<article-title>HHO-based vector quantization technique for biomedical image compression in cloud computing</article-title>,&#x201D; <source>International Journal of Image and Graphics</source>, vol. <volume>23</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. Y.</given-names> <surname>Sang</surname></string-name>, <string-name><given-names>Q. K.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>J. Q.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>Y. Y.</given-names> <surname>Han</surname></string-name></person-group>, &#x201C;<article-title>Effective invasive weed optimization algorithms for distributed assembly permutation flow shop problem with total flowtime criterion</article-title>,&#x201D; <source>Swarm and Evolutionary Computation</source>, vol. <volume>44</volume>, pp. <fpage>64</fpage>&#x2013;<lpage>73</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Alotaibi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alghamdi</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>U.</given-names> <surname>Sakthi</surname></string-name></person-group>, &#x201C;<article-title>Improved metaheuristics-based clustering with multihop routing protocol for underwater wireless sensor networks</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Paulraj</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Ezhumalai</surname></string-name></person-group>, &#x201C;<article-title>A deep learning modified neural network (DLMNN) based proficient sentiment analysis technique on twitter data</article-title>,&#x201D; <source>Journal of Experimental &#x0026; Theoretical Artificial Intelligence</source>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>. <pub-id pub-id-type="doi">10.1080/0952813X.2022.2093405</pub-id></mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. T.</given-names> <surname>Geetha</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Nanda</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Metwally</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Santhamoorthy</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Gupta</surname></string-name></person-group>, &#x201C;<article-title>Metaheuristics with deep transfer learning enabled detection and classification model for industrial waste management</article-title>,&#x201D; <source>Chemosphere</source>, vol. <volume>308</volume>, no. <issue>10</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Raghavendra</surname></string-name>, <string-name><given-names>B. T.</given-names> <surname>Geetha</surname></string-name>, <string-name><given-names>S. M. R.</given-names> <surname>Asha</surname></string-name> and <string-name><given-names>M. K.</given-names> <surname>Roberts</surname></string-name></person-group>, &#x201C;<article-title>Artificial humming bird with data science enabled stability prediction model for smart grids</article-title>,&#x201D; <source>Sustainable Computing: Informatics and Systems</source>, vol. <volume>36</volume>, no. <issue>9</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>17</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. K.</given-names> <surname>Jain</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Modeling of human action recognition using hyperparameter tuned deep learning model</article-title>,&#x201D; <source>Journal of Electronic Imaging</source>, vol. <volume>32</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Veerappampalayam</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Subramani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Subramanian</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Meckanzi</surname></string-name></person-group>, &#x201C;<article-title>Handcrafted deep-feature-based brain tumor detection and classification using MRI images</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>11</volume>, no. <issue>24</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Mardani</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Mishra</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Ezhumalai</surname></string-name></person-group>, &#x201C;<article-title>A fuzzy logic and DEEC protocol-based clustering routing method for wireless sensor networks</article-title>,&#x201D; <source>AIMS Mathematics</source>, vol. <volume>8</volume>, no. <issue>4</issue>, pp. <fpage>8310</fpage>&#x2013;<lpage>8331</lpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V. D.</given-names> <surname>Ambeth Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Malathi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Abhishek Kumar</surname></string-name> and <string-name><given-names>K. C.</given-names> <surname>Veluvolu</surname></string-name></person-group>, &#x201C;<article-title>Active volume control in smart phones based on user activity and ambient noise</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>20</volume>, no. <issue>15</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Ramalingam</surname></string-name></person-group>, &#x201C;<article-title>An efficient applications cloud interoperability framework using I-Anfis</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>13</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Chithambaramani</surname></string-name></person-group>, &#x201C;<article-title>Addressing semantics standards for cloud portability and interoperability in multi cloud environment</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>13</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back></article>