<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>SVM-based Technique for Mobile Malware Detection</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Khmelnitsky National University</institution>
          ,
          <addr-line>Khmelnitsky</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>A paper presents a new technique for the mobile malware detection based on the malware's network features analysis is proposed. It uses SVM for malicious programs detection. The novel approach provides the ability to detect malware in the mobile devices. As the inference engine for malware detection the support vector machine was used. The detection process is performed by taking into account the malware's features, captured in the mobile devices. Experimental research showed that the SVMs are able to produce the accurate classification results. Experiments demonstrated, that technique is able to detect different types of malware up to 98.21%.</p>
      </abstract>
      <kwd-group>
        <kwd>Malware</kwd>
        <kwd>Mobile device</kwd>
        <kwd>Cybersecurity</kwd>
        <kwd>Behavior</kwd>
        <kwd>Computer system</kwd>
        <kwd>Network</kwd>
        <kwd>Android</kwd>
        <kwd>Cyberattack</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Last year the threats against mobile devices in particular backdoors, malicious
cryptomining, banking trojans, especially during the second half of 2018, were growing
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The both new mobile device infection techniques (for example, DNS hijacking)
and the use of tried-and-tested distribution schemes (for example, SMS spam) were
applied. The one third of all mobile attacks - from building botnets, to stealing
banking credentials, perpetrating click fraud, or threatening reputation - were performed by
hidden apps. McAfee researchers identified 65 000 of fake mobile apps, up more
than six-fold from the 10 000 detected only six months earlier. However Android
remains by far the most popular mobile operating system, being used by four fifths of
respondents. iOS is the only other mobile OS to reach double figures, at 15% [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related works</title>
      <p>Today variety of approaches to identify of android malware is widely present on the
literature.</p>
      <p>
        A malware detection technique called Personal Mobile Malware Guard – PMMG
that classifies malwares based on the mobile user feedback is presented in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. PMMG
controls permissions of different applications and their behavior according to the user
needs. These preferences are built incrementally on a personal basis according to the
feedback of the user. Performance analysis showed that it is theoretically feasible to
build PMMG tool and use it on mobile devices. However in case of sensitive mobile
resources that require a large portion of permissions, the proposed technique may lead
to increase a number of a false alarm.
      </p>
      <p>
        Similar to above mentioned except permission, approach that use a combination of
permissions and intents supplemented with multiple stages of classifiers for malware
detection is proposed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Their experiments were performed on 1745 applications
samples starting with a performance comparison between MLP, Decision Table,
Decision Tree, Random Forest, Naive Bayes and Sequential Minimal Optimization
classifiers. The Decision Table, MLP, and Decision Tree classifiers were then
combined using three schemes: average of probabilities, product of probabilities and
majority voting.
      </p>
      <p>
        In work [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] authors have proposed an approach to detect Android malware using
system call logs. The proposed technique mainly consists of three stages. At first
using emulator Genymotion the system call log of applications are observed. To do this,
each application was executed in emulator for approximately five minutes. To
improve the quality of dataset on the second stage involves the using of filtering
algorithm. The third step is the implementation of the dataset on machine-learning
algorithms. The results of experiments have shown the high accuracy of detection,
however authors didn't took into account capable of some applications identify a sandbox
type environment.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] a malware detection system that uses a deep convolutional neural network
(CNN) is proposed. Malware classification is performed based on static analysis of
the raw opcode sequence from a disassembled program. Features indicative of
malware are automatically learned by the network from the raw opcode sequence thus
removing the need for hand-engineered malware feature. Their experiments
demonstrate that CNNs can effectively learn to detect sequences of opcodes that are
indicative of malware.
      </p>
      <p>
        Another static approach for android malware detection that uses multiple features
