<!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>Analysis of the Characteristics and Causes of Underestimated Bug Reports*</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Exactpro Systems</institution>
          ,
          <addr-line>Moscow, Russia https://exactpro.com</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The bug- xing process requires software maintenance resources. Usually, defects are submitted, xed and closed, but sometimes they have to be reopened because of a change of resolution. It happens when a defect was evaluated incorrectly at the beginning. This problem can increase maintenance costs and software quality in general. In this paper, we investigate the characteristics of such defects and their bug reports and call them \underestimated". Our research is based on general statistical indicators and text descriptions of defect reports. We propose using di erent methods of feature selection and ranking in order to reveal the signi cant terms of such defects. The top of signi cant terms of the underestimated bug reports can help to nd the root causes of such life cycles.</p>
      </abstract>
      <kwd-group>
        <kwd>Defect management</kwd>
        <kwd>Bug report</kwd>
        <kwd>Feature selection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Defect management is an essential part of improving the technical stability of
software. Usually, software companies use bug-tracking systems (BTS) in order
to manage defects. Structured information about defects is a big advantage of a
BTS, where a bug is represented as a set of attributes. Gathering data from bug
reports allows us to accumulate statistics, we also use these data for predictions
and analysis.</p>
      <p>
        The knowledge of defect statistics and the defect management strategy helps
