<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Enhancing Android Malware Detection in Internet of Vehicles using Self-Attention Transformer Model</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hassan A. Alterazi</string-name>
          <email>haalterazi@kau.edu.sa</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Technology Department, Faculty of Computing and Information Technology, King Abdulaziz University</institution>
          ,
          <addr-line>Jeddah 21589</addr-line>
          ,
          <country country="SA">Saudi Arabia</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The current trend for vehicles to be significantly correlated with vehicles, unspecified devices, and organization upsurges the latent for exterior attacks on vehicle's cyber-security. The main network security function is intrusion detection with open connectivity, like connected cars and self-driving. Particularly, when a vehicle is associated with an exterior device over a device in the vehicle or when it connects with an exterior structure, cybersecurity is mandatory to defend the network of software inside the vehicle. Present technique with this concern comprises intrusion detection and a vehicle gateway system. Conversely, it is challenging to block mischievous code based on behaviors of application. This study presents an Enhancing Android Malware Detection using Self-Attention Transformer Model (EAMD-SATM) model in Internet of Vehicles. The projected EAMD-SATM model categorizes and recognizes the Android malware efficiently and accurately. To attain this, the EAMDSATM approach endures a min-max approach utilizing data pre-processing at the initial stage. Furthermore, the EAMD-SATM method employs self-attention-based transformer (SA-T) technique for the detection of Android malware. To improve the SA-T technique solution, the EAMD-SATM technique applies the improved mother optimization (IMO) technique for the parameter tuning process. The simulation validation of the EAMD-SATM algorithm can be established on a benchmark Android malware dataset. The experimental outcomes highlighted the important performance of the EAMD-SATM approach in the Android malware recognition method.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent times Autonomous Vehicular System (AVS) should have spotted a huge development
