<!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>Baseline Algorithms for Predicting the Interest in News based on Multimedia Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andreas Lommatzsch</string-name>
          <email>andreas.lommatzsch@dai-labor.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Benjamin Kille</string-name>
          <email>benjamin.kille@dai-labor.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DAI-Labor, TU Berlin</institution>
          ,
          <addr-line>Berlin</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>29</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>The analysis of images in the context of recommender systems is a challenging research topic. NewsREEL Multimedia enables researchers to study new algorithms with a large dataset. The dataset comprises news items and the number of impressions as a proxy for interestingness. Each news article comes with textual and image features. This paper presents data characteristics and baseline prediction models. We discuss the performance of these predictors and explain the detected patterns.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The NewsREEL Multimedia tasks supplies participants with
diferent kinds of data. These include low-level features, image labels, and
texts. Thus, participants may apply a broad spectrum of machine
learning approaches. There is little existing work as NewsREEL
Multimedia represents the first task of its kind. The tasks’ overview
paper [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] presents an outline and detailed description.
      </p>
      <p>In this paper, we study ways to predict the popularity of news
items relying on multimedia data. We analyze diferences among
publishers, especially, how they afect the quality of predictions.</p>
      <p>The remainder of this paper is structured as follows: Section 2
analyzes the dataset. Subsequently, we introduce diferent
predictors (Section 3). Section 4 discusses the baseline results. Finally,
Section 5 concludes and suggests directions for future research.</p>
    </sec>
    <sec id="sec-2">
      <title>DATA DESCRIPTION</title>
      <p>The dataset covers thirteen weeks of four selected publishers. Three
publishers—17614, 13554, and 39234—make up most of the
impressions. Fig. 1 illustrates how the number of impressions is distributed.
We recognize the downward trend on the log-log plots. This
indicates power law distributed quantities. In other words, few articles
collect most attention whereas a majority of articles receives little
attention. As a result, the predictors must accurately pick the best
articles to perform well. The automatic annotators have assigned
a frequent subset of labels to articles. For publisher 17614, these
include ‘stage,’ ‘suit,’ and ‘wig.’ The dataset provides the labels
computed using six diferent labeler configurations. All annotators
rely on ImageNet, which had been trained on publicly available
images. The annotators difer with respect to the used frameworks
(Tensorflow, Keras) and the applied pre-trained network (VGG16,
VGG19, InceptionV3, ResNet50). The task incentivizes
participants to find the relation between configuration and performance.</p>
    </sec>
    <sec id="sec-3">
      <title>BASELINES</title>
      <p>NewsREEL Multimedia tasks the participants to find the news items
which users will read most frequently. The participating teams
must predict the number of impressions for each item listed in the
test weeks. We introduce three baseline strategies for predicting
the number of impressions: random, document-based, and
featurebased.
3.1</p>
    </sec>
    <sec id="sec-4">
      <title>Random</title>
      <p>The random baseline assigns each item a random non-negative
integer as number of impressions. This random guessing should be
the lower bound for all prediction strategies.
3.2</p>
    </sec>
    <sec id="sec-5">
      <title>Document-based Approach</title>
      <p>The document-based approach centers on the notion of document
similarity. The algorithm employs the basic concept of the k nearest
neighbor classifier [ 1, Chapter 4.4]. First, we represent each news
items as a bag of words. We obtain the words either from the
articles’ texts or image annotations. Next, we determine the ten
most similar news items by means of cosine distances amid their
term vectors. The computation exhibits linear complexity in the
number of news items. With the NewsREEL Multimedia dataset, the
computation took several minutes. Finally, we estimate the number
of impressions as the sum of the ten neighbors’ impressions.
1
103
3.3</p>
    </sec>
    <sec id="sec-6">
      <title>Feature-based Approach</title>
      <p>The feature-based approach considers features rather than
documents. We derive features as terms occurring in the news article
as well as labels assigned to images. For each term and label, we
compute the average number of impressions of all articles related
to them. We estimate the number of impression for a given article
by averaging the expected impressions of all its features.</p>
      <p>The NewsREEL Multimedia dataset contains further
information facilitating variations of this approach. Image labels carry a
reference to their annotator’s configuration. Thus, the baseline can
focus on particular annotators’ input or combinations thereof. In
addition, each label entails a confidence score. The score indicates
how confident the annotator is that the label applies to the image.
We can modify the baseline to consider these scores as weights.
4</p>
    </sec>
    <sec id="sec-7">
      <title>EVALUATION</title>
      <p>We have evaluated the implemented algorithms paying attention to
