<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Samal Mukhtar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Seonah Lee</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Gyeongsang National University</institution>
          ,
          <addr-line>Jinju-daero 501, Jinju, 52828</addr-line>
          ,
          <country>Republic of Korea</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>As bug reports are often duplicated, researchers have proposed detecting and classifying duplicate bug reports. Researchers also utilized the duplicated relationships of bug reports to summarize a bug report. However, to the best of our knowledge, the previous bug report summarization is limited to single document summarization techniques. In this paper, we propose applying a multi-document summarization technique to duplicate bug reports so as to obtain more informative summaries. In our work, we demonstrate the results of summarizing duplicate bug reports with our multi-document summarization technique and discuss our future research direction.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Bug Report Summarization</kwd>
        <kwd>Multi-document Summarization</kwd>
        <kwd>Duplicate Issue Reports</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>If we generate good summaries of any text, we
can easily understand and analyze the text. Up to
now, various techniques and methods have been
developed for text summarization. However,
there are no universal methods that show high
performance, because, according to a document
type, text features to be used for text
summarization will be different. Therefore, we
need to focus on a specific document type to
improve the quality of final summary results.</p>
      <p>
        Bug report summarization is one of areas that
require text summarization methods. Many
researchers have conducted studies in this area.
However, few have investigated the impact of
duplicate bug reports on bug report
summarization. On the one hand, duplicates are
much desirable, so developers and researchers
sought to reduce the number of duplicate bug
reports. Meanwhile, we believe that, to some
extent, duplicates may contain additional
information that can be useful for developers to
perform tasks such as localization and bug
detection [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Therefore, it would be useful to
summarize duplicate bug reports to provide more
informative summaries.1
      </p>
      <p>
        Therefore, we sought to apply an existing
multi-document summarization method [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to
duplicate bug reports. To evaluate our work, we
collected 17 sets of duplicate bug reports. Overall
we applied two methods [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ][
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Using these
methods, we evaluate the potential of
summarizing duplicate bug reports. As our
evaluation method, we compared generated
results with manually annotated summaries. We
use Rouge-1 (R-1) and Rouge-2 (R-2) as
evaluation metrics.
      </p>
      <p>The rest of this paper is organized as follows.
Section 2 describes the background of used
algorithms and methods. Section 3 describes
applied approaches. Section 4 discusses results.
We conclude in Section 5.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>In this section of the work, we would like to
briefly explain methods and algorithms used in
the approaches.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1. Term frequency–inverse document frequency</title>
      <p>The Term frequency–inverse document
frequency (TF-IDF) is a numerical statistic that
reflects how important a word is to a document in
a collection or corpus. The TF-IDF value
increases proportionally to the number of times a
word appears in the document. It is offset by the
number of documents in the dataset that contain
the word, which helps to adjust for the fact that
some words appear more frequently in general.
2.2.</p>
    </sec>
    <sec id="sec-4">
      <title>Centroid-based Clustering</title>
      <p>
        The centroid-based method is often used in
text summarization to determine salient sentences
in a document set. A sentence vector is
represented based on the TF-IDF of containing
words. A word can be a centroid of the sentence
if its TF-IDF value is greater than a given
threshold. To summarize, creation used sentences
containing multiple centroid words. In text
summarization, the centroid-based method
eliminates the information overlap, in summary,
using the cosine measure [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
2.3.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Maximal Marginal Relevance</title>
      <p>
        The original Maximal Marginal Relevance
(MMR) solves the information retrieval problem
to measure the relevance between the user query
and sentences in the document [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The main
point of applying MMR is to eliminate redundant
information in summary. So the main
components of the input document should be
defined as the main topics and sentences relevant
to the main issues, then eliminate redundant
penalties whose similarity with existing
sentences, in summary, is more significant than a
certain threshold.
      </p>
    </sec>
    <sec id="sec-6">
      <title>3. Proposed approaches</title>
      <p>3.1.</p>
    </sec>
    <sec id="sec-7">
      <title>Approach 1</title>
      <p>
        The first approach was proposed by Hai et al.
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Fig. 1(a) illustrates the approach scheme. The
method includes a k-means clustering algorithm
combined with a centroid-based process, maximal
marginal relevance, and sentence positions.
Therefore, the technique effectively finds salient
sentences and prevents overlapping between
sentences. That multi-document summarization
system consists of two main modules: Input
processing and Summarization.
      </p>
      <p>The first module includes stop words removal,
word stemming, and converting input sentences
into a vector. A bag of words is used as the most
straightforward way for vector representation.
However, the method of using a bag of words does
not contain the semantic meaning of the sentence,
so Word Embedding is integrated into a system to
help compute the semantic relationships among
sentences. As a model, they used Google's
pretrained Word2vec. Regardless of the architecture
of the embedding model, the primary function is
to take the data as input and try to predict words.
Total embedding vectors are the input for the next
module.</p>
      <p>The second module starts with the k-mean
algorithm, which groups input embedding vectors
of sentences from input documents into clusters.
As a result, we have candidate Sentences that can
include in the summary. However, not all the
cluster sentences are appropriate and may be too
poor, so the centroid-based method is applied to
get the most critical sentences among the output
sentences of k-means. Then, the MMR is used to
remove redundancy sentences from the output of
the centroid-based module. Finally, information
about sentence positions is used to put selected
sentences in the correct order in summary.
3.2.</p>
    </sec>
    <sec id="sec-8">
      <title>Approach 2</title>
      <p>
        The second approach is more simplified,
which consists of the TF-IDF word frequency and
the Relative sentence location in documents [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
The scheme is illustrated in Fig. 1(b). It can be
divided into two steps: text preprocessing and
score assignment.
      </p>
      <p>For the preprocessing, the approach uses the
standard NLTK library. This step contains word
tokenization and stemming.</p>
      <p>The second step of the approach assigns scores
to each sentence in the input document based on
the sum of text feature values. Features are
relevance to the topic, length of the sentence,
sentence position, and TF-IDF frequency value.
Following the approach, the most important
sentences are from the input document's
beginning and end. Also, short sentences are not
as valuable as long ones. Sentences with the
highest sum of feature scores are selected to be in
the final summary.</p>
    </sec>
    <sec id="sec-9">
      <title>4. Experimental Setup 4.1.</title>
    </sec>
    <sec id="sec-10">
      <title>Duplicate Bug Reports</title>
      <p>To evaluate the quality of generated
summaries, we take duplicates of 17 bug reports.
Among them, only two bug reports contain more
than two duplicates. Overall, we applied 35
summaries. During the analysis of generated
summaries, we noticed no difference between
those with two duplicates and those with three or
two. Thus, the number of duplicates doesn’t make
a difference in bug report summarization.
4.2.</p>
    </sec>
    <sec id="sec-11">
      <title>Evaluation Metrics</title>
      <p>We apply the ROUGE toolkit to evaluate our
experimental results from the position of
readability. The tool measures the quality of
generated summaries by counting continuously
overlapping units between the summaries and the
ground truth. As n-gram ceiling units in the
ground truth, we use 1 and 2.</p>
      <p>In Formula 1, the denominator is the number
of the n-gram in the ground truth (GT), and the
numerator is the number of n-gram ceiling units
between generated summaries (s) and GT.
 −  =
∑ ∈ ∑
∑ ∈ ∑
∈
∈
(
(
)
) (1)</p>
    </sec>
    <sec id="sec-12">
      <title>5. Experimental Results 5.1.</title>
    </sec>
    <sec id="sec-13">
      <title>Quantitative Results</title>
      <p>As for the quantitative one, Fig. 3 illustrates
average Rouge-1 and Rouge-2 scores for the data
on two approaches. Regarding the figure,
Approach 1 got 0.52 and 0.33 for R-1 and R-2,
respectively. Approach 2 shows higher results for
2% and 10% for R-1 and R-2, respectively.
However, this may be since the information
generated by the second model are slightly larger
in volume. At the same time, the results of the first
one are somewhat shorter compared to the golden
summary.</p>
      <p>We provide qualitative results to understand
how length can affect the quality and overall
content of generated summaries. Fig. 2 illustrates
the contents of three documents: the summary
generated with the first method, the second
method, and the human-annotated golden
summary. The figure clearly shows a slight
difference in the length of the reports compared to
the golden summary. However, this does not
significantly affect the quality of the summary
since there are no repetitions of sentences that are
identical in meaning, which is the primary
concern when working with duplicates.</p>
    </sec>
    <sec id="sec-14">
      <title>5.3. Single vs Duplicate Bug Report</title>
    </sec>
    <sec id="sec-15">
      <title>Summarization</title>
      <p>
        Since we aim to show the difference between
bug reports with duplicates and single bug reports,
we experiment with the T5 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] model that
achieves state-of-the-art results on many
benchmarks covering not only summarization but
also question answering, classification, etc. We
use the same 17 sets of bug reports as data but
without duplicates. Since our ground truth
summaries also contain extracted sentences from
duplicates, we assume it is incorrect to calculate
Rouge scores of bug reports without duplicates
because there is a high probability of getting
prolonged values. Instead, we manually compare
summaries generated with and without duplicates
regarding the content.
      </p>
      <p>
        When summarizing the text, it is essential to
include important information such as the bug
behavior, steps to reproduction, and possible
solution [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. However, sometimes even in the
original reports, these data may need to be
included. We compare 10 of 17 summaries
regarding the above valuable components.
      </p>
      <p>Summarizing the results of the qualitative and
quantitative analysis, we believe that the
duplicates performed relatively well for
summarization with models not explicitly trained
for bug reports. Moreover, using duplicates for
bug report summarization guarantees more
informative summaries. It gives positive
expectations for the future in case of using models
adapted to bug reports with all text preprocessing
steps, including text features.</p>
    </sec>
    <sec id="sec-16">
      <title>6. Conclusion</title>
      <p>We implemented the task of bug report
summarization on two multi-document
approaches. One is an unsupervised machine
learning algorithm, and the second method
includes a k-means clustering algorithm,
combining with the centroid-based method,
maximal marginal relevance, and sentence
positions. To evaluate the performance of
summarizing duplicate bug reports, we took 17
examples of bug reports with duplicated ones.
Thus, we provided satisfying quantitative and
qualitative results even with models not designed
for bug reports. Our experiments have shown that
duplicates can be excellent used to make
summaries more informative, while
multidocument summarization techniques can reduce
the redundant contents. With such results, we will
continue to improve the performance by
developing multi-document summarization
techniques for duplicate bug reports, where we
will take into account all the features of
documents.</p>
    </sec>
    <sec id="sec-17">
      <title>7. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bettenburg</surname>
            <given-names>N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Premraj</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zimmermann</surname>
            <given-names>T</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Kim S</surname>
          </string-name>
          <article-title>Duplicate bug reports considered harmful…really?</article-title>
          <source>In: 2008 IEEE International Conference on Software Maintenance</source>
          . IEEE;
          <year>2008</year>
          :
          <fpage>337</fpage>
          -
          <lpage>345</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Hao</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feng</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            <given-names>JA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen Z. Ctras</surname>
          </string-name>
          :
          <article-title>Crowdsourced test report aggregation and summarization</article-title>
          .
          <source>In: 019 IEEE/ACM 41st International Conference on Software Engineering (ICSE)</source>
          . IEEE;
          <year>2019</year>
          :
          <fpage>900</fpage>
          -
          <lpage>911</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H. C.</given-names>
            <surname>Manh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. Le</given-names>
            <surname>Thanh</surname>
          </string-name>
          and
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Minh</surname>
          </string-name>
          ,
          <article-title>"Extractive multi-document summarization using k-means centroid-based method mmr and sentence position"</article-title>
          <source>in Proceedings of the Tenth International Symposium on Information and Communication Technology ser. SoICT</source>
          <year>2019</year>
          , New York, NY, USA:Association for Computing Machinery, pp.
          <fpage>29</fpage>
          -
          <lpage>35</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Rossiello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Basile</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Semeraro</surname>
          </string-name>
          .
          <article-title>Centroid-based Text Summarization through Compositionality of Word Embeddings</article-title>
          .
          <source>In Proceedings of the MultiLing 2017 Workshop on Summarization and Summary Evaluation Across Source Types and Genres</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          . Valencia, Spain,
          <year>2017</year>
          , pp.
          <fpage>12</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Güneş</surname>
            ,
            <given-names>Erkan</given-names>
          </string-name>
          &amp; Radev,
          <string-name>
            <surname>Dragomir.</surname>
          </string-name>
          (
          <year>2004</year>
          ).
          <article-title>LexPageRank: Prestige in Multi-Document Text Summarization</article-title>
          .
          <fpage>365</fpage>
          -
          <lpage>371</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Jaime</given-names>
            <surname>Carbonell</surname>
          </string-name>
          and Jade Goldstein.
          <year>1998</year>
          .
          <article-title>The use of MMR, diversity-based reranking for reordering documents and producing summaries</article-title>
          .
          <source>In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '98)</source>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <fpage>335</fpage>
          -
          <lpage>336</lpage>
          . https://doi.org/10.1145/290941.291025
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Reichold</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <source>Multi-document news article summarizer</source>
          ,
          <year>2018</year>
          . URL: https://github.com/lukereichold/NewsSummarizer
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Raffel</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matena</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , and Liu,
          <string-name>
            <surname>P.J. Exploring</surname>
          </string-name>
          <article-title>the limits of transfer learning with a unified text-to-text transformer</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          .
          <volume>21</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <article-title>BugSum: Deep Context Understanding for Bug Report Summarization</article-title>
          .
          <source>IEEE International Conference on Program Comprehension (IEEE Computer Society</source>
          ,
          <year>2020</year>
          ), pp.
          <fpage>94</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>