to create an e ective approach to defect prevention because it can help to
reduce bug migration into the later stages of development [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. So, the accumulated
statistics of bug reports can reveal possible problem aspects. For example,
reopened bugs belong to a problem area like this because they take considerably
longer to resolve [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. However, for the purposes of this paper, we are
investigating not just the reopened bugs, but also the defects which were once rejected,
considered a non-defect or non- xable, and now having a \Done" or a \Fixed"
* Copyright c 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0)
resolution. It means that they could have been evaluated incorrectly, setting a
precedent for future misjudgments. Thus, they need to be analysed as a potential
problem of software development. In subsection 4.1, we demonstrate the
calculations for several indicators, such as time to resolve, count of comments, priority,
etc. that prove this assumption.
      </p>
      <p>We would also like to notice that our work is devoted to revealing the reasons
of underestimated defect reports more than their future classi cation. Our goal
is to understand the nature of such bug reports via the feature selection and
ranking methods. Thats why we mainly investigated the top list of terms.</p>
      <p>We claim the following contribution in this work:
{ We reveal special characteristics of underestimated bug reports.
{ We propose using di erent methods of feature selection and ranking for
determining the most signi cant terms of underestimated bug reports.
{ We conduct an analytical study to investigate the potential causes of the
initial resolution of such bug reports via the most signi cant terms.</p>
      <p>The remainder of this paper is organized as follows: in Section 2, we present
an overview of the related work; in Section 3, we describe the structure of a defect
report; in Section 4, we outline the process of clustering. Further, in Section 5,
we present the results of the experimental evaluations of this technique; and
Section 6 lists our conclusions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>There are many researchers who deal with analysis of bug reports which have
certain speci cs. They investigate the nature of these speci cs, the root causes
of their occurrence and ways to predict them.</p>
      <p>
        Zaineb and Manarvi analysed the reasons of bug rejection in order to
decrease the possibility of submission of invalid bug reports [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. They discovered
some causes of bug rejection and their impact on testing e ciency.
Zimmerman et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] propose to predict defect reopening. They analyse comments,
description, time to x and the components describing the defects. Shihab et al.
also investigate the problem of reopened bug reports [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. They used the
decision tree in order to predict whether a bug will be reopened after its closure.
Karim et al [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. investigated the key features of high-impact bug reports (HIB).
HIBs are defect reports which can signi cantly a ect the software development
process and product quality. The researchers considered several types of HIBs
and discovered the most frequent features provided by submitters in such bugs.
These features include the observed behaviour, the expected behaviour and code
examples. Similar features were detected by Chaparro et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. They analysed
the observed behaviour, the expected behaviour and steps to reproduce and
proposed linear Support Vector Machines to classify the description of bug reports.
Their text classi cation is based on N-grams.
      </p>
      <p>
        Gegick, Rotella and Xie proposed to classify bug reports into security and
non-security bug reports [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. They analyzed the description of defects and created
three lists: a start list (includes special terms from security bug reports), a stop
list (the classic list of stop words) and a synonym list (includes security-related
verbiage). In order to reduce the size of a term-by-document frequency matrix,
they used SVD. Peters et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] also investigated security bug reports. They
proposed a \FARSEC" framework that is used for ltering and ranking bug reports
for reducing the presence of security-related keywords. The framework is also able
to identify and remove non-security bug reports with security-related keywords.
They compared several machine learning algorithms such as random forest, Naive
Bayes, logistic regression and multilayer perceptron. Goseva-Popstojanova and
Tyo also analysed the problem of security bugs as crucial for software quality,
but they used supervised and unsupervised approaches[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        The problem of classifying issues into defects and non-defects is very popular
too. Antoniol et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] analyzed text attributes of bug reports. They compared
the results of three classi ers: logistic regression, decision tree, and Naive Bayes.
So, the research helped to classify the issues and determine the discriminating
terms. Herzig et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] investigated this problem as well. However, they
estimated misclassi cation, i.e. bias, in bug prediction models confusing bugs and
features. The researchers proposed manual data validation in order to improve
future studies. Terdchanakul et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] also identi ed if the description of the
issue corresponds to a bug or not. They used N-grams for text classi cation and
built classi cation models with the logistic regression and the random forest
methods.
      </p>
      <p>This review of the related work demonstrates the importance of
understanding the nature of di erent types of defects. The aforementioned researchers
investigate various speci c types of bugs and their potential life cycle stages. In our
work, we propose to consider the problem of underestimated defects as a special
case of the reopened bugs problem. In this paper, we investigate the submitted
bug reports which were reopened because, at some point, they were understood
and evaluated incorrectly. We aim to reveal the causes of such situations in order
to prevent them in the future and create possible recommendations.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Background</title>
      <p>Each bug report has its own life cycle. A life cycle depends on the characteristics
of the software development cycle, the proprietary and the domain aspects of the
project. During the life cycle, a defect report s priority, status, etc. can change.</p>
      <p>For this research, we only considered closed and resolved defects because only
such bugs have the values of Resolution, Time to resolve, Count of attachments,
Count of comments, etc., known for a fact. For the defects that have not been
closed or resolved, the values of these attributes are inde nite. We selected the
defects where Resolution has such values as \Done" or \Fixed" because they look
as ordinary. But then, we split them into two categories. The rst category |
called \type 1" | includes bug reports that have never been reopened because of
a change of resolution. It means that they have never been rejected or considered
a non-defect or non- xable. The second category | called \type 2" | includes
the defect reports that had an alternative resolution before they got a \Done"
or a \Fixed" resolution. These alternative resolutions could have such values as
\Rejected", \Won t Fix", \Not defect". In this paper, we called the bug reports
of type 2 \underestimated".</p>
      <p>
        We propose to compare the two types according to the following metrics:
{ time to resolve as an indicator of how expensive the defect report is [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],
{ count of comments and count of attachments because their abundance can
be an indicator of an insu cient defect description [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],
{ percentage of \Critical" and \Blocker" priority ,
{ the length of description.
      </p>
      <p>Thanks to this comparison, we can reveal the distinguishing characteristics
of underestimated defect reports.
4
4.1</p>
    </sec>
    <sec id="sec-4">
      <title>Approach</title>
      <sec id="sec-4-1">
        <title>Objects</title>
        <p>
          We extracted 45,341 bug reports from three di erent project communities on
JIRA, a popular bug-tracking system. They include open-source projects of
JBOSS [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], Jenkins [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] and Sakai [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. The comparative analysis of defect
reports of both types for all projects is presented in Table 1.
        </p>
        <p>As Table 1 shows, defect reports of type 2 have distinctive characteristics. The
bugs of type 2 require more time for xing than the bugs of type 1. They also have
a larger number of collateral comments and attachments. These characteristics
may be suitable for reopened defects or may not be suitable, such as in the case
of trivial reasons of reopening like addition of labels. So we prove that defects
of type 2 are \expensive-to-resolve" since they require a lot of human input and
time. Therefore it is important to investigate and prevent them.</p>
        <p>According to Table 1, defect reports of type 2 have \Blocker" to \Critical"
priorities, just like type 1. It means that underestimated defects are important
because they can lead to a situation when a Critical or a Blocker bug can persist
in the system for a long time and undermine software quality.</p>
        <p>The comparison of description lengths shows that the description of bugs of
type 2 is more complicated than \scarce text". It means that they can have a
detailed description, but, for some reasons, it was evaluated incorrectly.</p>
        <p>We propose to analyse the description of bug reports as a source of answers
as to why these defects became underestimated.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Text preprocessing</title>
        <p>The description of defect reports is in text format, so it needs to be transformed
via natural language processing methodologies. We made the following steps:
{ tokenization that chops the text into words,
{ removal of stop-words list that was expanded with names of months, week
days, the submitter and assignee s names, parts of logs, stack traces, etc.,
{ stemming that maps related words to their basic form and helps to reduce
the in ectional forms.</p>
        <p>
          Then, we built a \Bag of words" model. This vector model takes into account
the number of occurrences of each term, rather than the exact order of the terms.
Every bug report is presented as a vector of n terms. A set of bugs is presented
as corpora or matrix n m where n is the number of all terms, and m is the
number of all documents. If a term occurs in the bug-report, its value in the
vector is non-zero. We used TF-IDF weighting for computing these values [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>T F IDF = T F (t; d) IDF (t; D)
T F (t; d) =</p>
        <p>f req(t; d)
maxw2df req(w; d)
IDF (t; D) = log2( d 2 DjD: jt 2 D )
(1)
(2)
(3)</p>
        <p>
          Where freq(t,d) is term frequency, i.e. the number of times that term t
occurs in documentd ; maxw2df req(w; d) is the maximal frequency of any term in
document d ; d 2 D : t 2 D is the number of documents containing t ; D is the
corpus - the total document set [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
4.3
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>Proposed techniques</title>
        <p>
          We used the following methods of feature selection and ranking:
1) Chi-Squared is the common statistical test that measures the divergence
from the expected distribution, if one assumes that feature occurrence is actually
independent of the class value [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>
          2) Recursive feature elimination (RFE) is a recursive process that ranks
features according to some measure of their importance [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. At each iteration,
the importance of each feature is measured, and the least relevant one is removed.
The recursion is needed because, for some measures, the relative importance of
each feature can change substantially when it s evaluated against a di erent
subset of features during the stepwise elimination process. In this work, the
feature ranking method is based on the measure of the variables importance
given by SVM [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>
          3) Random forest is a method that builds an ensemble model of decision trees
from random subsets of features and bagged samples of the training data [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
Each tree grows on an independent bootstrap sample from the training data. For
each node, it is necessary to select m variables at random out of all M possible
variables (independently for each node) and nd the best split on the selected m
variables. Random forest classi ers can reveal feature importance, determining
how much each feature contributes to class prediction [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
4) Logistic regression is a classi er where the dependent variable is
dichotomous (binary). The logistic regression model is as follows:
(x1; : : : xn) = 1 + e 0+ 1 x1+:::+ n xn
e 0+ 1 x1+:::+ n xn
(4)
        </p>
        <p>
          Where xi are the characteristics describing the model, 2 [0; 1] is a value
on the logistic regression curve [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. A regression coe cient describes the size
and direction of the relationship between a predictor and the response variable.
Positive coe cients make the event more likely and negative coe cients make
the event less likely. A coe cient with a value near 0 implies that the e ect of
the predictor is small.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Results</title>
      <p>In the original bug report dataset, we marked bugs as 0 if they belong to type
1 and 1 if they belong to type 2. We matched each indexed defect report with
its class f0, 1g. This column was used by the feature selection and ranking
techniques.</p>
      <p>We built the top of the most signi cant terms with the aforementioned
feature selection and ranking techniques that include chi-square, recursive feature
elimination, features importance of random forest and coe cients of logistic
regression. The top 15 of the most signi cant terms of JBOSS, Jenkins and Sakai
projects is presented in Tables 2, 3, and 4.
Chi2 RFE Random Forest Logistic regression
cast , busi , import , cast ,
materi , capabl , color , request ,
osgi , connector , normal , event ,
busi , consequ , classexternallink , jar ,
constructor , day , lineheight , bundl ,
bundl , determin , condit , error ,
vdb , download , fonttyl , busi ,
network , end , error , osgi ,
comment , facet , le , open ,
request , includ , event , materi ,
jar , later , like , comment ,
spec , long , comment , constructor ,
lookup , network , fonteight , connect ,
redirect , osgi , properti , server ,
lot perform consol , vdb</p>
      <p>Having analysed the received results, we propose to split them into the
following groups of terms:
Chi2 RFE Random Forest Logistic regression
stdout , avoid , job , git ,
ssl , capac , build , server ,
dynam , correspond , error , password ,
testsuit , detect , con gur , stdout ,
password , ensur , password , error ,
wrapper , general , run , setup ,
certif , head , use , copi ,
stderr , increment , document , document ,
git , introduc , need , perforc ,
larg , jdk , testsuit , dynam ,
emailtext , listen , jenkin , upstream ,
perforc , previous , log , way ,
upstream , provis , poll , avail ,
setup , servic , follow , ndbug ,
gitssh strang long log
Chi2 RFE Random Forest Logistic regression
recommend , administr , user , recommend ,
desir , app , tool , appear ,
idea , applic , appear , addit ,
addit , breadcrumb , error , edit ,
retract , exit , recommend , resourc ,
exit , explicit , question , call ,
pool , role , use , desir ,
random , process , classexternallink , pool ,
uniqu , recommend , make , mean ,
person , retract , chang , entri ,
app , situat , info , inform ,
font , stay , click , idea ,
portfolio , trunk , screen , gradebook ,
audio , write , follow , creat ,
edit uniqu list requir
1) \Prejudiced term" are the terms that are connected with biased wording in
the software bug description. The text seems to be full of subjective assessment
or personal impression of the submitter. So the defect report may be considered
a \fancy" or just a wild guess. Examples of such terms are: idea, recommend,
desir, larg, strange, long, comment, etc. Below are some samples of use of these
terms extracted from the defect reports under analysis:
I think the idea is to . . .</p>
      <p>I recommend . . .
it would be more desirable . . .
unprofessional comments . . .
goes through after long time . . .
large log le . . .
there is something strange with . . .</p>
      <p>It is very important to isolate such terms and avoid them in the future defects
because they obscure the facts with subjectivity and increase the likelihood of
preserving a bug with a high or even critical and/or blocker priority in the
system.</p>
      <p>Some terms may seem as standard forms of politeness. But sometimes a
bug report is overloaded with such \terms of politeness", which can divert the
developers focus from the software problem itself.</p>
      <p>2) \False friend" terms are the terms that might seem useful and look organic
in a technical text, but, surprisingly, in the context of defect reports, they can
decrease the transparency and make the meaning ambiguous. The examples of
such terms are: error, perform, appear, document, con gur, etc. Some samples of
use of these terms extracted from the defect reports under analysis are presented
in Table 5.
Example of use of these terms Clari cation</p>
      <p>Ambiguous interpretation of \documentation"
The documentation claims that . . . leads to a misunderstanding between the
developer and the submitter.</p>
      <p>Add the name again and continue The lack of details about \non-appearance"
but the name does not appear . . . makes the bug non-reproducible.</p>
      <p>When trying to perform operation, The lack of details about what is being
the exception is thrown . . . performed can confuse the developer.
Some plugins fail to startup with The absence of conditions and details leads to a
the following error . . . biased assessment of the root cause.</p>
      <p>
        This group of terms is especially dangerous. The submitter describing a
software defect uses these terms and overlooks the details because he or she thinks
that the description is comprehensive.
3) Domain-related terms. Examples of such terms are: osgi, gitssh, retract,
gradebook, bundl, etc. Knowing them is very useful because it gives an
opportunity to reveal potential areas of testing [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] where defect reports have a high
probability of being underestimated.
      </p>
      <p>It is important to mention that these groups of terms can overlap. It means
that some areas of testing can be rather complicated, and there are more
possible cases for misunderstanding and underestimating a potential problem. For
example, the submitter describes user actions which are connected to one of the
areas of testing. He or she notices errors or exceptions. However, due to the
complexity of the area of testing and the fact that some necessary details are
missing, it is di cult for a developer to understand the cause of these results:
it is not obvious whether it is a possible defect or just an erroneous chain of
submitter s actions.</p>
      <p>We have compared the methods of feature selection and ranking and noticed
that chi-square is prone to place the \prejudiced" terms at the top, and the
feature ranking by random forests is prone to place the \false friend" terms at
the top. So they can be useful for revealing the words that can create a situation
where some facts or details are omitted.</p>
      <p>We also compared the methods of feature selection and ranking in order to
check their accuracy. We used the cross-validation technique for this task. The
received results are presented in Table 6. We discovered that the cases without
feature selection have lower accuracy values than others. According to Table 6,
Random Forest has the highest accuracy.
This paper is devoted to the problem of underestimated bug reports. These
are reports where the resolution of the described defect was changed from a
potentially incorrect one, such as \Reject", \Not a defect", etc., to an ordinary
one of \Done" or \Fixed".</p>
      <p>We have revealed the speci cs of such bug reports. They are long to resolve
and have a large number of collateral comments and attachments. They can be
considered as potentially problematic bugs, i.e. the defects that require human
and time resources.</p>
      <p>We have proposed several methods of feature selection and ranking in order
to build the top of the most signi cant terms. We used chi-square, recursive
feature elimination, features importance of random forest and coe cients of
logistic regression.</p>
      <p>We compared di erent methods of feature selection. We found out that the
cases without feature selection have lower accuracy values than others and
Random Forest has the highest accuracy among the methods.</p>
      <p>We have analysed the received tops of terms and proposed to split them
into three groups. The rst group - \prejudiced" terms - includes terms with
subjective assessment. The second group - \false friend" terms - consists of terms
with a potentially dangerous lack of details. The third group - domain-related
terms - includes terms associated with an area of testing. The analysis of these
groups can help understand the key problems of underestimated defects as well
as prevent them from occurring.</p>
      <p>In the nearest future, we plan to analyse each potentially problematic
resolution separately. We also plan to compare underestimated bug reports with
defects that have the nal resolution of \Rejected", \Won t Fix", etc. It can
provide a better picture of the speci cs of such defect reports. Consequently,
it can help to generate recommendations in order to reduce the occurrence of
underestimated bugs.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Antoniol</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ayari</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di</surname>
            <given-names>Penta</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Khomh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Gueheneuc</surname>
          </string-name>
          , Y.-G.:
          <article-title>Is it a bug or an enhancement?: A text-based approach to classify change requests</article-title>
          .
          <source>In Proc. 2008</source>
          Conf.
          <article-title>Center for Adv</article-title>
          .
          <source>Studies Collaborative Res.: Meeting Minds</source>
          ,
          <year>2008</year>
          , ser.
          <source>CASCON 08</source>
          , Article No.
          <volume>23</volume>
          . New York, NY, USA: ACM, pp.
          <fpage>304</fpage>
          -
          <lpage>318</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Breiman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Random Forests</article-title>
          .
          <source>Journal Machine Learning</source>
          , vol.
          <volume>45</volume>
          (
          <issue>1</issue>
          ), pp.
          <volume>5</volume>
          {
          <issue>32</issue>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chaparro</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zampetti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di</surname>
            <given-names>Penta</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Marcus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Bavota</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            and
            <surname>Ng</surname>
          </string-name>
          , V.:
          <article-title>Detecting Missing Information in Bug Descriptions</article-title>
          .
          <source>Proceedings of the 11th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering</source>
          , pp.
          <volume>396</volume>
          {
          <issue>407</issue>
          ,
          <year>2017</year>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Durgesh</surname>
            ,
            <given-names>K.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lekha</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Data classi cation using support vector machine</article-title>
          .
          <source>Journal of Theoretical and Applied Information Technology</source>
          <volume>12</volume>
          (
          <issue>1</issue>
          ),
          <volume>17</volume>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Freund</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          , Wilson, W.J.:
          <article-title>Regression Analysis: statistical modeling of a response variable</article-title>
          . San Diego: Academic Press (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Forman</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>An extensive empirical study of feature selection metrics for text classi cation</article-title>
          .
          <source>Journal of Machine Learning</source>
          , pp.
          <fpage>1289</fpage>
          -
          <lpage>1305</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gegick</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotella</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Identifying security bug reports via text mining: An industrial case study</article-title>
          .
          <source>In Proc. 7th IEEE Working Conf. Mining Software Repositories (MSR)</source>
          ,
          <source>May</source>
          <year>2010</year>
          , IEEE Computer Society,
          <fpage>11</fpage>
          -
          <lpage>20</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Goseva-Popstojanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tyo</surname>
          </string-name>
          , J.:
          <article-title>Identi cation of Security Related Bug Reports via Text Mining Using Supervised and Unsupervised Classi cation</article-title>
          .
          <source>2018 IEEE International Conference on Software Quality, Reliability and Security (QRS)</source>
          , Lisbon,
          <year>2018</year>
          , pp.
          <volume>344</volume>
          {
          <fpage>355</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gromova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Defect Report Classi cation in Accordance with Areas of Testing</article-title>
          . In: Itsykson V.,
          <string-name>
            <surname>Scedrov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zakharov</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>(eds) Tools and Methods of Program Analysis</article-title>
          .
          <source>TMPA 2017. Communications in Computer and Information Science</source>
          , vol
          <volume>779</volume>
          , pp.
          <volume>38</volume>
          {
          <fpage>50</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weston</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barnhill</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Vapnik</surname>
          </string-name>
          , V.:
          <article-title>Gene selection for cancer classi cation using support vector machines</article-title>
          .
          <source>Mach</source>
          . Learn.,
          <volume>46</volume>
          (
          <issue>1-3</issue>
          ), pp.
          <fpage>389422</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Herzig</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Just</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Zeller</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>It's not a bug, it's a feature: how misclassi cation impacts bug prediction</article-title>
          .
          <source>In Proceedings of the 2013 International Conference on Software Engineering (ICSE '13)</source>
          . IEEE Press, Piscataway, NJ, USA,
          <fpage>392</fpage>
          -
          <lpage>401</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hooimeijer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weimer</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Modeling bug report quality</article-title>
          .
          <source>In: ASE 07: Proceedings of the twenty-second IEEE/ACM International Conference on Automated Software Engineering</source>
          , pp.
          <volume>34</volume>
          {
          <issue>43</issue>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Karim</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ihara</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iida</surname>
          </string-name>
          , and H.,
          <string-name>
            <surname>Matsumoto</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Understanding key features of high-impact bug reports</article-title>
          .
          <source>In: 2017 8th International Workshop on Empirical Software Engineering in Practice (IWESEP)</source>
          ,
          <fpage>53</fpage>
          -
          <lpage>58</lpage>
          . IEEE (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schutze</surname>
          </string-name>
          , H.:
          <article-title>Introduction to Information retrieval</article-title>
          . New York: Cambridge University Press (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tun</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nuseibeh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Text ltering and ranking for security bug report prediction</article-title>
          .
          <source>IEEE Transactions on Software Engineering. 2017 Dec</source>
          <volume>27</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Shihab</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ihara</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamei</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ibrahim</surname>
            ,
            <given-names>W. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ohira</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adams</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hassan</surname>
            ,
            <given-names>A. E.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Matsumoto</surname>
          </string-name>
          , K.-I.:
          <article-title>Predicting re-opened bugs: A case study on the eclipse project</article-title>
          .
          <source>in Proc. 2010</source>
          17th
          <string-name>
            <given-names>Working</given-names>
            <surname>Conf</surname>
          </string-name>
          . Reverse Eng.,
          <year>2010</year>
          , ser.
          <source>WCRE 10</source>
          . Washington, DC, USA: IEEE Computer Society, pp.
          <fpage>249</fpage>
          -
          <lpage>258</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Suma</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nair</surname>
          </string-name>
          , TR.:
          <article-title>Defect management strategies in software development</article-title>
          .
          <source>arXiv preprint arXiv:1209.5573. 2012 Sep</source>
          <volume>25</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Terdchanakul</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hata</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Phannachitta</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Matsumoto</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bug or not? bug report classi cation using N-gram IDF</article-title>
          .
          <source>Proceedings of the 2017 IEEE International Conference on Software Maintenance and Evolution (ICSME)</source>
          , pp.
          <volume>534</volume>
          {
          <issue>538</issue>
          ,
          <string-name>
            <surname>Sept</surname>
            <given-names>2017</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Touw</surname>
            ,
            <given-names>W.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bayjanov</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Overmars</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Backus</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boekhorst</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wels</surname>
          </string-name>
          , M. and
          <string-name>
            <surname>van Hijum</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>Data mining in the Life Sciences with Random Forest: a walk in the park or lost in the jungle? Brie ngs in bioinformatics 14</article-title>
          , no.
          <issue>3</issue>
          (
          <year>2012</year>
          ):
          <volume>315</volume>
          {
          <fpage>326</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Zaineb</surname>
            ,
            <given-names>G</given-names>
          </string-name>
          and Manarvi,
          <string-name>
            <surname>I. A.</surname>
          </string-name>
          :
          <article-title>Identi cation and analysis of causes for software bug rejection with impact over testing e ciency</article-title>
          .
          <source>International Journal of Software Engineering &amp; Application</source>
          ,
          <volume>2</volume>
          (
          <issue>4</issue>
          ),
          <year>2011</year>
          , pp.
          <volume>71</volume>
          {
          <fpage>82</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Zimmermann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nagappan</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>P.J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Murphy</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Characterizing and predicting which bugs get reopened</article-title>
          .
          <source>In Proceedings of the 34th International Conference on Software Engineering</source>
          , pp.
          <volume>1074</volume>
          {
          <fpage>1083</fpage>
          . IEEE Press,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. JBossDeveloper, [Online]. Available at: https://developer.jboss.
          <source>org/welcome Accessed 27 jan 2019</source>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>23. Jenkins documentation, [Online]. Available at: https://jenkins.io/doc/ Accessed 27 jan 2019</mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. Sakai documentation, [Online]. Available at: https://www.sakaiproject.
          <source>org/documentation Accessed 27 jan 2019</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>