to analyze is presented in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. A set of features such as hardware, permission,
application components, filtered intents, opcodes and strings are extracted from the samples
to form a vector space model. Feature selection methods such as Entropy based
Category Coverage Difference (ECCD) and Weighted Mutual Information (WI) are used
to choose the prominent features. The performance of the system is analyzed using
classifiers, Random Forest, Rotation Forest and Support Vector Machine (SVM).
      </p>
      <p>
        Authors in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] propose a static-analysis based system that named MaMaDroid.
The operation of a MaMaDroid goes through four stages. First, it extract the call
graph from each app by using static analysis, then, it obtain the sequences of API calls
using all unique nodes after which it abstract each call to class, package, or family.
The third stage involves modeling of the behavior of each app by constructing
Markov chains from the sequences of abstracted API calls for the app, with the transition
probabilities used as the feature vector toclassify the app as either benign or malware
using a machine learning classifier.
      </p>
      <p>
        The framework TriFlow that use a triage mechanism to rank applications
considering their potential risk is developed [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. TriFlow combines a probabilistic model to
predict the existence of information flows with a metric of how significant a flow is in
benign and malicious apps. Based on this, TriFlow provides a score for each
application that can be used to prioritize analysis. The experimental results show that it can
predict the presence of information flows very accurately and that the overall triage
mechanism enables significant resource saving.
      </p>
      <p>The literature review has shown that the problem of android malware detection is
extremely actuals. However considered approaches have some common
disadvantages which are manifested in ignoring packed malware and impossibility to protect
the device from Zero Day attacks and malwares capable of modifying themselves.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13">10–13</xref>
        ] an approaches for malware detection based on the network and hosting
behavior analysis are presented. They use the self-adaptive idea for the malware
detection and are based on usage of the semi-supervised fuzzy c-means clustering,
where the objects of clustering were the feature vectors which elements may indicate
the appearance of cyber threats networks and computer systems.
      </p>
      <p>The mentioned above methods of the malware detection in the mobile devices have
shown a high level of effectiveness, but also demonstrate high rate of false positives.</p>
      <p>The common weakness of the aforementioned approaches is the requirement of
large amounts of computing resources and the fact that they aren’t able to respond
adaptively to known and unknown attacks performed by malware against the mobile devices.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Support Vector Machine</title>
      <p>
        The support vector machines (SVMs) are the high-potential approach for the object
classification. SVMs are the supervised learning models with associated learning
algorithms [
        <xref ref-type="bibr" rid="ref14 ref15">14–15</xref>
        ]. They are able to produce accurate and robust classification
