<!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>Mediaeval 2021 Emerging News: Detection of Emerging News from Live News Stream Based on Categorization of News Annotations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Omar Meriwani</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Scientific Editor</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Real Sciences website</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>magazine omar.meriwani@gmail.com</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>omar@real-sciences.com</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <fpage>13</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>This paper describes the contribution of RS_OMERIWANI in the Mediaeval 2021 Emerging News task. Among the various definitions of emerging news, this work is based on the definition of emerging news as the type of news that would gain more attention from news sources, i.e. higher frequency in publishing the same news. Relying on the categorization of the news annotations, the classification process has been completed through an unsupervised clustering to generate training data for a supervised neural network model that classifies the news based on the categories that are mentioned in it. The accuracy score for the final model was 74%, with a 65% F-Score for detecting emerging news. The final model fulfilled the requirements of newsworthiness and completeness of reported events as well as the relevance criteria in the task evaluation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 INTRODUCTION</title>
      <p>Journalism is in an ongoing challenge of detecting news
angles [1] that both interest the readers and satisfy the objectivity
requirements of news. Giving this mission to the computer,
requires specifying the exact meaning of emerging news, such as
the different concepts discussed in [2]. This paper describes the
contribution of RS_OMERIWANI in the Mediaeval 2021 Emerging
News task [3].</p>
      <p>Having sufficient news samples, it is possible to have the
computer perform the first part of this task, allowing for
automation of the selection process of determining emerging
news. News usually gets unbalanced interest from news sources;
some news stories get published in more than ten main sources of
news within a specific country/region/language, while some other
news never gets the same level of attention, being published only
in one or two sources.</p>
      <p>This work is done using supervised and unsupervised machine
learning models and by relying on categories to find the news that
has higher chances of getting published more frequently in the
media.</p>
    </sec>
    <sec id="sec-2">
      <title>2 APPROACH AND METHODS</title>
      <p>Our approach focuses on what the more frequently published
news could be, and, on news annotations provided from the News
Hunter platform [4] which can provide both the news live stream
as well as the fine categorization of named entities that are
mentioned in the news.</p>
      <p>In Table 1, we can see some of the news samples with the number
of times they got published during the same two-hour time
window. Some gain a lot of attention while others never get
published by more than one or two news sources.</p>
      <p>News
Haitian gang leader threatens to kill
kidnapped missionaries
Last Known Photos Of Brian Laundrie &amp;
Gabby Petito Together
UK palace says queen, 95, spent night in
hospital for checks
Braun Strowman Says WWE Turned Him
Into A Corporate Monster
Record number of daily vaccinations in
Dominican Republic
EXCLUSIVE: Vicki Gunvalson Addresses
Breakup With Steve Lodget
Frequenc</p>
      <p>y
26
11
14
1
1
2</p>
      <p>This approach is based on the preference of media channels,
regardless of any deep analysis of the news content. We assume
that the attention that some news articles may get is based on the
nature of named entities it deals with, for example, the first sample
in Table 1 contains the following categories:
a gang leader, an island, and members of a religious group
(missionaries).</p>
      <p>It seemed more interesting than the fourth sample which has
categories combination that includes:
American, wrestler, World Wrestling Entertainment</p>
      <p>
        To achieve this approach, the work is divided into two parts:
1- Finding similar news: Using a technique to cluster the
similar news together, we created new labels based on
the clustering results, and labelled the final training
dataset with 1 or 0 based on the threshold of appearing
three times or more. For example, the first new rows in
Table 1 would be labeled as (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and the latter three rows
2would be labeled as 0. The label (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) indicates the
emerging news.
      </p>
      <p>
        Supervised classification: Using the resulting dataset,
we have vectorized the categories of the news
annotations and used the vector representation as a
training data for an artificial neural network to predict
the labels mentioned in the previous step, either (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) for
emerging news or (0) for other news.
2.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Unsupervised news clustering</title>
      <p>News titles were transformed using a term frequency–
inverse document frequency (TFIDF) vectorizer [5] in order to
create vectors that could be used in the clustering algorithm.</p>
      <p>K-Means algorithm was used to make N/2 clusters of the
original news dataset with total N samples. In that way, it’s
assumed that the number of clusters will be no less than half the
total number of samples, enabling us to detect the similarity of the
news more accurately.</p>
      <p>Due to the computational complexity of the clustering using
a high number of clusters, the original dataset of ~50K news
samples was divided into 7 batches.</p>
      <p>
        The final dataset included 12,667 news samples. 4,879 of
them had been published three times or more by different news
sources, and 7,788 news samples had only been published once or
twice. The clusters were used to create labels that indicate
clusters, and the news within the same cluster were labeled as (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
or (0) according to the cluster size, the data was also balanced for
labels (0) and (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ).
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Supervised classification</title>
      <p>After the news dataset was created mainly by the indicators
provided by K-means clustering, the results were ready for
supervised learning model that can classify the data using different
set of features, namely, the categories of news annotations. The
News Hunter platform already provides annotations for the main
named entities and a set of classes for these annotations. We used a
count vectorizer for each news’ categories set.</p>
      <p>We used a multiple-layers perceptron with hidden layers sizes
of (20,20,20). The data was divided into 2:8 for testing and training.</p>
      <p>The output format was then structured by returning the news
titles of emerging news as well as the keywords that were extracted
using the Single Rank algorithm [6] which is implemented in the
Kex Python package.</p>
    </sec>
    <sec id="sec-5">
      <title>3 RESULTS</title>
      <p>
        The accuracy achieved by the model was 74%, while the
Fscore for emerging news detection was 65%. Precision for
emerging news – label (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) – is shown in Table 2, which is close to
the precision of label (0). Based on the recall score, it could be said
that the model may flag many varieties of annotations’ categories
as false negatives.
      </p>
      <p>The independent human evaluation results stated about
whether the newsworthiness and completeness requirements
were satisfied: “Yes, the information provided brings insights that
can conform an event and provides extra information with the
keywords that can help to get a fast overview of the reported
story. The keywords add some extra information which is not
present in the title, helping the journalist to better understand the
event.”. The evaluation also described the relevance aspect:
“provides potentially relevant events for journalist or not widely
covered events that may have not been yet seen by journalists”</p>
    </sec>
    <sec id="sec-6">
      <title>4 DISCUSSION</title>
      <p>Categories of named entities or annotations in the news could
be used as an auxiliary feature to support more comprehensive
models. However, the results of categories alone have could fail to
detect some emerging news by flagging them as false negatives.
Some aspects would still not be covered, such as the sentiments of
verbs that indicate violence which may usually get more
attention.</p>
      <p>The final output that could be extracted using this method also
lacks some features that would make it rich enough to be more
realistic for journalists.</p>
      <p>However, the model would still be efficient for working with
poor news details; it can work regardless of the text length, links
availability, or titles format, because it is only based on the
categories of the main entities. Logically it can work on many
cases when it deals with the abstract attributes of the named
entities that are mentioned in the news.</p>
      <p>Emerging News: Detecting emerging stories from social media and news feeds
[5] T. Joachims, "A Probabilistic Analysis of the Rocchio
Algorithm with TFIDF for Text Categorization,"
Carnegiemellon univ pittsburgh pa dept of computer science, 1996.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Marc</given-names>
            <surname>Gallofré</surname>
          </string-name>
          Ocaña and Andreas Lothe Opdahl.
          <year>2020</year>
          .
          <article-title>Challenges and opportunities for journalistic knowledge platforms</article-title>
          .
          <source>Proceedings of the CIKM 2020 Workshops. Galway</source>
          , Ireland.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Marc</given-names>
            <surname>Gallofré</surname>
          </string-name>
          <string-name>
            <surname>Ocaña</surname>
          </string-name>
          , Lars Nyre, Andreas Lothe Opdahl, Bjørnar Tessem, Christoph Trattner,
          <string-name>
            <given-names>Csaba</given-names>
            <surname>Veres</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Towards a big data platform for news angles</article-title>
          .
          <source>The 4th Norwegian Big Data Symposium (NOBIDS).</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Marc</given-names>
            <surname>Gallofré</surname>
          </string-name>
          <string-name>
            <given-names>Ocaña</given-names>
            , Andreas L. Opdahl and
            <surname>Duc-Tien</surname>
          </string-name>
          Dang-Nguyen.
          <year>2021</year>
          .
          <article-title>Emerging News task: Detecting emerging events from social media and news feeds</article-title>
          .
          <source>MediaEval'21: Multimedia Evaluation Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Arne</given-names>
            <surname>Berven</surname>
          </string-name>
          , Ole A.
          <string-name>
            <surname>Christensen</surname>
          </string-name>
          , Sindre Moldeklev, Andreas L.
          <string-name>
            <surname>Opdahl</surname>
            , and
            <given-names>Kjetil J.</given-names>
          </string-name>
          <string-name>
            <surname>Villanger</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>News Hunter: building and mining knowledge graphs for newsroom systems</article-title>
          . NOKOBIT.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C. G.</given-names>
            <surname>Broyden</surname>
          </string-name>
          ,
          <article-title>"The convergence of single-rank quasiNewton methods,"</article-title>
          <source>Mathematics of Computation, no. 24.110</source>
          , pp.
          <fpage>365</fpage>
          -
          <lpage>382</lpage>
          ,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>