in a varied range of characteristics through the improvement of smart cities to construct
Intelligent Transport System (ITS) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Including, the vivid usage of embedded schemes and
wireless communication viz., 5 G and 4 G LTE in recent vehicle internet that finally increases
users’ well-being and security [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Still, developing curiosity during the expansion of Connected
Autonomous Vehicle (CAV and ITS has presented unique security
tasks and susceptibilities in AVSs, which had a major influence on the smart surroundings for
smart cities [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. On the other hand, traditional computer security results aren't valid in
automated industrialized criteria for vehicle-to-vehicle (V2V) communication,
vehicle-toeverything (V2X) communication, and in-vehicle communications mostly due to the real-time
presentation requests, controlled computing resources, and dissimilarities between
heterogeneous networks and their installations [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Malware detection is the main task in ITSs
for several different applications and IoT devices are applied. Such as, self-driving vehicles are
more susceptible to hacking these are linked to the Internet and may obtain diverse commands
from mobile applications. Nevertheless, ancient cars don’t have this innovative feature [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Those hacks are life-threatening for travelers in the vehicle, some other persons in another
vehicle, and also, pedestrians. In real-time it is a tedious task to find out illegal activity [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
Though, several machine learning (ML) and deep learning (DL) methods have been applied to
detect this behavior. In addition, it presently provides “full self-driving” to proprietors of
personal vehicles and offers “self-driving mode” in its vehicles [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Therefore, this incident is a
notable landmark in AV improvement. Furthermore, as there a plentiful high-quality data sets
presented and there a similar severe performance necessities, the academic community helps
DL methods for ML-related responsibilities in Avs [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Meanwhile, Hinton released a unique
deep-structured learning architecture, a deep belief network (DBN), and important
developments were completed in DL. Present AVs trust intensely DL techniques for example
image classification (IC), semantic segmentation (SS), and object detection (OD) for its execution
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Traffic sign recognition (TSR) is a vital DL application in AVs. It utilizes the DL model to
classify the traffic sign image that is attained by the sensor camera after that employs the
intelligent control system for controlling the car under the classification outcomes [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>This study designs an Enhancing Android Malware Detection utilizing the Self-Attention
Transformer Model (EAMD-SATM) model in Internet of Vehicles. The projected EAMD-SATM
model categorizes and recognizes the Android malware efficiently and accurately. To attain
this, the EAMD-SATM approach endures a min-max approach utilizing data pre-processing at
the initial stage. Furthermore, the EAMD-SATM method employs self-attention-based
transformer (SA-T) technique for the detection of Android malware. To improve the solution of
the SA-T technique, the EAMD-SATM method applies the improved mother optimization (IMO)
technique for the hyperparameter tuning method. The simulation validation of the
EAMDSATM approach can be established on a benchmark Android malware dataset.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The Literature Review</title>
      <p>
        Ferrag et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] propose SecurityBERT, a new structure, which leverages the Bi-directional
Encoder Representation from Transformers (BERT) method. This method integrated a new
privacy-preserving encoding method named Privacy Preserving Fixed Length Encoding
(PPFLE). The technique effectually represents the network traffic data in a structural format by
uniting PPFLE with the Byte level Byte Pair Encoder (BBPE) Tokenizers. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the author
examines the innovative ML method applications, particularly in Bi-directional LSTM (BiLSTM)
and LSTM structures, enhanced by the word embedding methods. The study begins with a
systematic study of stringent data processing methods and basic ML principles, creating a
robust basis for sequential stages. The research initiates the refinement and formation of a
specific DL method that is elaborately intended for the precise recognition of hidden malware
in execution files. Islam et al. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] present accurate, practical, and robust systems to recognize
medical plants from smartphone seized plant imageries in the plant sites. The presented method
used a cascade structure to mine the features by utilizing a pre-trained ResNet50 method that
is enhanced by utilizing a Particle Swarm Optimizer (PSO) to identify the plants.
      </p>
      <p>
        Ullah et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] introduce a new network IDS for VANET that levers Spark-based big data
optimizer and transfer learning (NIDS-VSB). At initial, a packet parser is utilized to crawl the
filter required flow event and network traffic. Then, a Spark-based optimizer technique is
executed to process the huge quantities of data effectively. Additionally, a transfer learning
method is created to study extensive feature representation by utilizing their semantic anchor.
Then, a stack generality ensemble method utilizes deep feature to identify many assaults. Liu et
al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] propose MalIRL to design a model-free inverse reinforcement learning (IRL) method.
Especially, MalIRL examines 6 representative group activities of malware and uses sliding
windows to essentially separate the large malware implementation event streams into many
attacks’ phases, attaining a lower state and action spaces. To perfect dynamic malicious
atmospheres, MalIRL presents a prompt dynamic heterogeneous graph represented by learning
methods.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The Proposed Model</title>
      <p>This study proposes an EAMD-SATM model. The presented EAMD-SATM model categorizes
and recognizes the Android malware efficiently and accurately. To attain this, the EAMD-SATM
approach comprises min-max-based data preprocessing, SA-T-based Android malware
detection, and IMO-based hyperparameter tuning processes. Fig. 1 illustrates the workflow of
the EAMD-SATM model.</p>
      <sec id="sec-3-1">
        <title>Data Preprocessing</title>
        <p>
          The presented EAMD-SATM method utilizes the min-max approach for the data pre-processing
process [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. The min-max normalization is influential in data pre-processing for Android
malware recognition, certifying that values of a feature are adapted to a constant range among
0 and 1. By converting data in this method, min-max normalization allows for impartial
comparison and effectual training of machine learning (ML) methods, allowing precise
classification of malicious behaviors and patterns within Android applications. This
standardized method improves the abilities of detection, making the network more robust
against developing malware attacks in the IoV context.
3.2.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Classification Process</title>
        <p>
          The SA-T technique is employed for the classification process of the proposed model [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. These
methods are signified by an input feature sequence that is employed to encrypt every case in
the database. In this research paper, we contain  = [!, ", … , #], signify the sequence of
input features, whereas  represents the length of sequence. The self‐attention method
identifies the relationship among numerous features in the series and provides a weight
depending on how significant it is for other attributes. To take numerous kinds of relations and
enhance the efficiency of the model, numerous equivalent layers of self-attention are employed.
The outputs are served into feed‐forward neural networks for recognizing the non‐linear
relations and deliver last forecasts, This attention‐based method structure with multi‐head
attention and self‐attention methods effectively attains dependencies and connections within
the series of inputs. Fig. 2 represents the structure of the transformer method.
        </p>
        <p>In the self‐attention-based transformer method, location encoding and input embedding are
dual vital methods. The series of inputs is signified by utilizing these phases, which is suitable
for the following self‐attention layer. The numerical features and definite variables of every
case are decoded to constant vector representation over input embeddings. While, ($)
signifies the embedding of the case ($) and ($) epitomizes the measured mathematical
features of ($). The concatenated input embedding ($) is calculated as: $% = [($), ($)].
The method understands the series of instances by utilizing location encoded that inserts
position data to the sequence of input. The self‐attention‐based transformer method effectively
handles the series of inputs, gathering both positional information and feature representation
by implementing location encoding and input embedding phases.</p>
        <p>Transformer Encoder: A sequence of embedded features and positional encoding. To detect
relationships and obtain significant representation from the series of inputs, use a load of the
Transformer encoder layer. It is calculated as, () = [!(), "(), … , #()], whereas every
() signifies the representation of output for the equivalent location in the series.</p>
        <p>Self‐Attention: The Transformer method's ability to discover links among features, which
go away from adjacency of sequence is a new stimulating characteristic of this method. The
self‐attention method was employed to acquire the relationship amid numerous points in every
Transformer Encoder layer. The resemblance amongst the vectors of key and query is employed
to define the attention weight (AW) for every point. The AW demonstrates the relative
significance of every location. The AW computation is given below:
 =  − max 9&amp;'(? (1)
√</p>
        <p>Here, ( and  denotes the key and query related to input embedding (!, ", … , $). By
employing the attention weight matrix AW, we build a weighted sum of the value vector as the
later value vector:</p>
        <p>(, *) =  ⋅  (2)</p>
        <p>Here, * signifies the input embedding. Moreover, we tackle the problem of the variable
length by using the similar padding mask model as the Transformer. Over the embedding layer
usage, we hold the core of every feature in the assumed input series .</p>
        <p>+$ = +$ ⋅  (3)</p>
        <p>The visited embedding +$ and learning parameters +$ are intricate in the procedure. This
layer acts as the drive for incorporating and preserving sequential data into the method.</p>
        <p>Follow the self‐attention tactic to improve the representation via using feed‐forward neural
networks to every point distinctly. An activation function of non‐linear splits the dual linear
layers, which compose the feed‐forward networks. Attach the input features to the output of
the self‐attention device and the feed‐forward network output to generate the remaining
connections. After that, the features of every sub-layer are regularized utilizing the layer
normalization process.</p>
        <p>The Transformer Decoder layer output feeds over a fully connected (FC) layer. To define the
likelihoods of the last output, utilize the activation function of softmax.</p>
        <p>=  max (* + )
(4)
3.3.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Hyperparameter Tuning Process</title>
        <p>
          The MOA approach is employed for the hyperparameter tuning process EAMD-SATM
approach [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. The MOA model is a metaheuristic technique simulated by the population; it
addresses the optimization problems through the iteration process. The MOA includes
candidate solutions in the problem space. The population is initialized based on Eq. (6) at the
initial stage of the optimization process and modelled using a matrix in Eq. (5). The values of
decision variable can be described by all the members based on the search space location.
Additionally, the search ability of population to discover an optimal solution.
        </p>
        <p>
          ⎡ ⋮! ⎤ ⎡ !,! !,$ !,/ ⎤
 = ⎢⎢ , ⎥⎥ = ⎢⎢ , ,! , ,$ , ,/ ⎥⎥ (5)
⎢ ⋮ ⎥ ⎢ ⎥
⎣-⎦-×/ ⎣-,! -,! -,!⎦-×/
, ,$ = $ + (0,1) × ($ − $),  = 1,2, … . , ,  = 1,2, … . ,  (6)
Now,  denotes the population matrix,  is the number of population participants,  is the
quantity of decision parameters, , = , ,!, … . , , ,$, … . , , ,/ denotes the 12 solution of a
candidate, the , ,$ is the 12 a variable that the random function within [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ], and $ and $
are upper and lower limitations of the decision 12 parameters.
        </p>
        <p>The members of the population provide solutions to these problems, which is enhanced. The
function of cost is described by the population individual for the decision variable.
 = ⎡⎢⎢⋮,! ⎤⎥⎥ = ⎡⎢⎢(\⋮,!])⎤⎥⎥ (7)
⎢ ⋮ ⎥ ⎢ ⋮ ⎥
⎣-⎦-×! ⎣(-)⎦-×!
Now,  and , are the vector cost function value for the 12 individuals.</p>
        <p>The value of cost function evaluates the solution quality generated by the population
members. In every iteration, the individual locations and best individual of the population are
upgraded. Therefore, the best individual in population resolves the problems in the last
iteration.</p>
        <p>Consider the mathematical modeling of raising children by mother through interaction. In
the MOA, the population can be upgraded in three different stages as follows:</p>
        <p>
          Education or exploration stage: This stage is based on the children's education in the
proposed MOA. The objective is to increase the global search and exploration capabilities by
making huge alterations in the distinct position. Since the behavior of mother's during the
children's training is noble, and considered as fittest member. A new location for every
individual is generated by using Eq. (9). If the values of the benchmark function increase in the
updated position, then it is demonstrated as a corresponding member place as follows
,3,$! = , ,$ + (0,1) × ($ −  (2) × , ,$)
(8)
, = a43̇!, , 3! ≤ , , (9)
, , ,
Where $ is the 12 size of the mother’s position, , ,$ is the 12 size of 12 individual location,
, and ,3! are the updated locations calculated for the 12 individuals, ,3,$! shows its 12
dimension, , 3! is the cost function value, and the  is a uniformly generated integer within
[
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] and [
          <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
          ].
        </p>
        <p>Advice or Exploration Stage: A mother's responsibility is raising the children, which is of
great importance to guide their children and not allow them to misbehave. This allows global
search and exploration by creating huge alterations in the member location. If an individual
position in the population is exceeded by other individuals with the highest value of cost
function is assumed as a rare method that must be prohibited. Every individual’s bad behavior
($) is determined by the comparative review of the cost function value. The members are
arbitrarily selected from the set of worst behaviors for $, using a uniform distribution. Firstly,
a new location is generated for each individual using Eq. (10). This keeps the child far from the
bad behavior. If there is an increase in cost function value, then a new position replaces the
earlier one based on Eq. (11).</p>
        <p>Exploitation and upbringing stage: Mother uses dissimilar approaches to encourage their
kids to enhance their abilities in the learning method. On the other hand, upbringing assists
individuals to recover their capability in exploitation and local search by making small changes
in individual locations. To stimulate this, a new location is generated for every individual based
on the behavior development of children. If the cost function value improves, it replaces the
preceding location, as follows:
43̇,$6 = , ,$ + \1 − 2 × (0,1)] ×</p>
        <p>
          36, 43̇6 ≤ $;
, a,, , ,
$ − $

Where ,36 denotes the updated location, which is evaluated for the 12 individuals, ,3,$6 is its
12 dimension, , 36 denotes the cost function value, the  is a randomly generated integer
within [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ];  denotes, the iteration counter.
        </p>
        <p>The fitness range is the extensive aspect influencing the achievement of the MOA method.
The hyperparameter assortment method includes the solution-encoded method to compute the
value of the candidate solution. In this research work, the MOA esteems accuracy as the main
feature for inventing the fitness function that is expressed below.</p>
        <p>= max ()</p>
        <p>=
 + 
Whereas,  and  portray the true and false positive values.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Validation</title>
      <p>
        (10)
(11)
(12)
(13)
The performance assessment of the EAMD-SATM approach is analyzed using the
AndroAutoPsy database [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ]. This database has 7500 samples with 2 class labels as specified in
Table 1.
      </p>
      <p>Table 1 s
Details on Dataset</p>
      <sec id="sec-4-1">
        <title>Classes</title>
        <p>Benign
Malware</p>
      </sec>
      <sec id="sec-4-2">
        <title>Total instances</title>
      </sec>
      <sec id="sec-4-3">
        <title>No. of instances</title>
        <p>5000
2500
7500</p>
        <p>Table 2, reports an android malware detection result of EAMD-SATM technique under
70%TRAP and 30%TESP. In Fig. 3, the average outcomes presented by the EAMD-SATM
approach on 70% of TRAS is emphasized. This figure displayed that the EAMD-SATM system
attains efficient results. With 70%TRAP, the EAMD-SATM approach achieves average 7 of
97.30%, # of 97.60%, 8 of 96.33%, 9(*:&amp;;( of 96.93%, and  of 93.93%.</p>
        <p>In Fig. 4, the average outcomes provided by the EAMD-SATM technique on 30% of TESP are
underlined. The figure portrayed that the EAMD-SATM system obtains proficient results. With
30%TESP, the EAMD-SATM methodology achieves average 7 of 97.69%, # of 97.82%,
8 of 96.93%, 9(*:&amp;;( of 97.36%, and  of 94.75%.</p>
        <p>Fig. 5 illustrates the classifier outcomes of EAMD-SATM approach. Fig. 5a shows the
accuracy study of the EAMD-SATM approach. This figure shows that the EAMD-SATM method
achieves growing values over increased epoch counts. Then, Fig. 5b demonstrates the loss study
of the EAMD-SATM technique. The outcomes specify that the EAMD-SATM methodology
achieves adjacent outcomes of training and validation loss. Fig. 5c reported the study of PR in
the EAMD-SATM system. The outcomes indicated that the EAMD-SATM method outcomes in
growing PR values. At last, Fig. 5d shows the ROC examination of the EAMD-SATM technique.
The figure represented, that the EAMD-SATM approach results in enhanced values of ROC.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Algorithm</title>
        <p>EAMD-SATM</p>
        <p>J48 Model
Decision Table</p>
        <p>Naive Bayes</p>
        <p>SMO Classifier
Logistic Algorithm</p>
        <p>AdaBoostM1</p>
        <p>
          In Table 3 and Fig. 6, the efficient results of the EAMD-SATM technique were experienced
compared with recent techniques [
          <xref ref-type="bibr" rid="ref21 ref22 ref23">21-23</xref>
          ]. The outcomes indicated, that the Naive Bayes &amp;
AdaBoostM1 method displayed inferior outcomes. Together, the J48, Decision Table, SMO, and
Logistic Algorithm approaches have depicted nearer results. However, the EAMD-SATM model
handled reporting the highest outcomes with higher 7, #, 8, and 9(*:&amp;;( of
97.69%, 97.82%, 96.93%, and 97.36%, appropriately.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>This study proposes an EAMD-SATM model has been developed. The presented EAMD-SATM
model classifies and recognizes the Android malware efficiently and accurately. To attain this,
the EAMD-SATM approach endures a min-max approach utilizing data pre-processing at the
initial stage. Furthermore, the EAMD-SATM method employs SA-T technique for the detection
of Android malware. To improve the solution of the SA-T technique, the EAMD-SATM
algorithm applies the IMO technique for the parameter tuning method. The simulation
validation of the EAMD-SATM technique can be established on a benchmark Android malware
dataset. The experimental results highlighted the important performance of the EAMD-SATM
approach in the Android malware recognition method</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <source>A Review of Android Malware Detection Approaches Based on Machine Learning, IEEE Access</source>
          ,
          <volume>8</volume>
          , (
          <year>2020</year>
          )
          <fpage>124579</fpage>
          -
          <lpage>124607</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.T.</given-names>
            <surname>Elkabbash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.R.</given-names>
            <surname>Mostafa</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.I. Barakat</surname>
          </string-name>
          ,
          <article-title>Android malware classification based on random vector functional link and artificial Jellyfish Search optimizer</article-title>
          , PloS one,
          <volume>16</volume>
          .
          <fpage>11</fpage>
          , (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ragab</surname>
          </string-name>
          ,
          <article-title>Hybrid firefly particle swarm optimisation algorithm for feature selection problems</article-title>
          ,
          <source>Expert Systems</source>
          ,
          <volume>41</volume>
          .7(
          <year>2024</year>
          )
          <article-title>e13363</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Dovom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Azmoodeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dehghantanha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Newton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Parizi</surname>
          </string-name>
          et al.,
          <article-title>Fuzzy pattern tree for edge malware detection and categorization in IoT</article-title>
          ,
          <source>Journal of Systems Architecture</source>
          ,
          <volume>97</volume>
          , (
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.M.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <surname>MH-DLdroid: A Meta-Heuristic</surname>
          </string-name>
          and
          <article-title>Deep Learning-Based Hybrid Approach for Android Malware Detection</article-title>
          ,
          <source>Int. J. Intell. Eng. Syst</source>
          ,
          <volume>15</volume>
          , (
          <year>2022</year>
          )
          <fpage>425</fpage>
          -
          <lpage>435</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Alkarim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Al-Ghamdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ragab</surname>
          </string-name>
          ,
          <article-title>Ensemble Learning-based Algorithms for Traffic Flow Prediction in Smart Traffic Systems</article-title>
          , Engineering, Technology &amp; Applied Science Research,
          <volume>14</volume>
          .2 (
          <year>2024</year>
          ) :
          <fpage>13090</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>O.A.</given-names>
            <surname>Alzubi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.A.</given-names>
            <surname>Alzubi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.M.</given-names>
            <surname>Al-Zoubi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.A.</given-names>
            <surname>Hassonah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Kose</surname>
          </string-name>
          ,
          <article-title>An efficient malware detection approach with feature weighting based on Harris Hawks optimization</article-title>
          ,
          <source>Cluster Computing</source>
          ,
          <volume>25</volume>
          .4, (
          <year>2022</year>
          )
          <fpage>2369</fpage>
          -
          <lpage>2387</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. D.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Computational Intelligence Enabled Cybersecurity for the Internet of Things</article-title>
          ,
          <source>IEEE Transactions on Emerging Topics in Computational Intelligence</source>
          ,
          <volume>4</volume>
          .5, (
          <year>2020</year>
          )
          <fpage>666</fpage>
          -
          <lpage>674</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ahirao</surname>
          </string-name>
          ,
          <article-title>Proactive Technique for Securing Smart Cities against Malware Attacks Using Static and Dynamic Analysis</article-title>
          ,
          <source>International Research Journal of Innovations in Engineering and Technology</source>
          ,
          <volume>5</volume>
          .2, (
          <year>2021</year>
          )
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.K.</given-names>
            <surname>Smmarwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.P.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>An optimized and efficient android malware detection framework for future sustainable computing</article-title>
          ,
          <source>Sustainable Energy Technologies and Assessments</source>
          ,
          <volume>54</volume>
          , (
          <year>2022</year>
          )
          <fpage>102852</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Ferrag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ndhlovu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tihanyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.C.</given-names>
            <surname>Cordeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Debbah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lestable</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.S.</given-names>
            <surname>Thandi</surname>
          </string-name>
          ,
          <string-name>
            <surname>Revolutionizing Cyber Threat Detection With Large Language Models: A PrivacyPreserving BERT-Based Lightweight</surname>
          </string-name>
          Model for IoT/IIoT Devices, in IEEE Access,
          <volume>12</volume>
          , (
          <year>2024</year>
          )
          <fpage>23733</fpage>
          -
          <lpage>23750</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>A. Girones De La Fuente</surname>
          </string-name>
          ,
          <article-title>Enhancing Malware Detection in Executable Files using LST., BiLSTM-based Deep Learning Models with Word Embedding, Doctoral dissertation</article-title>
          ,
          <source>Politecnico di Torino</source>
          , (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.T.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.S.</given-names>
            <surname>Hossain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Roksana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.D.</given-names>
            <surname>Azpíroz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.M.</given-names>
            <surname>Diaz</surname>
          </string-name>
          , I. Ashraf,
          <string-name>
            <given-names>M.A.</given-names>
            <surname>Samad</surname>
          </string-name>
          ,
          <article-title>Medicinal Plant Classification Using Particle Swarm Optimized Cascaded Network</article-title>
          , IEEE Access,
          <volume>12</volume>
          , (
          <year>2024</year>
          )
          <fpage>42465</fpage>
          -
          <lpage>42478</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ullah</surname>
          </string-name>
          , G. Srivastava,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yoshigoe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>NIDS-VSB: Network Intrusion Detection System for VANET Using Spark-Based Big Data Optimization and Transfer Learning</article-title>
          ,
          <source>in IEEE Transactions on Consumer Electronics</source>
          ,
          <volume>70</volume>
          .1, (
          <year>2024</year>
          )
          <fpage>1798</fpage>
          -
          <lpage>1809</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <article-title>Evolving malware detection through instant dynamic graph inverse reinforcement learning</article-title>
          ,
          <source>Knowledge-Based Systems</source>
          , (
          <year>2024</year>
          )
          <fpage>111991</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Mazziotta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pareto</surname>
          </string-name>
          ,
          <article-title>Normalization methods for spatio‐temporal analysis of environmental performance: Revisiting the Min-Max method</article-title>
          ,
          <source>Environmetrics</source>
          ,
          <volume>33</volume>
          .5, (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.U.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Alsenani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rabie</surname>
          </string-name>
          , T. Shongwe,
          <article-title>Enhancing heart disease prediction using a self-attention-based transformer model</article-title>
          ,
          <source>Scientific Reports</source>
          ,
          <volume>14</volume>
          .1, (
          <year>2024</year>
          )
          <fpage>514</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghadamyari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khayatnezhad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ghadimi</surname>
          </string-name>
          ,
          <article-title>Evaluating the efficiency of CCHP systems in Xinjiang Uygur Autonomous Region: an optimal strategy based on improved mother optimization algorithm</article-title>
          ,
          <source>Case Studies in Thermal Engineering</source>
          ,
          <volume>54</volume>
          , (
          <year>2024</year>
          )
          <fpage>104005</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>[19] https:// ocslab.hksecurity.net/andro-autopsy</mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>J.-W. Jang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Woo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Mohaisen</surname>
            ,
            <given-names>H. K.</given-names>
          </string-name>
          <string-name>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>AndroAutoPsy: Anti-malware system based on similarity matching of malware and malware creator-centric information</article-title>
          ,
          <source>Digit. Invest</source>
          .
          <volume>14</volume>
          , (
          <year>2015</year>
          )
          <fpage>17</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>F.</given-names>
            <surname>Kateb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ragab</surname>
          </string-name>
          ,
          <article-title>Archimedes Optimization with Deep Learning Based Aerial Image Classification for Cybersecurity Enabled UAV Networks</article-title>
          ,
          <source>Computer Systems Science and Engineering</source>
          ,
          <volume>47</volume>
          .2 (
          <year>2023</year>
          )
          <fpage>2171</fpage>
          -
          <lpage>2185</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>H.</given-names>
            <surname>Alamro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Mtouaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Aljameel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Salama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hamza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Othman</surname>
          </string-name>
          ,
          <source>Automated Android Malware Detection Using Optimal Ensemble Learning Approach for Cybersecurity</source>
          ,
          <source>in IEEE Access</source>
          ,
          <volume>11</volume>
          , (
          <year>2023</year>
          )
          <fpage>72509</fpage>
          -
          <lpage>72517</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Maghrabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shabanah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Althaqafi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Alsalman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Algarni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>AL-Ghamdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ragab</surname>
          </string-name>
          ,
          <article-title>Enhancing cybersecurity in the internet of things environment using bald eagle search optimization with hybrid deep learning</article-title>
          ,
          <source>IEEE Access</source>
          ,
          <volume>12</volume>
          , (
          <year>2024</year>
          )
          <fpage>8337</fpage>
          -
          <lpage>8345</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>