<?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">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">39721</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.039721</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Explainable Classification Model for Android Malware Analysis Using API and Permission-Based Features</article-title>
<alt-title alt-title-type="left-running-head">Explainable Classification Model for Android Malware Analysis Using API and Permission-Based Features</alt-title>
<alt-title alt-title-type="right-running-head">Explainable Classification Model for Android Malware Analysis Using API and Permission-Based Features</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Aslam</surname><given-names>Nida</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>naslam@iau.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Khan</surname><given-names>Irfan Ullah</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Bader</surname><given-names>Salma Abdulrahman</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alansari</surname><given-names>Aisha</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Alaqeel</surname><given-names>Lama Abdullah</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Khormy</surname><given-names>Razan Mohammed</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>AlKubaish</surname><given-names>Zahra Abdultawab</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-8" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hussain</surname><given-names>Tariq</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>uom.tariq@gmail.com</email></contrib>
<aff id="aff-1"><label>1</label><institution>SAUDI ARAMCO Cybersecurity Chair, Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University</institution>, <addr-line>P.O. Box 1982, Dammam, 31441</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University</institution>, <addr-line>P.O. Box 1982, Dammam, 31441</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Computer Engineering Department, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University</institution>, <addr-line>P.O. Box 1982, Dammam, 31441</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>School of Computer Science and Technology, Zhejiang Gongshang University, Hangzhou</institution>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Nida Aslam. Email: <email>naslam@iau.edu.sa</email>; Tariq Hussain. Email: <email>uom.tariq@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>08</day><month>10</month><year>2023</year></pub-date>
<volume>76</volume>
<issue>3</issue>
<fpage>3167</fpage>
<lpage>3188</lpage>
<history>
<date date-type="received"><day>13</day><month>2</month><year>2023</year></date>
<date date-type="accepted"><day>07</day><month>6</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Aslam et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Aslam et al.</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_CMC_39721.pdf"></self-uri>
<abstract>
<p>One of the most widely used smartphone operating systems, Android, is vulnerable to cutting-edge malware that employs sophisticated logic. Such malware attacks could lead to the execution of unauthorized acts on the victims&#x2019; devices, stealing personal information and causing hardware damage. In previous studies, machine learning (ML) has shown its efficacy in detecting malware events and classifying their types. However, attackers are continuously developing more sophisticated methods to bypass detection. Therefore, up-to-date datasets must be utilized to implement proactive models for detecting malware events in Android mobile devices. Therefore, this study employed ML algorithms to classify Android applications into malware or goodware using permission and application programming interface (API)-based features from a recent dataset. To overcome the dataset imbalance issue, RandomOverSampler, synthetic minority oversampling with tomek links (SMOTETomek), and RandomUnderSampler were applied to the Dataset in different experiments. The results indicated that the extra tree (ET) classifier achieved the highest accuracy of 99.53&#x0025; within an elapsed time of 0.0198&#x2005;s in the experiment that utilized the RandomOverSampler technique. Furthermore, the explainable Artificial Intelligence (EAI) technique has been applied to add transparency to the high-performance ET classifier. The global explanation using the Shapely values indicated that the top three features contributing to the goodware class are: Ljava/net/URL;-&#x003E;openConnection, Landroid/location/LocationManager;-&#x003E;getLastKgoodwarewnLocation, and Vibrate. On the other hand, the top three features contributing to the malware class are Receive_Boot_Completed, Get_Tasks, and Kill_Background_Processes. It is believed that the proposed model can contribute to proactively detecting malware events in Android devices to reduce the number of victims and increase users&#x2019; trust.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Android malware</kwd>
<kwd>machine learning</kwd>
<kwd>malware detection</kwd>
<kwd>explainable artificial intelligence</kwd>
<kwd>cyber security</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>SAUDI ARAMCO Cybersecurity Chair at Imam Abdulrahman Bin Faisal University</funding-source>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>A mobile phone is a potent communication tool that Motorola initially introduced in 1973 and made commercially accessible in 1984 [<xref ref-type="bibr" rid="ref-1">1</xref>]. In today&#x2019;s world, mobile devices play an essential role in every aspect of our lives. There is much more to smartphones than just making phone calls, where a personal information management system, a payment system, and more are now integrated into it [<xref ref-type="bibr" rid="ref-2">2</xref>]. As a result, over a billion people own smartphones, and most use them for day-to-day functions. Moreover, it is estimated that there will be 7.49 billion mobile phone users worldwide by 2025 [<xref ref-type="bibr" rid="ref-3">3</xref>]. With the advent of the Android platform, the smartphone industry has increased and now holds more than 80&#x0025; market share, being one of the most popular operating systems in 2019, according to research by International Data Corporation [<xref ref-type="bibr" rid="ref-4">4</xref>] and Gartner [<xref ref-type="bibr" rid="ref-5">5</xref>]. Android has changed radically in the previous five years, with more attractive features and critical functions related to health, finance, entertainment, banking, and wallet, and many more being introduced. The number of Android devices sold has exceeded 1 billion, with the Google Play store reporting 65 billion app downloads [<xref ref-type="bibr" rid="ref-6">6</xref>]. As a result of the popularity of the Android platform, more sophisticated malware that employs complicated logic and anti-analysis measures was developed [<xref ref-type="bibr" rid="ref-7">7</xref>]. Approximately 2.5 million new Android malware samples are detected every year, according to a McAfee report [<xref ref-type="bibr" rid="ref-8">8</xref>]. In addition to this store, many unofficial third-party app developers also started offering Android apps. Consequently, the security and privacy vulnerabilities caused by malware have risen [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Jon von Neumann was the first to propose the concept of malware in his study: &#x201C;Theory of Self-Reproducing Automata&#x201D; [<xref ref-type="bibr" rid="ref-11">11</xref>]. Malware is key to all network invasions and security breaches, including trojans, worms, rootkits, scareware, spyware, viruses, and any program that disturbs user data, systems, or networks. It is mainly used to obtain unauthorized access to several inter-connected devices and network assets to sneak sensitive data and files and disrupt regular operations. Most malware is designed solely for entertainment and experimentation, where tactics constantly evolve, attacking with increasing stealth and frequency [<xref ref-type="bibr" rid="ref-12">12</xref>]. The three most prevalent obstacles in malware detection are: identifying obfuscated malware, classifying it, and identifying the crucial attributes used in application obfuscation. This inquiry necessitates a thorough examination of applications. The procedures for detecting Android malware events can be categorized into three categories: Static, dynamic, and hybrid. In the static analysis, anomaly behaviour is monitored by extracting the features from the Android application without running them into a device or Android emulator. This technique can achieve significant feature coverage while being computationally less costly, yet, it can be easily foiled by obfuscation strategies [<xref ref-type="bibr" rid="ref-13">13</xref>]. The dynamic analysis overcomes the static analysis&#x2019;s limitation by running the analysis into a device or Android emulator [<xref ref-type="bibr" rid="ref-14">14</xref>]. Nevertheless, it necessitates higher technical skills and is computationally costly. In contrast, hybrid analysis combines static and dynamic analysis, improving the detecting process&#x2019;s effectiveness and efficiency.</p>
<p>To protect Android users from being attacked by viruses and other malicious applications, Google has developed a machine learning-based (ML-based) ecosystem called &#x201C;Play Protect&#x201D; [<xref ref-type="bibr" rid="ref-15">15</xref>]. The ecosystem intends to identify malware before and after uploading programs to Google Play. However, fraudsters continue targeting Android phones and infecting their users [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>]. Thus, introducing a reliable malware detection application is crucial to reduce malware victims and encourage end-user trust. Cyber security can be revolutionized by combining ML with threat intelligence-based solutions to counter attacks against networks [<xref ref-type="bibr" rid="ref-17">17</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. For instance, using an ensemble technique, in [<xref ref-type="bibr" rid="ref-20">20</xref>] established a high malware detection accuracy for Windows portable executables (PE). Furthermore, authors in [<xref ref-type="bibr" rid="ref-21">21</xref>] used an ML algorithm to detect ransomware, achieving promising results. Additionally, several studies have implemented ML-based models to detect malware in Android devices. However, their effort is adversely affected by the lack of a clear understanding of the latest Android malware landscape. Furthermore, up-to-date datasets capturing the latest Android malware environment are vital for developing successful malware analysis techniques and evaluating new detection systems.</p>
<p>Similarly, most previous studies focused on using black-box complex ML models. The complex ML models are usually opaque and cannot extract how the reasoning has been made. Explainable AI (EAI) or ML (EML) adds interpretability to the black-box ML models. EAI has already been successfully implemented in various domains like health, education, cyber security, etc. [<xref ref-type="bibr" rid="ref-22">22</xref>]. However, EAI has not been used for detecting Android malware. Accordingly, researchers are trying to develop new and effective approaches to Android malware detection. Although earlier research has yielded encouraging results, a further contribution can be made to produce better outcomes by utilizing updated datasets.</p>
<p>To overcome the previous work limitations, this study aimed to develop an ML-based model for detecting malware in Android devices using a newly published dataset [<xref ref-type="bibr" rid="ref-12">12</xref>]. Three ML algorithms were trained, including support vector machine (SVM), random forest (RF), and extra trees (ET), in four different experiments. The ML algorithms were trained using the original imbalanced Dataset in the first experiment. The second, third, and fourth experiments utilized the RandomOverSampler, synthetic minority oversampling with tomek links (SMOTETomek), and RandomUnderSampler, respectively. The results indicated that the ET-RandomOverSampler model achieved the highest accuracy of 99.53&#x0025; with the lowest elapsed time of 0.0198&#x2005;s. Additionally, EAI techniques were used to understand the effect of each feature on the proposed model. The main contribution of the presented research is expressed as follows:
<list list-type="bullet">
<list-item><p>Develop an accurate model for detecting malware events in Android devices using an updated dataset.</p></list-item>
<list-item><p>Compare the performance of the base classifier (SVM) with the ensemble classifiers (RF and ET) in detecting malware in Android devices.</p></list-item>
<list-item><p>Overcome the TUANDROMD dataset imbalance using three different dataset sampling methods.</p></list-item>
<list-item><p>Compare the results of the proposed models in four different sets of experiments (i.e., original data, random-oversampled, oversampled using SMOTETomek, random-undersampled).</p></list-item>
<list-item><p>Analyze the most contributing features to classifying malware using EAI techniques.</p></list-item>
<list-item><p>Achieve the highest results compared to benchmark studies.</p></list-item>
</list></p>
<p>Additionally, the main research questions the study aims to answer are stated as follows:
<list list-type="bullet">
<list-item><p>Which features contribute mostly to detecting Android malware?</p></list-item>
<list-item><p>How can different sampling techniques affect the performance of the ML algorithms?</p></list-item>
<list-item><p>How might the proposed ML model aid in accurately and rapidly identifying Android malware?</p></list-item>
</list></p>
<p>The division and arrangement of the paper are as follows: The review of related literature is covered in <xref ref-type="sec" rid="s2">Section 2</xref> of the article. The materials and methods utilized are reported in <xref ref-type="sec" rid="s3">Section 3</xref> of the article. The empirical design and findings of this study are presented in <xref ref-type="sec" rid="s4">Section 4</xref>, along with a discussion. An explanation of the best model&#x2019;s prediction is detailed in <xref ref-type="sec" rid="s5">Section 5</xref>, whereas the conclusion and future work recommendation is presented in <xref ref-type="sec" rid="s6">Section 6</xref>.</p>
</sec>
<sec id="s2"><label>2</label><title>Related Work</title>
<p>Research has been done to develop models to improve malware detection in the Android operating system. The sections below contain some studies that used ML and deep learning (DL) algorithms ordered chronologically from oldest to most recent.</p>
<sec id="s2_1"><label>2.1</label><title>Android Detection Based on Machine Learning</title>
<p>Milosevic et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] compared emulator and device-based detection to extract features for supervised learning from both environments. They utilized 1222 malware samples from 2444 Android apps. SVM, naive Bayes (NB), simple logistic regression (SLR), multilayer perceptron (MLP), partial decision trees (PART), RF, and J48 decision tree (DT) algorithms were utilized. The results indicated that the phone-based environment outperformed the emulator-based one, where the RF classifier achieved a 92.6&#x0025; F1&#x2013;score, a 93.1&#x0025; true positive rate (TPR), and a 92&#x0025; false positive rate (FPR) using the top 100 features. The authors concluded that developing more efficient device-based ML detection methods is essential as an incentive to minimize the impact of malware anti-emulation and emulator environmental flaws that limit analysis performance. Similarly, Gosiewska et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] carried out a study on malware detection attacking Android devices. Two ML models were developed, one based on source code assessment using a set of words and the other based on permissions. The Dataset included 387 instances for the permission-based approach and 400 applications for the source code-based method. The C4.5 DT, logistic regression (LR), JRip, Bayes networks, and SVM with minimal sequential optimization (SMO) classifiers were used. The results indicated that SVM attained the highest results using the source code-based approach, attaining an F1-score of 95.1&#x0025;. Some improvements can be explored by examining how the suggested permission and source code analysis interact to produce different results. Another enhancement could be done by integrating the static and dynamic application analysis, using multiple classifiers to assess source code and dynamic application properties in real-time.</p>
<p>On the other hand, Suarez-Tangil et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] introduced DroidSieve, a malware classification system whose characteristics are generated from a rapid and scalable static analysis of Android applications. DroidSieve determines if an app is dangerous; if so, it labels it as part of a malware family. The authors used a dataset with over 100k malicious and benign applications. Their model used a binary class label for malware detection and a multi-class label for family classification. ET was used for classification in their study, and the mean decrease in impurity (MDI) technique was utilized for feature selection. They achieved a detection accuracy of 99.82&#x0025; with zero false positives and a malicious family identification accuracy of 99.26&#x0025;. According to their findings, static analysis for Android can work even when faced with obfuscation techniques like reflection, dynamically loaded native code, and encryption. Nevertheless, their approaches are susceptible to mimic attacks since the features they extract can be fabricated. As malware grows more complex, the classifier&#x2019;s performance may organically deteriorate over time. This occurrence is described as concept drift.</p>
<p>In another study, Mart&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] analyzed indirect characteristics and their ability to detect malware using ML. Around 118K Android apps were acquired from the Google Play Store, where malware was declared in 69K apps, and the others were considered goodware. Feature selection was applied by some algorithms, including Pearson&#x2019;s chi-squared test, entropy-based methods, and RF feature importance. The classifiers used were LR, SVM, and RF, where RF yielded the highest results with an 89&#x0025; F1 score. Their analysis showed that metadata could be utilized as a basic static malware predictor, making it ideal for simultaneously analyzing vast numbers of Android apps. It is also feasible to create an in-device system that warns users about the style of programs and the risk of installing them.</p>
<p>In addition, Fang et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] presented a unique technique in which frequent subgraphs (fre-graphs) are formed to describe the common behaviours of malware samples of the same family. Furthermore, they have developed FalDroid, a unique method that automatically classifies Android malware and selects typical malware samples based on free graphs. They used a dataset of 8407 samples to train four different classifiers: SVM with linear kernel, k-nearest neighbour (K-NN), RF, and DT. SVM achieved the highest result compared to the other classifiers, with an accuracy of 95.3&#x0025;. Furthermore, FalDroid attained 94.2&#x0025; accuracy. Due to the difficulties of gathering Android malware samples with precise labels, the Dataset contained only 8,407 malware samples from 36 families, with labels based on VirusTotal findings. As a result, the authors concluded that VirusTotal&#x2019;s results might not be entirely accurate. Mart&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] found that most malware incidents are related to misusing adware or hazardous apps, while others are unknown. The authors aimed to categorize unknown software into either adware or harmful risks using a dataset of 82,866 harmful samples, representing 51.5&#x0025; of the dataset samples. The classification algorithms used were LR and RF, where RF outperformed LR with an F1-score of 84&#x0025;. It has been noticed that adware and harmful programs are often autonomous, but the unknown category gives no more indication of the threat.</p>
<p>In another study by Mehtab et al. [<xref ref-type="bibr" rid="ref-29">29</xref>], the authors employed AdDroid. This ensemble-based ML approach merges adaptive boosting (Adaboost) with standard classifiers to build a model that detects fraudulent apps. After employing feature selection on a dataset of 1420 Android applications, of which 910 are malicious and 510 are benign, DT integrated with Adaboost achieved an accuracy of 99.11&#x0025;. As the suggested approach has very low computational complexity, it can be used to examine real-world applications. Their work can be improved by using a larger dataset of harmful and trustworthy applications, considering the order in which the rule appears, and combining dynamic analysis with the suggested method to analyze disguised malware.</p>
<p>Yang et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] developed a model to improve the accuracy of Android malware detection. The model uses DT and SVM to classify applications as malicious or benign. The study used the University of Gottingen&#x2019;s Drebin project dataset, which contains 5560 malware samples collected from August 2010 to October 2012. The Dataset was divided into three sections in the ratio 6:2:2, representing the training set, the pseudo test set, and the test set. Moreover, the 3-gram technique was used for feature selection. The model achieved an accuracy of 96&#x0025;.</p>
<p>In another study, McLaughlin et al. [<xref ref-type="bibr" rid="ref-31">31</xref>] presented a methodology that improves accuracy in three scenarios: malware binary detection, malware family classification, and malware categorization. The model used over 5000 samples that were divided into two categories: malicious and non-malicious. Furthermore, they classified malware into four categories: adware, ransomware, scareware, and short message service (SMS). They used three classifiers, namely RF, DT, and ET. Moreover, three feature selection techniques were used: Recursive feature elimination (RFE), light gradient boosting model (LGBM), and RF. The findings demonstrate that ET achieved the highest weighted accuracy of all other classifiers. The accuracy of malware detection, malware categorization, and malware family classification was 87.75&#x0025;, 79.97&#x0025;, and 66.71&#x0025;, respectively. The proposed model could be improved by adding a static element. Moreover, feature extraction must be implemented, which converts most network characteristics into CSV files to detect malware at the multilayer level (packet, flow, conversation, and connection). In addition, the existing model needs to be implemented by considering more criteria when identifying Android malware.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Android Detection Based on Deep Learning</title>
<p>Hussain et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] introduced a new system based on phantom routing technique to detect adversary malware. The system detects malware by processing the bytecode, which is treated as text and then analyzed. The system was based on three different sets of data. The first Dataset was obtained from the Android malware genome project, containing 2,123 applications, of which 863 are benign, and 1,260 are malicious applications that classify 49 types of malware. The second Dataset was obtained from the McAfee labs, consisting of 2,475 malicious programs and 3,627 benign applications. The third Dataset is also from the McAfee labs, comprising information for approximately 18,000 Android applications. The results showed that the system could classify over 3000 applications per second. Furthermore, the system&#x2019;s accuracy reached 98&#x0025; when using the first, 80&#x0025; when using the second, and 87&#x0025; with the third.</p>
<p>Stiawan et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] developed Android malware detection with autonomous representation learning in another study. The sample set for the examination consisted of 91,000 applications. With 40 samples per family, in the detection task, the highest F1-score achieved was 99&#x0025;. MalDozer provides automated feature engineering for new malware variants during the training phase. It employs minimum processing, making it suitable for deployment on tiny devices. With comparable speed, MalDozer can trace malware and classify it to the correct malware family. On the other hand, like any static analysis-based detection system, MalDozer is vulnerable to dynamic code loading and reflection obfuscation, where the app gets the malicious script and runs it at runtime. Additionally, MalDozer does not honour natives.</p>
<p>With similar objectives and API calls, Lee et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] used deep neural networks (DNN) to detect Android malware and categorize it as benign or malware. The study used gradient descent for optimization. The model extracts feature from each application&#x2019;s Android manifest file and other Java files. The contribution of this work consists of using a dataset containing types of malware collected from 2013 to 2017, as well as using features not explored in previous investigations, such as API calls, intent filters, and permission combinations. The number of applications collected is 1,200, of which 600 are benign, and 600 are malicious. The accuracy of the model reached 95.31&#x0025;.</p>
<p>Furthermore, Feng et al. [<xref ref-type="bibr" rid="ref-35">35</xref>] proposed an artificial neural network (ANN) based model to classify malware types. They built a dataset that includes 20,000 Android malware with 200 features. The Dataset was constructed using virus information service (VIS) reports, and they added new features such as opcodes. This study has classified more than 1,000 types based on their characteristics. However, some types have been repeated for small numbers and expressed as &#x201C;others.&#x201D; Thus, the total number of malware was 223. The results showed that the accuracy of the proposed model reached 85.76&#x0025;. Feng et al. [<xref ref-type="bibr" rid="ref-35">35</xref>] aimed to improve Android malware detection using 16479 apps containing benign and malware samples. They implemented a two-tier model, where the first tier uses permission, intent, and component information-based static malware detection model. Through the combination of static features and fully connected neural networks, it was able to detect the malware and test its efficacy with 95.22&#x0025;. In the second tire, they used a combination of CNN and AutoEncoder. In the second tier, a binary classification accuracy of 99.3&#x0025;, a multi-class classification accuracy of 98.2&#x0025; for malware category detection, and a multi-class classification accuracy of 71.48&#x0025; for malicious family categorization were yielded.</p>
<p>More recently, Alzaylaee et al. [<xref ref-type="bibr" rid="ref-36">36</xref>] explored the performance of DL-Droid via a series of experiments that aimed to increase the accuracy of zero-day Android malware detection using a dataset consisting of 31125 samples. The authors concluded that adding static feature permissions enhances the accuracy of DL-detection droids, reaching 98.5&#x0025;. This model can potentially improve self-adaptation to the performance of DL-based malware detection systems. The findings also emphasize improving input generation for dynamic analysis systems that use machine learning to detect Android malware. Furthermore, Kim et al. [<xref ref-type="bibr" rid="ref-37">37</xref>] proposed a malware analysis system that can be deployed in mobile devices with low computation. The proposed system uses CNN to detect shared features among malware API call graphs. It also uses a lightweight learner that computes the similarity between API call graphs utilized in malicious operations and API call graphs of apps to be categorized. The results demonstrated the effectiveness of the proposed system, achieving an accuracy of 91.27&#x0025;. Additionally, the system can classify the applications 145.8&#x0025; faster, with a memory consumption of 10 times less than previous models.</p>
<p>Albakri et al. [<xref ref-type="bibr" rid="ref-38">38</xref>] combined DL with rock hyrax swarm optimization (RHSO) for detecting Android malware attacks. The RHSO was mainly used to select the most contributing features to the target class. The DL model used for classification is the attention recurrent autoencoder optimized using the Adamax optimizer. The proposed model achieved an accuracy of 99.05&#x0025;.</p>
<p>Lately, Xie et al. [<xref ref-type="bibr" rid="ref-39">39</xref>] utilized two open-source datasets: CIC-AndMal2017 and CICMalDroid2020, to build a classification model for detecting Android malware. The authors used InfoGain and Chi-square test for feature selection. After that, they optimized five classifiers using a genetic algorithm and combined them in a stacking ensemble. The proposed stacking model achieved an accuracy of 98.43&#x0025; using the first Dataset and 98.66&#x0025; using the second Dataset.</p>
<p>According to the literature, some studies have been undertaken for Android malware detection to determine whether an application is malware or benign [<xref ref-type="bibr" rid="ref-40">40</xref>]. Some other studies classified malware applications based on their families. Although most previous studies performed well, updated malware has some limitations. The limitations can be resolved by using an updated dataset considering the sequence in which the rules come and observing how different approaches interact to produce a better result, such as integrating static and dynamic application analysis. Furthermore, as malware becomes more complex and the classifier&#x2019;s performance may gradually reduce, it is recommended to keep the Dataset up to date to train the model with more evolved malware and extract the most relevant features to attain more accurate results. Accordingly, this study aimed to utilize a study not investigated in previous studies. ML classifiers were trained using the selected Dataset with a hypothesis to avoid previous studies&#x2019; drawbacks and yield an outstanding result. Furthermore, most reviewed studies have been found to use black-box models such as RF, DNN, SVM, ET, and ANN. Therefore, in the current study, we have used post hoc EAI to add transparency to the ET classifier. <xref ref-type="table" rid="table-1">Table 1</xref> below summarizes all studies mentioned in this section.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Summary of the discussed studies</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 align="left">Study</th>
<th align="left">Dataset</th>
<th align="left">Number of samples</th>
<th align="left">Number of features</th>
<th align="left">Technique</th>
<th align="left">Result</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Mart&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td align="left">118K</td>
<td align="left">69K malware and 49K goodware</td>
<td align="left">14 intrinsic features, seven social-related features, and two entity-related features</td>
<td align="left">RF</td>
<td align="left">89&#x0025; F1-core.</td>
</tr>
<tr>
<td align="left">Fan et al. [<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td align="left">8407</td>
<td align="left">&#x2013;</td>
<td align="left">&#x2013;</td>
<td align="left">SVM</td>
<td align="left">94.2&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Mart&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td align="left">82866</td>
<td align="left">Harmful samples represent 51.5&#x0025;<break/>whereas Adware 48.5&#x0025;</td>
<td align="left">&#x2013;</td>
<td align="left">RF</td>
<td align="left">84&#x0025; F1-score</td>
</tr>
<tr>
<td align="left">Mehtab et al. [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td align="left">1420</td>
<td align="left">910 malicious and 510 benign</td>
<td align="left">&#x2013;</td>
<td align="left">DT</td>
<td align="left">99.11&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Yang et al. [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td align="left">2444</td>
<td align="left">1222 malware</td>
<td align="left">100</td>
<td align="left">RF</td>
<td align="left">92.6&#x0025; F1-score</td>
</tr>
<tr>
<td align="left">McLaughlin et al. [<xref ref-type="bibr" rid="ref-31">31</xref>]</td>
<td align="left">M0Droid 400</td>
<td align="left">200 malicious and 200 benign</td>
<td align="left">100</td>
<td align="left">SVM</td>
<td align="left">95.1&#x0025; F1-score</td>
</tr>
<tr>
<td align="left">Hussain et al. [<xref ref-type="bibr" rid="ref-32">32</xref>]</td>
<td align="left">Over 100K</td>
<td align="left">100K goodware and over 17k malware</td>
<td align="left">320 for family identification</td>
<td align="left">ET</td>
<td align="left">99.82&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Stiawan et al. [<xref ref-type="bibr" rid="ref-33">33</xref>]</td>
<td align="left">9974</td>
<td align="left">5560 malware and 4414 benign</td>
<td align="left">&#x2013;</td>
<td align="left">A decision<break/> tree with<break/> SVM</td>
<td align="left">Accuracy is 96&#x0025;</td>
</tr>
<tr>
<td align="left">Lee et al. [<xref ref-type="bibr" rid="ref-34">34</xref>]</td>
<td align="left">5000</td>
<td align="left">&#x2013;</td>
<td align="left">9</td>
<td align="left">ET</td>
<td align="left">For malware detection, malware categorization, and malware family classification, the accuracies were 87.75&#x0025;, 79.97&#x0025;, and 66.71&#x0025;, respectively</td>
</tr>
<tr>
<td align="left">Feng et al. [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td align="left">Three different datasets:<break/>1. 2123 applications<break/>2. 6102 applications<break/>3. 18000 Android programs</td>
<td align="left">The first Dataset contains 863 benign and 1260 malware. The second one contains 3627 benign and 2475 malware. The last Dataset contains 9268 benign and 9902 malware</td>
<td align="left">&#x2013;</td>
<td align="left">DNN</td>
<td align="left">Accuracy is:<break/>98&#x0025; for the small Dataset, 80&#x0025; for the large Dataset<break/>87&#x0025; for the v.large dataset</td>
</tr>
<tr>
<td align="left">Alzaylaee et al. [<xref ref-type="bibr" rid="ref-36">36</xref>]</td>
<td align="left">91k</td>
<td align="left">40 samples per malware family</td>
<td align="left">49</td>
<td align="left">DNN</td>
<td align="left">F1-score between 96&#x0025; and 99&#x0025;</td>
</tr>
<tr>
<td align="left">Kim et al. [<xref ref-type="bibr" rid="ref-37">37</xref>]</td>
<td align="left">1200 applications</td>
<td align="left">Six hundred benign apps and 600 malicious apps</td>
<td align="left">&#x2013;</td>
<td align="left">DNN</td>
<td align="left">95.31&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Albakri et al. [<xref ref-type="bibr" rid="ref-38">38</xref>]</td>
<td align="left">20000</td>
<td align="left">19750 malware</td>
<td align="left">235</td>
<td align="left">ANN</td>
<td align="left">85.76&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Batista et al. [<xref ref-type="bibr" rid="ref-41">41</xref>]</td>
<td align="left">9419</td>
<td align="left">5065 benign and 4354 malware</td>
<td align="left">5692</td>
<td align="left">CNN</td>
<td align="left">99.19&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Khan et al. [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td align="left">31125</td>
<td align="left">19,620 benign 11,505 malware</td>
<td align="left">420</td>
<td align="left">RF</td>
<td align="left">98.5&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Lema&#x00EE;tre et al. [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td align="left">43692</td>
<td align="left">33692 malware and 10000 benign</td>
<td align="left">4312</td>
<td align="left">Lightweight classifier</td>
<td align="left">91.72&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Geurts et al. [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td align="left">22000</td>
<td align="left">9000 benign samples and 13,000 malware samples</td>
<td align="left">104</td>
<td align="left">attention recurrent autoencoder</td>
<td align="left">99.05&#x0025; accuracy</td>
</tr>
<tr>
<td align="left">Boulesteix et al. [<xref ref-type="bibr" rid="ref-45">45</xref>]</td>
<td align="left">17426 in the first dataset and 17243 in the second dataset</td>
<td align="left">426 malicious and 1700 benign in the first dataset and 13204 malicious and 4039 benign in the second dataset</td>
<td align="center"/>
<td align="left">GA-Stacking</td>
<td align="left">98.43&#x0025; accuracy (First Dataset)<break/>98.66&#x0025; accuracy (Second Dataset)</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Materials and Methods</title>
<p>This study aimed to implement an ML-based model for detecting Android malware that provides timely prediction. The proposed methodology is illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, where a new dataset, TUANDROMD, was utilized, consisting of 4465 different apps classified into malware and goodware [<xref ref-type="bibr" rid="ref-46">46</xref>]. Three ML classifiers: Extra tree (ET), random forest (RF), and support vector machine (SVM) was trained and compared in terms of six measures: accuracy, precision, sensitivity, F1-score, Cohen&#x2019;s Kappa, and elapsed time.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Block diagram of proposed study methodology</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-1.tif"/></fig>
<sec id="s3_1"><label>3.1</label><title>Description of the Dataset</title>
<p>The TUANDROMD dataset is used in this study, comprising 178 permission-based and 186 API-based features relevant for differentiating between malware and benign Android apps. The Dataset contains 4465 applications divided into 135 categories and 71 malware families, with around 900 applications classified as goodware. There are 242 binary attributes in the Dataset, with 71 labels related to the malware family. The Dataset comprises 3565 malware records and 899 goodware records, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. It was observed that the data is highly imbalanced. Therefore, three sampling techniques were performed to balance the Dataset: RandomOversampler SMOTETomek, and RandomUndersampler. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> demonstrates the number of samples per category before and after applying the sampling techniques. Furthermore, since the Dataset had already been pre-processed before publication, no pre-processing steps were applied in this study.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Number of samples per category before and after applying the data balancing techniques</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-2.tif"/></fig>
</sec>
<sec id="s3_2"><label>3.2</label><title>Data Balancing Techniques</title>
<p>According to Borah et al. [<xref ref-type="bibr" rid="ref-12">12</xref>], the Dataset they collected is not balanced but can be balanced by collecting more samples or using sampling techniques. Therefore, the effect of applying three sampling techniques, namely, RandomOversampler, RandomUnderSampler, and SMOTETomek, were investigated by measuring the proposed models&#x2019; performances.</p>
<sec id="s3_2_1"><label>3.2.1</label><title>RandomOverSampler</title>
<p>RandomOverSampler is a non-heuristic method that replicates minority class instances at random to balance class distribution. Consequently, RandomOverSampler added 2,666 positive samples to the Dataset with 899 positives and 3,565 negative cases. However, since RandomOverSampler produces the exact copies of minority class examples, it can increase the likelihood of overfitting [<xref ref-type="bibr" rid="ref-47">47</xref>].</p>
</sec>
<sec id="s3_2_2"><label>3.2.2</label><title>RandomUnderSampler</title>
<p>RandomUnderSampler is a non-heuristic method that reduces most class instances at random to balance the classes&#x2019; distribution. Consequently, RandomUnderSasmpler eliminated 2,666 negative samples from the utilized Dataset, resulting in 899 malware and 899 goodware instances. Undersampling contributes to reducing the computational burden of analyzing massive datasets. However, it may cause the loss of potentially relevant data [<xref ref-type="bibr" rid="ref-48">48</xref>].</p>
</sec>
<sec id="s3_2_3"><label>3.2.3</label><title>Synthetic Minority Oversampling with Tomek Links (SMOTETomek)</title>
<p>SMOTE performs by generating artificial samples using k-nearest neighbours and sampling with replacement to add instances to the minority class. Tomek links is an undersampling technique that eliminates samples belonging to the majority class that is too close to those belonging to the minority class [<xref ref-type="bibr" rid="ref-48">48</xref>]. Accordingly, combining SMOTE with Tomek links is considered an over-under-sampling technique. After applying SMOTETomek, the positive class comprised 3,565 samples, and the negative class comprised 3,565.</p>
</sec>
</sec>
<sec id="s3_3"><label>3.3</label><title>Description of the Classifiers</title>
<p>Three classification techniques, ET, RF, and SVM, were trained and compared to find the best-performing model for classifying malware in Android devices. The following section discusses the classifiers theoretically.</p>
<sec id="s3_3_1"><label>3.3.1</label><title>Extra Tree Classifier</title>
<p>ET, also called Extremely Randomized Trees, is a form of ensemble learning that outputs a classification result by combining the outcomes of several de-correlated decision trees gathered in a &#x201C;forest.&#x201D; It is similar to RF but enhances the variation using a different approach to building trees. Each decision stump is constructed using a specific criterion: as follows. First, use all available data to build the stump. Second, take the square root of the feature number to create a subset of randomly selected features of equal size that can be used to select the best split, and that can be used to build the root node or any node. Third, one is the maximum depth of the decision stump. Considering this approach, the randomized selection of the features and tree creation is the power of this classifier, making it computationally inexpensive compared to the RF classifier. The information gain is used as a decision criterion that first calculates the entropy using the following formula in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mtext mathvariant="italic">Entropy</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where c is the output label, n is the number of unique class labels, and <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the proportion of rows with c. After that, entropy is used to calculate the information gain for each feature Y, which is mentioned in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>I</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Entropy</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mi>&#x03F5;</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">Values</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mi>X</mml:mi></mml:mfrac><mml:mrow><mml:mtext mathvariant="italic">Entropy</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Finally, using the information to gain maximum value results, the ET forest is the most important variable to determine the output label [<xref ref-type="bibr" rid="ref-49">49</xref>,<xref ref-type="bibr" rid="ref-50">50</xref>].</p>
</sec>
<sec id="s3_3_2"><label>3.3.2</label><title>Random Forest Classifier</title>
<p>RF is one of the most effective ML algorithms that use many decision trees. It is an ensemble of trees built from a training set and verified to classify the target class. It reduces the model sensitivity to the original data by bootstrapping and decreases variance using random feature selection. RF comes in various forms, but the basic one works as follows. First, it generates many datasets from the original, each containing random rows with the same number of records as the original Dataset. This step is called bootstrapping. Each decision tree is then trained separately by selecting random features from each bootstrapping Dataset. The next step is to build the trees using information gain criteria to choose the splitting features as explained in the previous classifier. Finally, all predictions must be combined using the majority vote as the final result, known as aggregation [<xref ref-type="bibr" rid="ref-50">50</xref>].</p>
</sec>
<sec id="s3_3_3"><label>3.3.3</label><title>Support Vector Machine</title>
<p>SVM is an ML algorithm based on Vapnik&#x2019;s statistical learning theory that seeks to improve the model&#x2019;s ability in the generalization process. The most important feature of this method is its ability to overcome local minimum limits and the curse of dimensionality. Based on the training set, the SVM tries to find a line that separates two labels, known as the &#x201C;hyperplane line,&#x201D; and support vectors are the points closest to the hyperplane. There can be multiple lines between category labels, but the one with the widest margin between the two labels is chosen. Thus, when the classifier is applied to the test set, SVM compares each record to the hyperplane line and classifies it with either the first or second class. The formula for SVM is mentioned in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="italic">input</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">weight</mml:mtext></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">input</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mrow><mml:mtext>ias</mml:mtext></mml:mrow></mml:math></disp-formula>where each input has weight, then calculate the corresponding output value based on the weight and bias/intercept. Moreover, the formula of each label lying above the hyperplane is <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mtext mathvariant="italic">weight</mml:mtext></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>+</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> while the label below the hyperplane is <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mtext mathvariant="italic">weight</mml:mtext></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">input</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="s3_4"><label>3.4</label><title>Hyper-Parameter Tuning</title>
<p>Each ML model has two types of parameters: hyper-parameters and model parameters. Hyper-parameters are the values the programmer configures using trial-and-error that contribute to increasing the algorithm&#x2019;s learning performance. On the other hand, a model&#x2019;s parameters alter independently based on the optimal hyper-parameter found. One of the most popular hyper-parameters tuning techniques is GridSearchCV, which tries all possible combinations of values defined in a grid to find the best using cross-validation. This study, 10-fold cross-validation was applied to the training set to find the optimal hyper-parameters for each algorithm in all experiments. <xref ref-type="table" rid="table-2">Table 2</xref> outlines the optimal hyper-parameter values for each algorithm in the different sets of experiments.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>The optimal hyper-parameters produced by the GridSearchCV technique in each experiment</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Experiment</th>
<th align="left">Classifier</th>
<th align="left">Hyperparameter</th>
<th align="left">Training accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="3">Original dataset</td>
<td align="left">SVM</td>
<td align="left">C&#x2009;&#x003D;&#x2009;7, gamma&#x2009;&#x003D;&#x2009;0.1, kernel&#x2009;&#x003D;&#x2009;RBF</td>
<td align="left">99.33&#x0025;</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;log2, n_estimators&#x2009;&#x003D;&#x2009;120, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">99.46&#x0025;</td>
</tr>
<tr>
<td align="left">ET</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;log2, n_estimators&#x2009;&#x003D;&#x2009;100, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;entropy</td>
<td align="left">99.52&#x0025;</td>
</tr>
<tr>
<td align="left" rowspan="3">RandomOverSampler</td>
<td align="left">SVM</td>
<td align="left">C&#x2009;&#x003D;&#x2009;10, gamma&#x2009;&#x003D;&#x2009;0.1, kernel&#x2009;&#x003D;&#x2009;RBF</td>
<td align="left">99.64&#x0025;</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;sqrt, n_estimators&#x2009;&#x003D;&#x2009;30, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">99.62&#x0025;</td>
</tr>
<tr>
<td align="left">ET</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;sqrt, n_estimators&#x2009;&#x003D;&#x2009;60, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">99.58&#x0025;</td>
</tr>
<tr>
<td align="left" rowspan="3">SMOTETomek</td>
<td align="left">SVM</td>
<td align="left">C&#x2009;&#x003D;&#x2009;15, gamma&#x2009;&#x003D;&#x2009;0.1, kernel&#x003D;RBF</td>
<td align="left">99.36&#x0025;</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;log2, n_estimators&#x2009;&#x003D;&#x2009;140, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">99.44&#x0025;</td>
</tr>
<tr>
<td align="left">ET</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;sqrt, n_estimators&#x2009;&#x003D;&#x2009;140, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">99.46&#x0025;</td>
</tr>
<tr>
<td align="left" rowspan="3">RandomUnderSampler</td>
<td align="left">SVM</td>
<td align="left">C&#x2009;&#x003D;&#x2009;2, gamma&#x2009;&#x003D;&#x2009;0.1, kernel&#x2009;&#x003D;&#x2009;RBF</td>
<td align="left">98.89&#x0025;</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;log2, n_estimators&#x2009;&#x003D;&#x2009;30, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;gini</td>
<td align="left">98.65&#x0025;</td>
</tr>
<tr>
<td align="left">ET</td>
<td align="left">max_features&#x2009;&#x003D;&#x2009;sqrt, n_estimators&#x2009;&#x003D;&#x2009;40, max_depth&#x2009;&#x003D;&#x2009;None, criterion&#x2009;&#x003D;&#x2009;entropy</td>
<td align="left">99.21&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_5"><label>3.5</label><title>Performance Measures</title>
<p>This study utilized six performance measures to compare the performance of the proposed ML models: accuracy, precision, recall, F1-score, Cohen&#x2019;s kappa, and elapsed time. Accuracy refers to the percentage of cases correctly classified. However, it can be misleading in the case of highly imbalanced datasets. Precision refers to how well a model produces positive outcomes, whereas recall refers to how well a model categorizes positive samples. In an imbalanced dataset, F1-score gives a better indicator than accuracy, combining the results of the precision and recall scores in a single score. The agreement between predicted and real labels is measured by Cohen&#x2019;s kappa score, which <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> indicates the accuracy of the models and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> signifies the agreement between predicted and actual labels. Besides, the elapsed time is an essential metric in real-time applications since it calculates how long it takes for a model to produce a prediction.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mtext mathvariant="italic">Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Correctly</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">classified</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">samples</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Total</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">number</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">samples</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Correctly</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">classified</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">malware</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">samples</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Total</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">number</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">positive</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">predictions</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Correctly</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">classified</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">malware</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">samples</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Total</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">number</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">positive</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">samples</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">precision</mml:mtext></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">recall</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">precision</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="italic">recall</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">kappa</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Experimental Setup and Result</title>
<p>The experiment was implemented using the Python version 3.8.5, Sklearn version 1.0.2, and imbalanced-learn version 0.8.0, with a fixed seed value of 42. Four experiments were conducted: Using original data, over-sampled data using RandomOverSampler, over-under-sampled data using SMOTETomek, and under-sampled data using RandomUnderSampler. All experiments&#x2019; data were split into 70&#x0025; for training and 30&#x0025; for testing. GridSearchCV with 10-fold cross-validation was utilized to tune the algorithms&#x2019; hyper-parameters. The three models in each experiment were evaluated using six performance measures. <xref ref-type="table" rid="table-3">Table 3</xref> Represents the proposed classifiers&#x2019; performance without applying data sampling techniques to the Dataset, <xref ref-type="table" rid="table-4">Table 4</xref> Represents the proposed classifiers&#x2019; performance with RandomOverSampler, and <xref ref-type="table" rid="table-5">Table 5</xref> Shows the classifiers&#x2019; performance after the SMOTETomek over-undersampling technique, and <xref ref-type="table" rid="table-6">Table 6</xref> Represents the performance of the classifiers using RandomUnderSampler.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Performance evaluation of the three classifiers with data imbalance</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Classifier</th>
<th align="left">Class</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
<th align="left">Cohen&#x2019;s Kappa</th>
<th align="left">Elapsed time</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">SVM</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9933</td>
<td align="left">0.9972</td>
<td align="left">0.9945</td>
<td align="left">0.9958</td>
<td align="left" rowspan="2">0.9784</td>
<td align="left" rowspan="2">0.0877&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9768</td>
<td align="left">0.9883</td>
<td align="left">0.9825</td>
</tr>
<tr>
<td align="left" rowspan="2">RF</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9933</td>
<td align="left">0.9972</td>
<td align="left">0.9945</td>
<td align="left">0.9958</td>
<td align="left" rowspan="2">0.9784</td>
<td align="left" rowspan="2">0.0240&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9768</td>
<td align="left">0.9883</td>
<td align="left">0.9825</td>
</tr>
<tr>
<td align="left" rowspan="2">ET</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9933</td>
<td align="left">0.9972</td>
<td align="left">0.9945</td>
<td align="left">0.9958</td>
<td align="left" rowspan="2">0.9784</td>
<td align="left" rowspan="2">0.0240&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9768</td>
<td align="left">0.9883</td>
<td align="left">0.9825</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-4"><label>Table 4</label><caption><title>Performance evaluation of the three classifiers with RandomOverSampler</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Classifier</th>
<th align="left">Class</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
<th align="left">Cohen&#x2019;s Kappa</th>
<th align="left">Elapsed time</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">SVM</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9953</td>
<td align="left">0.9982</td>
<td align="left">0.9927</td>
<td align="left">0.9954</td>
<td align="left" rowspan="2">0.9869</td>
<td align="left" rowspan="2">0.0997&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9924</td>
<td align="left">0.9981</td>
<td align="left">0.9952</td>
</tr>
<tr>
<td align="left" rowspan="2">RF</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9935</td>
<td align="left">0.9945</td>
<td align="left">0.9927</td>
<td align="left">0.9936</td>
<td align="left" rowspan="2">0.9878</td>
<td align="left" rowspan="2">0.0160&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9924</td>
<td align="left">0.9943</td>
<td align="left">0.9933</td>
</tr>
<tr>
<td align="left" rowspan="2">ET</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9953</td>
<td align="left">0.9982</td>
<td align="left">0.9927</td>
<td align="left">0.9954</td>
<td align="left" rowspan="2">0.9897</td>
<td align="left" rowspan="2">0.0198&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9924</td>
<td align="left">0.9981</td>
<td align="left">0.9952</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-5"><label>Table 5</label><caption><title>Performance evaluation of the three classifiers with SMOTETomek data undersampling</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Classifier</th>
<th align="left">Class</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
<th align="left">Cohen&#x2019;s Kappa</th>
<th align="left">Elapsed time</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">SVM</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9939</td>
<td align="left">0.9991</td>
<td align="left">0.9890</td>
<td align="left">0.9940</td>
<td align="left" rowspan="2">0.9878</td>
<td align="left" rowspan="2">0.0977&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9886</td>
<td align="left">0.9990</td>
<td align="left">0.9938</td>
</tr>
<tr>
<td align="left" rowspan="2">RF</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9949</td>
<td align="left">1.000</td>
<td align="left">0.9899</td>
<td align="left">0.9949</td>
<td align="left" rowspan="2">0.9897</td>
<td align="left" rowspan="2">0.0400&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9896</td>
<td align="left">1.0000</td>
<td align="left">00.9948</td>
</tr>
<tr>
<td align="left" rowspan="2">ET</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9953</td>
<td align="left">0.9982</td>
<td align="left">0.9927</td>
<td align="left">0.9954</td>
<td align="left" rowspan="2">0.9897</td>
<td align="left" rowspan="2">0.0467&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9924</td>
<td align="left">0.9981</td>
<td align="left">0.9952</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-6"><label>Table 6</label><caption><title>Performance evaluation of the three classifiers with RandomUnderSampler</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Classifier</th>
<th align="left">Class</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
<th align="left">Cohen&#x2019;s Kappa</th>
<th align="left">Elapsed time</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">SVM</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9889</td>
<td align="left">0.9963</td>
<td align="left">0.9818</td>
<td align="left">0.9890</td>
<td align="left" rowspan="2">0.9778</td>
<td align="left" rowspan="2">0.0199&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9815</td>
<td align="left">0.9962</td>
<td align="left">0.9888</td>
</tr>
<tr>
<td align="left" rowspan="2">RF</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9889</td>
<td align="left">0.9963</td>
<td align="left">0.9818</td>
<td align="left">0.9890</td>
<td align="left" rowspan="2">0.9697</td>
<td align="left" rowspan="2">0.0080&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9815</td>
<td align="left">0.9962</td>
<td align="left">0.9888</td>
</tr>
<tr>
<td align="left" rowspan="2">ET</td>
<td align="left">Malware</td>
<td align="left" rowspan="2">0.9796</td>
<td align="left">0.9888</td>
<td align="left">0.9708</td>
<td align="left">0.9797</td>
<td align="left" rowspan="2">0.9741</td>
<td align="left" rowspan="2">0.0080&#x2005;s</td>
</tr>
<tr>
<td align="left">Goodware</td>
<td align="left">0.9705</td>
<td align="left">0.9887</td>
<td align="left">0.9795</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Overall, the results indicate that the highest accuracy is achieved in experiments 2 and 3, where the RandomOverSampler and SMOTEtomek sampling techniques were applied to the Dataset before training the algorithms. On the other hand, the least performance is recorded when using the RandomUnderSampler technique. The highest accuracy of 99.53&#x0025; is obtained using the SVM and ET models in experiment 2 and the ET model in experiment 3. However, since malware detection is one of the security issues requiring fast performance, it is concluded that the ET model outperformed the SVM model with an elapsed time of 0.0198&#x2005;s. Even though ensemble learners have a higher time complexity than base learners, SVM recorded a higher elapsed time than the ensemble learners since the data was not normalized in the pre-processing stage. To further compare the results in terms of true positive, true negative, false positive, and false negative counts, confusion matrices were constructed and represented in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Confusion matrix for classifiers in three different cases</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-3.tif"/></fig>
<p>By comparing the results of the models in each experiment, it is evident that all models performed equally well in experiment 1. Furthermore, it is marked that all models performed equally in identifying malware events in experiment 2, whereas ET achieved the lowest false-positive counts. On the other hand, it is shown that ensemble learners outperformed in experiment 3, whereas SVM achieved the best results in experiment 4. From <xref ref-type="table" rid="table-3">Table 3</xref> it was concluded that ET performed the best in experiments 2 and 3. Failure to detect malware events could lead to serious consequences, including critical information getting compromised, intelligent systems, and slowing down daily business operations. Accordingly, looking in-depth into the false positive and false negative counts, it is indicated that ET performed better in experiment 2 since it achieved a lower false negative count.</p>

<p>Based on the literature review results, it is found that the study by Alzaylaee et al. [<xref ref-type="bibr" rid="ref-36">36</xref>] used an RF classifier and achieved an F-score of 92.6&#x0025;. Another study by Mart&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] used RF to obtain an F-score of 89&#x0025;. Yang et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] and Stiawan et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] conducted a study on malware detection on Android devices and achieved the highest F-score of 95.1&#x0025; and 95.3&#x0025; accuracy, respectively, utilizing the same classifier. Compared with the TUANDROMD dataset, this study achieved an F-score of 99.58&#x0025; for detecting malware events and 98.25&#x0025; for detecting goodware events using the RF classifier with an elapsed time of 0.0240&#x2005;s. Several data sampling techniques were applied to improve the results since the Dataset utilized was imbalanced. ET outperformed other classifiers after utilizing the RandomOverSampler technique, achieving an accuracy of 99.53&#x0025;. Comparing our study to the test results published in the literature, ours outperforms them all before and after applying the sampling techniques, with an elapsed time of less than one millisecond. Although McLaughlin et al. [<xref ref-type="bibr" rid="ref-31">31</xref>] achieved higher accuracy than our study, the Dataset utilized in their study is considered outdated since more sophisticated Android malware was developed after 2017.</p>
<p>The suggested approach can be useful in detecting Android malware efficiently while identifying the most contributing features to the given prediction. As a result, it may be quite beneficial to analyze the nature of malware events and lower their likelihood at high speed. However, some limitations accompany the model&#x2019;s performance, including the number of features and its inability to classify the malware type.</p>
</sec>
<sec id="s5"><label>5</label><title>Explainable Artificial Intelligence</title>
<p>ML models&#x2019; current evolution and rapid advancements proved to be highly effective in cyber security, including intrusion detection, malware detection, and spam filtering. Despite their impressive performance, ML models lack explainability, which reduces users&#x2019; confidence in the models used to defend against cyberattacks, particularly in today&#x2019;s increasingly complex and diverse cyberattacks [<xref ref-type="bibr" rid="ref-28">28</xref>]. To overcome this burden, EAI has been introduced to analyze and understand the decisions made by ML models. There are two categories of EAI techniques: global and local explanations. Global explanations provide insight into the model&#x2019;s behaviour and explain the effect of each feature on the class label. On the other hand, local explanations justify the model&#x2019;s explanation for one instance. In this study, the Shapely additive explanation (SHAP) was utilized for the global explanation, whereas the local interpretable model-agnostic explanation (LIME) was used for the local explanation.</p>
<sec id="s5_1"><label>5.1</label><title>SHAP</title>
<p>SHAP is an EAI technique that provides a global explanation by calculating Shapley values as a game theory concept based on players and rewards. Based on each feature&#x2019;s Shapley value, it can be estimated how much each feature contributed to the result [<xref ref-type="bibr" rid="ref-17">17</xref>]. The SHAP library was utilized in this study to form the explanation for the ET-RandomOverSampler model, as illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, which shows the top 20 features contributing to the model&#x2019;s performance. It is concluded that the top three features contributing to the goodware class are: Ljava/net/URL;-&#x003E;openConnection, Landroid/location/LocationManager;-&#x003E;getLastKgoodwarewnLocation, and Vibrate. On the other hand, the top three features contributing to the malware class are Receive_Boot_Completed, Get_Tasks, and Kill_Background_Processes.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>The shapely values of the top 20 contributing features using the ET-RandomOverSampler model</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-4.tif"/></fig>
</sec>
<sec id="s5_2"><label>5.2</label><title>LIME</title>
<p>LIME is one of the popular EAI techniques that provides a local explanation using Lasso or short trees. This technique analyzes the model&#x2019;s behaviour in predicting a single instance [<xref ref-type="bibr" rid="ref-16">16</xref>], as illustrated in <xref ref-type="fig" rid="fig-5">Figs. 5</xref> and <xref ref-type="fig" rid="fig-6">6</xref>, which shows the top 10 features contributing to the model&#x2019;s performance. It is indicated that all features except Landroid/location/LocationManager;-&#x003E;getLastKgoodwarewnLocation, Ljava/net/URL;-&#x003E;openConnection, and Sdcard Write contributed to predicting the instance as goodware. Conversely, all the instances, except for System_Alert_Windows, Receive_SMS, and Media_Button, contributed to categorizing the instance as malware.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>LIME results using the ET-RandomOverSampler model for the goodware event</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-5.tif"/></fig><fig id="fig-6"><label>Figure 6</label><caption><title>LIME results using the ET-RandomOverSampler model for malware event</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_39721-fig-6.tif"/></fig>
</sec>
</sec>
<sec id="s6"><label>6</label><title>Conclusion and Future Work</title>
<p>Malware has been forming dangerous threats to Android users over the last few years, stealing their personal information and slowing their devices. ML algorithms showed promising results in the real-time detection of malware events. Accordingly, this study aimed to classify Android programs into malware and goodware. The performance of three classifiers, SVM, RF, and ET, were compared and evaluated in four experiments using the up-to-date TUANDROMD dataset. This research showed that different sampling techniques had diverse effects on the performance of ML algorithms. Four experiments were done in this study, where the imbalanced data was used to train the algorithms in the first experiment. In contrast, RandomOverSampler, SMOTETomek, and RandomUnderSampler were applied in the second, third, and fourth experiments, respectively. Additionally, the study proved the ability of ML to accurately and rapidly identify Android malware, where the results demonstrated the reliability of the ET-RandomOverSampler model in differentiating between malware and goodware events with an accuracy of 99.53&#x0025; with an elapsed time of 0.0198&#x2005;s. Furthermore, EAI techniques were employed to understand the proposed model&#x2019;s decisions better. Despite the promising results, there is room for improvement by incorporating more applications to overcome the imbalance issue. Additionally, the effect of different feature selection techniques could be investigated to reduce the time complexity. Besides, the proposed paradigm could be deployed in a web-based application for real-time applications.</p>
</sec>
</body>
<back>
<ack>
<p>We would like to thank SAUDI ARAMCO Cybersecurity Chair for funding this project.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work was funded by the SAUDI ARAMCO Cybersecurity Chair at Imam Abdulrahman Bin Faisal University, Saudi Arabia.</p></sec>
<sec><title>Author Contributions</title>
<p>Conceptualization, N.A. and I.U.K.; methodology, S.A.B.; software, A.A.; validation, L.A.A., R.M.K.; formal analysis, Z.A.A.; investigation, T.H.; resources, S.S.A.; data curation, N.A.; writing&#x2014;original draft preparation, I.U.K.; writing&#x2014;review and editing, T.H.; visualization, S.S.A.; supervision, N.A.; project administration, S.S.A.; funding acquisition, I.U.K. All authors have read and agreed to the published version of the manuscript.</p></sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The study used an open-source dataset.</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="web"> &#x201C;<article-title>Interview with mobile phone inventor Marty Cooper&#x2014;BBC News</article-title>,&#x201D; <year>2022</year>. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.bbc.com/news/av/technology-22020666">https://www.bbc.com/news/av/technology-22020666</ext-link></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>J.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Abbas</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Al-Muhtadi</surname></string-name></person-group>, &#x201C;<article-title>Survey on mobile user&#x2019;s data privacy threats and defense mechanisms</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>56</volume>, no. <issue>1</issue>, pp. <fpage>376</fpage>&#x2013;<lpage>383</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="web"> &#x201C;<article-title>Forecast number of mobile users worldwide 2020&#x2013;2025&#x007C;Statista</article-title>,&#x201D; <year>2022</year>. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.statista.com/statistics/218984/number-of-global-mobile-users-since-2010/">https://www.statista.com/statistics/218984/number-of-global-mobile-users-since-2010/</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="web"> &#x201C;<article-title>IDC&#x2014;Smartphone Market Share&#x2014;Market Share</article-title>,&#x201D; 2022. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.idc.com/promo/smartphone-market-share/market-share">https://www.idc.com/promo/smartphone-market-share/market-share</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="web"> &#x201C;<article-title>Newsroom, Announcements and Media Contacts&#x007C;Gartner</article-title>,&#x201D; 2022. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.gartner.com/en/newsroom">https://www.gartner.com/en/newsroom</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>N. V.</given-names> <surname>Rodriguez</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Guo</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Beyond google play: A large-scale comparative study of Chinese android app markets</article-title>,&#x201D; in <conf-name>Proc. of IMC</conf-name>, <conf-loc>New York, NY, USA</conf-loc>, pp. <fpage>293</fpage>&#x2013;<lpage>307</lpage>, <year>2018</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>F.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Roy</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ou</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Zhou</surname></string-name></person-group>, &#x201C;<article-title>Deep ground truth analysis of current android malware</article-title>,&#x201D; in <conf-name>Lecture Notes in Computer Science</conf-name>, <conf-loc>Cham</conf-loc>, <publisher-name>Springer</publisher-name>, vol. <volume>10327</volume>, pp. <fpage>252</fpage>&#x2013;<lpage>276</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="web"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Dinkar</surname></string-name></person-group>, &#x201C;<article-title>McAfee Labs Threats Report: March 2016</article-title>,&#x201D; <year>2016</year>. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.mcafee.com/us/mcafee-labs.aspx">www.mcafee.com/us/mcafee-labs.aspx</ext-link></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>M.</given-names> <surname>Abuthawabeh</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Mahmoud</surname></string-name></person-group>, &#x201C;<article-title>Enhanced android malware detection and family classification, using conversation-level network traffic features</article-title>,&#x201D; <source>The International Arab Journal of Information Technology</source>, vol. <volume>17</volume>, no. <issue>4</issue>, pp. <fpage>607</fpage>&#x2013;<lpage>614</lpage>, <year>2020</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>Rashidi</surname></string-name> and <string-name><given-names>C. J.</given-names> <surname>Fung</surname></string-name></person-group>, &#x201C;<article-title>A survey of android security threats and defenses</article-title>,&#x201D; <source>Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications</source>, vol. <volume>6</volume>, no. <issue>3</issue>, pp. <fpage>3</fpage>&#x2013;<lpage>35</lpage>, <year>2015</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>K.</given-names> <surname>Iman</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kassiri</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Salleh</surname></string-name></person-group>, &#x201C;<article-title>Preventing collusion attack in android</article-title>,&#x201D; <source>International Arab Journal of Information Technology</source>, vol. <volume>12</volume>, no. <issue>6</issue>, pp. <fpage>719</fpage>&#x2013;<lpage>727</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Borah</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Bhattacharyya</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Kalita</surname></string-name></person-group>, &#x201C;<article-title>Malware dataset generation and evaluation</article-title>,&#x201D; in <conf-name>2020 IEEE 4th Conf. on Information &#x0026; Communication Technology (CICT)</conf-name>, <conf-loc>Chennai, India</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2020</year>. <pub-id pub-id-type="doi">10.1109/CICT51604.2020.9312053</pub-id></mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="web"> &#x201C;<article-title>Mobile Device Security and Data Protection&#x2014;Android</article-title>,&#x201D; 2022. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://www.android.com/safety/">https://www.android.com/safety/</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="web"> &#x201C;<article-title>Half a million Android users tricked into downloading malware from Google Play&#x007C;TechCrunch</article-title>,&#x201D; 2022. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://techcrunch.com/2018/11/20/half-a-million-android-users-tricked-into-downloading-malware-from-google-play/">https://techcrunch.com/2018/11/20/half-a-million-android-users-tricked-into-downloading-malware-from-google-play/</ext-link></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>D.</given-names> <surname>Dasgupta</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Akhtar</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sen</surname></string-name></person-group>, &#x201C;<article-title>Machine learning in cybersecurity: A comprehensive survey</article-title>,&#x201D; <source>The Journal of Defense Modeling and Simulation</source>, vol. <volume>19</volume>, no. <issue>1</issue>, pp. <fpage>57</fpage>&#x2013;<lpage>106</lpage>, <year>2020</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>N.</given-names> <surname>Aslam</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mirza</surname></string-name>, <string-name><given-names>A.</given-names> <surname>AlOwayed</surname></string-name>, <string-name><given-names>F. M.</given-names> <surname>Anis</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Interpretable machine learning models for malicious domains detection using explainable artificial intelligence (XAI)</article-title>,&#x201D; <source>Sustainability</source>, vol. <volume>14</volume>, no. <issue>12</issue>, pp. <fpage>7375</fpage>, <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>N.</given-names> <surname>Aslam</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>R. F.</given-names> <surname>Aljishi</surname></string-name>, <string-name><given-names>Z. M.</given-names> <surname>Alnamer</surname></string-name>, <string-name><given-names>Z. M.</given-names> <surname>Alzawad</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Explainable computational intelligence model for antepartum fetal monitoring to predict the risk of IUGR</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>11</volume>, no. <issue>4</issue>, pp. <fpage>593</fpage>, <year>2022</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>I. U.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Aslam</surname></string-name>, <string-name><given-names>R.</given-names> <surname>AlShedayed</surname></string-name>, <string-name><given-names>D.</given-names> <surname>AlFrayan</surname></string-name>, <string-name><given-names>R.</given-names> <surname>AlEssa</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A proactive attack detection for heating, ventilation, and air conditioning (HVAC) system using explainable extreme gradient boosting model (XGBoost)</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>22</volume>, no. <issue>23</issue>, pp. <fpage>9235</fpage>, <year>2022</year>; <pub-id pub-id-type="pmid">36501938</pub-id></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.</given-names> <surname>Alwarthan</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Aslam</surname></string-name> and <string-name><given-names>I. U.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>An explainable model for identifying at-risk student at higher education</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>10</volume>, pp. <fpage>107649</fpage>&#x2013;<lpage>107668</lpage>, <year>2022</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>I. U.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Explainable artificial intelligence (XAI) model for the diagnosis of urinary tract infections in emergency care patients</article-title>,&#x201D; <source>Mathematical Modelling of Engineering Problems</source>, vol. <volume>9</volume>, no. <issue>4</issue>, pp. <fpage>971</fpage>&#x2013;<lpage>978</lpage>, <year>2022</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>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Al Hamadi</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Damiani</surname></string-name>, <string-name><given-names>C. Y.</given-names> <surname>Yeun</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Taher</surname></string-name></person-group>, &#x201C;<article-title>Explainable artificial intelligence applications in cyber security: State-of-the-art in research</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>10</volume>, pp. <fpage>93104</fpage>&#x2013;<lpage>93139</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. K.</given-names> <surname>Alzaylaee</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Yerima</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sezer</surname></string-name></person-group>, &#x201C;<article-title>Emulator vs real phone: Android malware detection using machine learning</article-title>,&#x201D; in <conf-name>Proc. of the 3rd ACM on Int. Workshop on Security and Privacy Analytics, IWSPA</conf-name>, <conf-loc>New York, NY, USA</conf-loc>, pp. <fpage>65</fpage>&#x2013;<lpage>72</lpage>, <year>2017</year>.</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>N.</given-names> <surname>Milosevic</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Dehghantanha</surname></string-name> and <string-name><given-names>K. K. R.</given-names> <surname>Choo</surname></string-name></person-group>, &#x201C;<article-title>Machine learning aided android malware classification</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>61</volume>, pp. <fpage>266</fpage>&#x2013;<lpage>274</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Gosiewska</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Biecek</surname></string-name></person-group>, &#x201C;<article-title>IBreakDown: Uncertainty of model explanations for non-additive predictive models</article-title>,&#x201D; <year>2019</year>. <pub-id pub-id-type="doi">10.48550/arxiv.1903.11420</pub-id></mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Suarez-Tangil</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Dash</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ahmadi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Kinder</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Giacinto</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>DroidSieve: Fast and accurate classification of obfuscated android malware</article-title>,&#x201D; in <conf-name>Proc. of the Seventh ACM on Conf. on Data and Application Security and Privacy</conf-name>, <conf-loc>New York, USA</conf-loc>, pp. <fpage>309</fpage>&#x2013;<lpage>320</lpage>, <year>2017</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>I.</given-names> <surname>Mart&#x00ED;n</surname></string-name>, <string-name><given-names>J. A.</given-names> <surname>Hern&#x00E1;ndez</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mu&#x00F1;oz</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Guzm&#x00E1;n</surname></string-name></person-group>, &#x201C;<article-title>Android malware characterization using metadata and machine learning techniques</article-title>,&#x201D; <source>Security and Communication Networks</source>, vol. <volume>2018</volume>, <comment>5749481</comment>, <year>2018</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>M.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Tian</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Android malware familial classification and representative sample selection via frequent subgraph analysis</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>13</volume>, no. <issue>8</issue>, pp. <fpage>1890</fpage>&#x2013;<lpage>1905</lpage>, <year>2018</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>I.</given-names> <surname>Mart&#x00ED;n</surname></string-name>, <string-name><given-names>J. A.</given-names> <surname>Hern&#x00E1;ndez</surname></string-name> and <string-name><given-names>S.</given-names> <surname>de los Santos</surname></string-name></person-group>, &#x201C;<article-title>Machine-learning based analysis and classification of android malware signatures</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>97</volume>, pp. <fpage>295</fpage>&#x2013;<lpage>305</lpage>, <year>2019</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>A.</given-names> <surname>Mehtab</surname></string-name>, <string-name><given-names>W. B.</given-names> <surname>Shahid</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Yaqoob</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Amjad</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Abbas</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>AdDroid: Rule-based machine learning framework for android malware analysis</article-title>,&#x201D; <source>Mobile Networks and Applications</source>, vol. <volume>25</volume>, pp. <fpage>180</fpage>&#x2013;<lpage>192</lpage>, <year>2020</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>M.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Luo</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>An android malware detection model based on DT-SVM</article-title>,&#x201D; <source>Security and Communication Networks</source>, vol. <volume>2020</volume>, <comment>Article ID 8841233</comment>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>McLaughlin</surname></string-name>, <string-name><given-names>J. M. D.</given-names> <surname>Rincon</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Kang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Yerima</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Miller</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Deep android malware detection</article-title>,&#x201D; in <conf-name>Proc. of the Seventh ACM on Conf. on Data and Application Security and Privacy</conf-name>, <conf-loc>NY, USA</conf-loc>, pp. <fpage>301</fpage>&#x2013;<lpage>308</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>T.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>H. U.</given-names> <surname>Rahman</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Ali</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Improving source location privacy in social Internet of Things using a hybrid phantom routing technique</article-title>,&#x201D; <source>Computers &#x0026; Security</source>, vol. <volume>123</volume>, pp. <fpage>102917</fpage>, <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>D.</given-names> <surname>Stiawan</surname></string-name>, <string-name><given-names>S. M.</given-names> <surname>Daely</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Heryanto</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Afifah</surname></string-name>, <string-name><given-names>M. Y.</given-names> <surname>Idris</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Ransomware detection based on opcode behavior using k-nearest neighbors algorithm</article-title>,&#x201D; <source>Information Technology and Control</source>, vol. <volume>50</volume>, pp. <fpage>495</fpage>&#x2013;<lpage>506</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Heo</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Hong</surname></string-name></person-group>, &#x201C;<article-title>Machine learning based android malware classification</article-title>,&#x201D; in <conf-name>Proc. of the Conf. on Research in Adaptive and Convergent Systems (RACS &#x2019;19)</conf-name>, <conf-loc>New York, NY, USA</conf-loc>, <publisher-name>Association for Computing Machinery</publisher-name>, pp. <fpage>300</fpage>&#x2013;<lpage>302</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>J.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>A two-layer deep learning method for android malware detection using network traffic</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>125786</fpage>&#x2013;<lpage>125796</lpage>, <year>2020</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>M. K.</given-names> <surname>Alzaylaee</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Yerima</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Sezer</surname></string-name></person-group>, &#x201C;<article-title>DL-Droid: Deep learning based android malware detection using real devices</article-title>,&#x201D; <source>Computers &#x0026; Security</source>, vol. <volume>89</volume>, pp. <fpage>101663</fpage>, <year>2020</year>.</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>J.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ban</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Ko</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Cho</surname></string-name> and <string-name><given-names>J. H.</given-names> <surname>Yi</surname></string-name></person-group>, &#x201C;<article-title>MAPAS: A practical deep learning-based android malware detection system</article-title>,&#x201D; <source>International Journal of Information Security</source>, vol. <volume>21</volume>, no. <issue>4</issue>, pp. <fpage>725</fpage>&#x2013;<lpage>738</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>A.</given-names> <surname>Albakri</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Alhayan</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Alturki</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ahamed</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Shamsudheen</surname></string-name></person-group>, &#x201C;<article-title>Metaheuristics with deep learning model for cybersecurity and android malware detection and classification</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>13</volume>, no. <issue>4</issue>, pp. <fpage>2172</fpage>, <year>2023</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>N.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Qin</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Di</surname></string-name></person-group>, &#x201C;<article-title>GA-stackingMD: Android malware detection method based on genetic algorithm optimized stacking</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>13</volume>, no. <issue>4</issue>, pp. <fpage>2629</fpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="web"> &#x201C;<article-title>UCI machine Learning Repository: TUANDROMD (Tezpur University Android Malware Dataset) Data Set</article-title>,&#x201D; <year>2022</year>. [Online]. Available: <ext-link ext-link-type="uri" xlink:href="https://archive.ics.uci.edu/dataset/855/tuandromd+(tezpur+university+android+malware+dataset)">https://archive.ics.uci.edu/dataset/855/tuandromd+(tezpur+university+android+malware+dataset)</ext-link></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>G. E. A. P. A.</given-names> <surname>Batista</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Prati</surname></string-name> and <string-name><given-names>M. C.</given-names> <surname>Monard</surname></string-name></person-group>, &#x201C;<article-title>A study of the behavior of several methods for balancing machine learning training data</article-title>,&#x201D; <source>ACM SIGKDD Explorations Newsletter</source>, <comment>NY, USA</comment>, vol. <volume>6</volume>, no. <issue>1</issue>, pp. <fpage>20</fpage>&#x2013;<lpage>29</lpage>, <year>2004</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>H. U.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sohail</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nazir</surname></string-name>, <string-name><given-names>Y. Y.</given-names> <surname>Ghadi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Prioritizing the multi-criterial features based on comparative approaches for enhancing security of IoT devices</article-title>,&#x201D; <source>Physical Communication</source>, vol. <volume>59</volume>, pp. <fpage>102084</fpage>, <year>2023</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>G.</given-names> <surname>Lema&#x00EE;tre</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Nogueira</surname></string-name> and <string-name><given-names>C. K.</given-names> <surname>Aridas</surname></string-name></person-group>, &#x201C;<article-title>Imbalanced-learn: A python toolbox to tackle the curse of imbalanced datasets in machine learning</article-title>,&#x201D; <source>Journal of Machine Learning Research 1</source>, vol. <volume>18</volume>, no. <issue>17</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2017</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>P.</given-names> <surname>Geurts</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Ernst</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Wehenkel</surname></string-name></person-group>, &#x201C;<article-title>Extremely randomized trees</article-title>,&#x201D; <source>Machine Learning</source>, vol. <volume>63</volume>, pp. <fpage>3</fpage>&#x2013;<lpage>42</lpage>, <year>2006</year>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. L.</given-names> <surname>Boulesteix</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Janitza</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Kruppa</surname></string-name> and <string-name><given-names>I. R.</given-names> <surname>K&#x00F6;nig</surname></string-name></person-group>, &#x201C;<article-title>Overview of random forest methodology and practical guidance with emphasis on computational biology and bioinformatics</article-title>,&#x201D; <source>Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery</source>, vol. <volume>2</volume>, no. <issue>6</issue>, pp. <fpage>493</fpage>&#x2013;<lpage>507</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Data mining: Data mining concepts and techniques</article-title>,&#x201D; in <conf-name>Int. Conf. on Machine Intelligence and Research Advancement</conf-name>, <conf-loc>Katra, India</conf-loc>, pp. <fpage>203</fpage>&#x2013;<lpage>207</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Nohara</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Matsumoto</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Soejima</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Nakashima</surname></string-name></person-group>, &#x201C;<article-title>Explanation of machine learning models using shapley additive explanation and application for real data in hospital</article-title>,&#x201D; <source>Computer Methods and Programs in Biomedicine</source>, vol. <volume>214</volume>, pp. <fpage>106584</fpage>, <year>2022</year>; <pub-id pub-id-type="pmid">34942412</pub-id></mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Dama&#x0161;evi&#x010D;ius</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ven&#x010D;kauskas</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Toldinas</surname></string-name> and <string-name><given-names>&#x0160;.</given-names> <surname>Grigali&#x016B;nas</surname></string-name></person-group>, &#x201C;<article-title>Ensemble-based classification using neural networks and machine learning models for windows PE malware detection</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>10</volume>, no. <issue>4</issue>, pp. <fpage>485</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N. A.</given-names> <surname>Azeez</surname></string-name>, <string-name><given-names>O. E.</given-names> <surname>Odufuwa</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Misra</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Oluranti</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Dama&#x0161;evi&#x010D;ius</surname></string-name></person-group>, &#x201C;<article-title>Windows PE malware detection using ensemble learning</article-title>,&#x201D; <source>Informatics</source>, vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hong</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A secure trust-based key distribution with self-healing for internet of things</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>114060</fpage>&#x2013;<lpage>114076</lpage>, <year>2019</year>.</mixed-citation></ref>
</ref-list>
</back></article>