results, even when input data is non-monotone and non-linearly separable, and to
evaluate more relevant information in a convenient way, providing high accuracy of
classification with small training sets [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>Basically, SVM performs classification by finding the hyperplane that maximizes
the margin between two classes. Vectors (cases) that define the hyperplane are the
support vectors. To define an optimal hyperplane we need to maximize the width of
the margin:
w  x  b  0,
(1)
plane, b is the basis and</p>
      <p>
        || w ||
the origin, with || w || the Euclidean norm of w [
        <xref ref-type="bibr" rid="ref14 ref17">14, 17</xref>
        ].
where x is a classification object lying on the hyperplane, w is normal to the
hyper| b |
      </p>
      <p>is the perpendicular distance from the hyperplane to</p>
      <p>Let  be a mapping function which projects the training data into a Hilbert high
dimensional space H,  : Rq  H . The data point x is represented in space H as
 (x) .</p>
      <p>In the context of SVM, the kernel function defines the hypothesis space, and is
defined as:
where xi is a training data.</p>
      <p>It leads to decision functions of the following form:</p>
      <p>K (x, xi )  ( (x)  (xi )),</p>
      <p> r 
f (x)  sgn  i i K (x, xi )  b ,</p>
      <p>
 i1 
where  i , i  1,..., r are Lagrange multipliers, the maximal magnitude of which is
governed by C.</p>
      <p>
        In order to compute the separating hyperplane without explicitly carrying out the
mapping into the feature space, different kernel functions can be used [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ]. In this
approach, the classification process involved the kernels: linear, polynomial,
Gaussian, exponential, and B-Spline.
      </p>
      <p>The linear kernel is the simplest kernel function. It is given by the inner product
(x, xi ) plus an optional constant c:</p>
      <p>K (x, xi )  xT xi  c, c  R.</p>
      <p>K (x, xi )  e 21 2 ||(xxi )||2 ,   0,</p>
      <p>K (x, xi )  e 21 2 ||(x xi )||.
(2)
(3)
(4)
(5)
(6)
(7)</p>
      <p>The polynomial kernel is a non-stationary kernel, where the adjustable parameters
are the slope α, the constant term c and the polynomial degree p:</p>
      <p>K (x, xi )  (xT xi  c) p ,   R, c  R, p  N.</p>
      <p>The Gaussian kernel is an example of radial basis function kernel:
where σ is the parameter that controls the width of the Gaussian kernel.</p>
      <p>The exponential kernel is closely related to the Gaussian kernel, with only the
square of the norm left out. It is also a radial basis function kernel:</p>
      <p>
        The B-Spline is a radial basis function kernel, and is defined on the interval
[
        <xref ref-type="bibr" rid="ref1">−1, 1</xref>
        ]. It is given by the recursive formula [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]:
      </p>
      <p>K (x, xi )  B2 p1(x  xi ), where p  N with Bi1 : Bi  B0
(8)</p>
      <p>
        In order to perform the multi-class classification, the ”one against all” and ”one
against one” SVM-based methods are used [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
”One Against all” SVM Classifier. This method constructs k SVM models, where k
is the number of classes. The m-th SVM is trained with all of the samples in the m-th
class with positive labels, and all other samples with negative labels. The m-th SVM
solves the task of training data mapping to a higher dimensional space for the given l
training data (x1, a1),...,(xl , al ), where xi  Rn, i  1,...,l, ai {i  1,...,k} is the class
of training data xi .
      </p>
      <p>In order to perform the classification for xi , we use k decision functions, where k
is the number of classes:</p>
      <p>(wi )T (xi )  bi , where i  1,...,k,
where  – is the mapping function,  : Rq  H.</p>
      <p>
        The data xi then belongs to class a, for which the above decision function has the
largest value:
(9)
(10)
a  arg max xi1,...,k ((wi )T  (xi )  bi ).
”One Against One” SVM Classifier. The proposed technique uses the ”one against
one” SVM classification method as well. Here, k (k 1) / 2 classifiers are to be
constructed for each pair of classes and the max-win strategy is to be followed.
Specifically, if sqn(w jl )T (xi )  b jl evaluates xi to be in j-th class, then the vote for the j-th
class is incremented by one, else that for the l-th class is increased by one. Finally, the
training data vector xi is predicted to belong to the class with maximum number of
votes [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>Taking into account the advantages of the SVM, it can be used as the inference
engine for the making the decision about the presence of the malware in the mobile
devices.
4</p>
    </sec>
    <sec id="sec-4">
      <title>SVM-based Approach of the Mobile Malware Detection</title>
      <p>We propose a new technique for the mobile malware detection. An approach presents
the SVM-based system for malware detection with the ability to classify the malicious
program and blocking them.</p>
      <p>The proposed approach includes learning and detection stages. The learning stage
consists of the following steps:</p>
      <p>1. Knowledge formation based on the features that may indicate the mobile
malware presence.</p>
      <p>2. Presentation of the knowledge about the mobile malware behavior as a set of
feature vectors.</p>
      <p>3. Formation the set of mobile malware classes using SVM.</p>
      <p>The monitoring stage consists of the following steps:
1. Gathering the features in the mobile device, which may indicate the mobile
malware presence.</p>
      <p>2. Construction of the feature vectors based on the obtained information.
3. The detecting stage involves the implementation of SVM classification of the
obtained feature vectors in order to assign them to one of the mobile malware’s class.
4. The blocking of the malicious program execution.</p>
      <p>Let us take a closer look at each step of the method.
4.1</p>
      <sec id="sec-4-1">
        <title>Knowledge Formation Based on the Features that May Indicate</title>
      </sec>
      <sec id="sec-4-2">
        <title>Mobile Malware Presence</title>
        <p>
          Let us denote the set of malware’s classes as А  ammNA1 , where a1 – the Trojans; a2
– the backdoors; a3 – the mobile botnets; a4 – the spammers; a5 – the spyware; a6
– smartphone trackers; a7 – the mobile proxy-servers; a8 – SMS malware; a9 – the
exploits; a10 – the rootkits; a11 – the Adware; a12 – the DDoS attackers, where N A –
the number of attacks, performed by DDoS botnets [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ].
        </p>
        <p>Let us denote the set of features, that may indicate mobile malware’s attacks
against the device and are to be analyzed as B  bj NjB1 , where N B – the number of
features. The list of features is presented in Table 1. Let us denote the set of devices
attacked by mobile malware as H  hi iNH1 , where N H – the number of mobile
devices. Thus, the function of the malware’s attack identifying f can be presented as:
f : hi  bj  am .
the global amount of anonymous mapping maps, i.e., the area of the virtual
memory (all processes) not backed by any file
the global amount of slab – a slab is the amount by which a cache can grow or
shrink.
the total amount of memory in swap and RAM
the amount of application AUA memory shared with other processes, accounted
in a way that the amount is divided evenly between the processes that share it
the size portion of memory occupied by the application AUA that is held in
RAM
the set of pages that are unique for the application AUA
the amount of information (expressed in kB) written on the storage by all the
processes
the amount of information (expressed in kB) read from storage by all the
processes
the number of bytes which are read from storage by the application AUA
the number of bytes which are written into the storage by the application AUA
the value represents the number of read I/O operations
the value represents the number of write I/O operations
the number of packets received by all the processes
the number of packets transmitted by all the processes
the number of bytes received by all the processes
the number of bytes transmitted by all the processes
the number of packets received by the application AUA
the number of packets transmitted by the application AUA
the number of bytes received by the application AUA
the number of bytes transmitted by the application AUA
the length of the domain name
the number of unique characters in the domain name
entropy of the domain name
TTL-periods (mode, median, average value)
the number of A-records corresponding to domain name in the incomig
DNSmessage
the number of IP-addresses concerned with the domain name
the average distance between the IP-addresses concerned with domain name
the average distance between the IP-addresses in the set of A-records for domain
name in the incoming DNS-message
number of unique IP-addresses in sets of A-records corresponding to the domain
name in the DNS-messages
FUR
ER
LP
FS
the average distance between unique IP-addresses in sets A-record corresponding
to the domain name in the DNS-messages
number of domain names that share IP-address corresponding to the domain
name
the sign of the usage of uncommon types of the DNS-records, or DNS-records
that are not commonly used by a typical client
entropy of the DNS-records, which are contained in the DNS-messages
maximum size of the DNS-messages about domain name
the sign of success of DNS-query
4.2</p>
      </sec>
      <sec id="sec-4-3">
        <title>Presentation of the Knowledge About the Cyberattacks As the Set of the Feature Vectors</title>
        <p>All the above-mentioned features are the base of the set of feature vectors X  xk kNX1 ,
where each of feature vector xk describes the botnet’ attack and the legitimate traffic,
N X – the  number of the feature vectors.
4.3</p>
      </sec>
      <sec id="sec-4-4">
        <title>Usage of the SVM-based inference engine for the malware detection</title>
        <p>The main task of the SVM-based inference engine is to assign feature vector xi to
class at at, where xi  X , at  A, A  {at }tNA1 , N A – is the number of classes, where
each class corresponds to one specified type of attacks, performed by malware. The
SVM-based inference engine makes a conclusion about the presence or absence of a
malware in the mobile device and detects the possible type of the malware.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <p>In order to evaluate the effectiveness of the malware detection based on proposed
method, experimental studies were conducted.</p>
      <p>The experimental part of the study involved the solving of the following tasks:
- to investigate the applicability of SVM for making decisions about the presence
of malware in the mobile device;</p>
      <p>- to evaluate the detection efficiency of the malware detection in the mobile
devices.
5.1</p>
      <sec id="sec-5-1">
        <title>Evaluation Setting</title>
        <p>
          In order to evaluate the technique’s, a detection accuracy tests using malware’s
samples were conducted. For this purpose, a mobile malware datasets [
          <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
          ] were
employed. Used datasets were divided into training T and evaluation (test) E datasets.
The training dataset includes 383 samples, 49.56% of which are malicious and the
reminder contains normal behaviors. The test dataset includes 403 samples, 55.77%
of which represent malicious behaviors.
        </p>
        <p>To retrieve information about the CPU consumption the top tool, which is able to
provide an overview of the CPU activity in real time, was used.</p>
        <p>To extract the features concerning the memory resource usage, system monitoring
tool vmstat and procrank tool were used.</p>
        <p>Since the tracking of the input-output activity information is disabled by default to
retrieve it the modification of the specific configuration file (depending on the kernel
and on the architecture of the device) was perfected and the kernel was recompiled.
With purpose of the collection of input-output activity information the iostat
command was used. To extract the features related to the use of the network, the means of
open source tool Android Device Monitor was used.</p>
        <p>
          Support vector machine was implemented using Matlab [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
5.2
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Performance Measures of the BotGRABBER System</title>
        <p>The experimental results were estimated via standard sensitivity (SN), specificity
(SP), and overall accuracy (Q) performance measures, taking into account the
quantity measures of True Positives (TP), True Negatives (TN), False Positives (FP), False
Negatives (FN):</p>
        <p>SN </p>
        <p>TP
(TP  FN )
, SP </p>
        <p>TN
(TN  FP)
, Q </p>
        <p>TP  TN
TP  TN  FP  FN
.</p>
        <p>(11)</p>
        <p>In order to investigate the SVM-based inference engine efficiency we used
different SVM kernel functions. Examples of classification results using linear, polynomial,
Gaussian, exponential, and B-Spline kernels are presented in Fig. 1.</p>
        <p>The process of classification is divided into several iterations.</p>
        <p>In the first iteration, the classification objects are divided into two classes:
malicious behavior and the benign one. Then classifiers divide objects into other two
classes, for instance: malicious behavior and spam bot. The next iterations separate
malicious behavior and other classes of malware and so on until all of them are totally
divided.</p>
        <p>Fig. 1 presents the placement of the classification objects on the 2-D plane and the
objects’ separation into two classes.</p>
        <p>Experimental results of different SVM classifiers elucidated that the linear and
polynomial classifiers had provided the worst results (Table 2). They were
characterized by longer execution times, and higher rates of the overall classification accuracy.</p>
        <p>Non-linear classifiers demonstrated better results, where B-Spline provided better
results than others did.</p>
        <p>
          For an experimental evaluation samples, the most effective classifier using the
SVM was the B-spline since it provided the greatest distance between hyperplanes,
the shortest time of evaluation, and the best accuracy of the classification. Given that,
it was employed as a basic kernel function in the SVM-based inference engine of the
proposed technique.
This subsection presents overall results of technique’s efficiency, taking into account
sensitivity, specificity, and the overall accuracy. Employing the datasets [
          <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
          ] this
stage involved the evaluation of the SVM-based inference engine accuracy concerning
each type of malware separately. The combined results are given in Table 3.
As the technique uses the SVM-based engine, there are several factors which may
affect the prediction accuracy. One of them is the diversity of used training samples.
Most conspicuously, that not all possible feature vectors, that describe different
malware classes, are adequately represented in the training set. Thus, system may be
further improved by choosing more refined set of malicious samples for each malware
classes.
        </p>
        <p>In order to increase the classification accuracy the SVM prediction may be further
improved by using different classification kernels, as well as the SVM optimization
procedure and new mobile malware classes (and its feature vector selection) may also
be improved.</p>
        <p>Results of the experiments demonstrated, that the technique achieves the best results
for detection of such mobile malware as DDoS, spyware, SMS malware, botnets, etc.</p>
        <p>At the same time, the efficiency of the system concerning rootkits is rather lower.
This is because the behavior of some malware is very similar to users’ ones and some
of malware’s features weren’t taken into account for the detection process.
7</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>A new technique for the mobile malware detection based on the malware’s network
features analysis is proposed. It uses SVM for malicious programs detection. The
novel approach provides the ability to detect malware in the mobile devices.</p>
      <p>As the inference engine for malware detection the support vector machine was
used. The detection process is performed by taking into account the malware’s
features, captured in the mobile devices.</p>
      <p>Experimental research showed that the SVMs are able to produce the accurate
classification results. Implementation of the SVM-based inference engine into the mobile
malware’s detection process allowed to obtain its mean detection accuracy up to
98.01%. Experiments demonstrated, that technique is able to detect different types of
malware in the range from 90.28 to 98.21%, while false positives is about 5%.
8</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <source>McAfee Mobile Threat Report Q1</source>
          ,
          <year>2019</year>
          , https://www.mcafee.com /enterprise/enus/assets/reports/rp-mobile
          <source>-threat-report-2019</source>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>AV-Comparatives Security</surname>
            <given-names>Survey</given-names>
          </string-name>
          ,
          <year>2019</year>
          , https://www.av-comparatives.org/wpcontent/uploads/2019/02/Security_Survey_
          <year>2019</year>
          <article-title>_en</article-title>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Amro</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Personal Mobile Malware Guard PMMG: a mobile malware detection technique based on user's preferences</article-title>
          .
          <source>IJCSNS International Journal of Computer Science and Network Security</source>
          , Vol.
          <volume>18</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>18</fpage>
          -
          <lpage>24</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Idrees</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rajarajan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Conti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahulamathavan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Pindroid: a novel android malware detection system using ensemble learning methods</article-title>
          .
          <source>Computers &amp; Security</source>
          , Vol.
          <volume>68</volume>
          , pp.
          <fpage>36</fpage>
          -
          <lpage>46</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chaba</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pant</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dave</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Malware Detection Approach for Android systems Using System Call Logs</article-title>
          ,
          <source>arXiv preprint arXiv:1709.0880</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>McLaughlin</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinez del Rincon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>B</given-names>
          </string-name>
          , et al.:
          <article-title>Deep android malware detection</article-title>
          .
          <source>In Proc. of the Seventh ACM on Conference on Data and Application Security and Privacy</source>
          , pp.
          <fpage>301</fpage>
          -
          <lpage>308</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Varsha</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinod</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dhanya</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Identification of malicious android app using manifest and opcode features</article-title>
          .
          <source>Journal of Computer Virology and Hacking Techniques</source>
          , Vol.
          <volume>13</volume>
          , Issue 2, pp.
          <fpage>125</fpage>
          -
          <lpage>138</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mariconti</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Onwuzurike</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andriotis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Cristofaro</surname>
          </string-name>
          , et al.:
          <article-title>MaMaDroid: Detecting Android Malware by Building Markov Chains of Behavioral Model (Extended Version)</article-title>
          .
          <source>ACM Trans. Priv. Sec.</source>
          , Vol.
          <volume>1</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>33</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mirzaei</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suarez-Tangil</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tapiador</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>M.de Fuentes</surname>
          </string-name>
          , J.: Triflow:
          <article-title>Triaging android applications using speculative information flows</article-title>
          .
          <source>In Proc. of the 2017 ACM on Asia Conference on Computer and Communications Security</source>
          , pp.
          <fpage>640</fpage>
          -
          <lpage>651</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pomorova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>DNS-based anti-evasion technique for botnets detection</article-title>
          .
          <source>In Proc. of the 8th International Conference Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)</source>
          , Vol.
          <volume>1</volume>
          , pp.
          <fpage>453</fpage>
          -
          <lpage>458</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Pomorova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Antievasion technique for the botnets detection based on the passive DNS monitoring and active DNS probing</article-title>
          .
          <source>In Proc. of the 23rd International Conference, CN</source>
          <year>2016</year>
          , Computer Networks, pp.
          <fpage>83</fpage>
          -
          <lpage>95</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Information Technology for Botnets Detection Based on Their Behaviour in the Corporate Area Network</article-title>
          .
          <source>In Proc. of the 24th International Conference, CN</source>
          <year>2017</year>
          , Computer Networks, pp.
          <fpage>166</fpage>
          -
          <lpage>181</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Self-adaptive System for the Corporate Area Network Resilience in the Presence of Botnet Cyberattacks</article-title>
          .
          <source>In Proc. of the 25th International Conference, CN</source>
          <year>2018</year>
          , Computer Networks, pp.
          <fpage>385</fpage>
          -
          <lpage>401</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Weston</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chapelle</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pontil</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poggio</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Vapnik</surname>
          </string-name>
          , V.:
          <article-title>Feature selection for SVMs</article-title>
          .
          <source>In Proc. of the 2000 Neural Information Processing Systems (NIPS) Conference</source>
          , pp.
          <fpage>668</fpage>
          -
          <lpage>674</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Chapelle</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vapnik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bousquet</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Choosing multiple parameters for support vector machines</article-title>
          .
          <source>Machine learning</source>
          , Vol.
          <volume>46</volume>
          ,
          <string-name>
            <surname>Issue</surname>
          </string-name>
          1-
          <issue>3</issue>
          , pp.
          <fpage>131</fpage>
          -
          <lpage>159</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Foody</surname>
            ,
            <given-names>G. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mathur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A relative evaluation of multiclass image classification by support vector machines</article-title>
          .
          <source>IEEE Transactions on geoscience and remote sensing</source>
          , Vol.
          <volume>42</volume>
          , Issue 6, pp.
          <fpage>1335</fpage>
          -
          <lpage>1343</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Support vector machines: optimization based theory, algorithms, and extensions</article-title>
          .
          <source>Chapman and Hall/CRC, Data Mining and Knowledge Discovery Series</source>
          ,
          <volume>363</volume>
          p. (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schölkopf</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smola</surname>
            ,
            <given-names>A. J.:</given-names>
          </string-name>
          <article-title>Kernel methods in machine learning</article-title>
          .
          <source>The annals of statistics</source>
          , Vol.
          <volume>36</volume>
          , No.
          <volume>3</volume>
          (
          <issue>2008</issue>
          ), pp.
          <fpage>1171</fpage>
          -
          <lpage>1220</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Larranaga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atienza</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diaz-Rozo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , et al.:
          <article-title>Industrial Applications of Machine Learning /</article-title>
          CRC Press, 336 p (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>Forensic</given-names>
            <surname>Blog</surname>
          </string-name>
          . Available: https://forensics.spreitzenbarth.de/android-malware/
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Canfora</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Medvet</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mercaldo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Visaggio</surname>
            ,
            <given-names>C. A.</given-names>
          </string-name>
          :
          <article-title>Acquiring and analyzing app metrics for effective mobile malware detection</article-title>
          .
          <source>In Proc. of the 2016 ACM on International Workshop on Security And Privacy Analytics</source>
          . ACM., pp.
          <fpage>50</fpage>
          -
          <lpage>57</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>22. The Drebin Dataset, https://www.sec.cs.tu-bs.de/~danarp/drebin</mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <article-title>Android malware genome project</article-title>
          , http://www.malgenomeproject.org
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>24. MathWorks, https://www.mathworks.com/</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>