the configurations used to annotate the images. Table 1 shows that
the results difer strongly in between domains. The random baseline
performs at ≈ 10% for all three publishers. In contrast, the text-based
method achieves 34.7% for publisher 13554, 19.2% for publisher
17614, and 22.5% for publisher 39234. The image-based method
exhibits noticeable diferences as well. While it scores 19.0% for
publisher 13554 with configuration 7, it barely exceeds the random
baseline for publisher 17614 and 39234. The good performance of
image based recommenders for domain 13554 (“cars”) compared
with the other domains (“world and local news”) could be explained
by the fact, that articles on 13554 are have a longer lifecycle and
are less influenced by breaking news.</p>
      <p>Comparing the text-based predictors with the image-based
predictors, we find that text feature-based methods on average show a
better performance. The approach focusing on selected text features
performs significantly better than the text terms based document
similarity method. The document similarity method which uses
images obtains similar results to the image-based feature
methods. For publisher 13554, they score 23.2% with configuration 7,
whereas they remain on the random baseline level for the remaining
publishers. Specific terms appear to afect items’ popularity more
than assigned images do. A suitable weighting scheme is of major
importance. Comparing word features with image features, the
results indicate that the words are more suitable for forecasting the
popularity of items than the computed images labels. An analysis
of the correlation between image labels and text terms should be
conducted. The use of diferent languages—English for image labels
and German for news texts—introduces an additional dificulty.</p>
      <p>We analyze the diferences between the feature-based and the
document-based approaches. On average, the feature-based
methods outperform the document-based approaches. This could be
explained by considering more robust data (when using features)
instead of merely considering the documents most similar to the
current news item. Top text terms in domain 13554 (domain cars)
are middle-class, unique, mar and grand; the top image labels are
snake (referring to cables), roof, and folding chair.</p>
      <p>
        Comparing the influence of the image labeler configuration, we
ifnd that the labeler 4 based on the InceptionV3 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] performs worse
than the predictors using the VGG [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] component. Analyzing the
labels computed by the algorithms, we found, that the labels
typically describe selected objects in the image, but are not optimized
for interestingness prediction. An additional challenge is raised by
example (“stock”) images used by the publishers with news items
for that no recent photos exist.
      </p>
      <p>Overall, the evaluation results between the configurations and
domains. The underlying rules should be researched in detail to
improve the prediction algorithms and to optimize the parameter
configurations.
5</p>
    </sec>
    <sec id="sec-8">
      <title>CONCLUSION</title>
      <p>In this paper, we have presented several ways to estimate how
popular news items will become based on multimedia data. The
results suggest that performance strongly depends on the individual
publisher. We have observed that text-based features perform better
than image-based features. This could be due to terms being more
closely linked to the events reported by the articles.</p>
      <p>While text-based methods have outperformed the random
baseline consistently, image-based approaches merely overcome the
random baseline for some publishers. This indicates that news
articles’ popularity may be disconnected from images for some
publishers. Furthermore, we have seen that the quality of
imagebased recommendations depends on the annotator used to create
the labels.</p>
      <p>Future Work. We see several ways to extend this research:
(1) Our work has focused exclusively on “high-level” features such
as image labels. Low-level features deserve further attention.
(2) In our experiments, we have analyzed annotators’ configurations
and the token-based methods separately. A weighted combination
of both might yield an performance boost for some publishers. For
a live recommender the context of the item should be considered
as well.
(3) Our feature-based approach linearly combines features. More
complex methods—such as neuronal networks or SVMs—should
be tested. They could capture the underlying distributions more
accurately.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R. O.</given-names>
            <surname>Duda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. E.</given-names>
            <surname>Hart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Stork</surname>
          </string-name>
          , et al.
          <source>Pattern classification. 2nd. Edition</source>
          . New York,
          <volume>55</volume>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dutta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zissermann</surname>
          </string-name>
          .
          <article-title>VGG image annotator (VIA)</article-title>
          . http://www.robots.ox.ac.uk/ vgg/software/via/,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lommatzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kille</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hopfgartner</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Ramming</surname>
          </string-name>
          . NewsREEL Multimedia at MediaEval 2018:
          <article-title>News Recommendation with Image and Text Content</article-title>
          .
          <source>In Procs. of the MediaEval</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Szegedy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vanhoucke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Iofe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shlens</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wojna</surname>
          </string-name>
          .
          <article-title>Rethinking the inception architecture for computer vision</article-title>
          . CoRR, abs/1512.00567,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>