<!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>MCG-ICT at MediaEval 2015: Verifying Multimedia Use with a Two-Level Classification Model</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology</institution>
          ,
          <addr-line>CAS, Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Chinese Academy of Sciences</institution>
          ,
          <addr-line>Beijing</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>14</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>The Verifying Multimedia Use task aims to detect misuse of online multimedia content and verify them as real or fake. This is a highly challenging problem because of strong variations among tweets from di erent events. Traditional approaches train the classi er at message level, which ignores inter-message relations. We propose a two-level classi cation model to exploit the information that tweets of a same topic are probably have same credibility values. In this model a topic level is introduced to eliminate message variations. Messages are aggregated into topics as a higher level representation. Pre-results gained from classi cation at the topic level are then fused with original message level features to train a better classi er. Results indicate that topic level is very helpful and our two-level approach o ers signi cantly better results than a traditional one-level method. Our best result on this task achieves an F-score of 0.94 using features extracted only from tweet content.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>PROPOSED APPROACH</title>
      <p>
        The paper presents the approach developed by MCG-ICT
for the MediaEval 2015 Veri cation Multimedia Use task.
The task deals with the automatic detection of
manipulation and misuse of Web multimedia content. Online content
veri cation is a fairly new problem, participants are
encouraged to propose e ective features and methods. The goal
of the task is to evaluate a set of tweets from several events
and identify them as real or fake. More details about the
task can be found in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Traditional approaches formulate the veri cation problem
as a two-class classi cation task [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Features from tweet text
contents and users are extracted to train a classi er at the
message (tweet) level. One problem of this training strategy
is that tweets are trained and tested individually. However,
tweets in reality have strong relations among each other,
especially tweets of a same topic would probably have the
same veri cation result: real or fake.
      </p>
      <p>
        Rather than classifying each tweet individually, some
recent studies propose to verify tweets as a whole with
intertweets information. Gupta et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] propose a network
which consists of tweets and users with similarity links
among them. In our recent work [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], we cluster tweets
into sub-events and build links among tweets, sub-events
and event. The three-layer network captures entities'
relations from di erent scales and results in good veri cation
performance.
      </p>
      <p>
        Our network model is designed to evaluate the credibility
of a speci c event. However, in the presented data set of
the target task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], some events are actually a set of many
related events (e.g. Hurricane Sandy) while some events
only contain a few tweets (e.g. Pig Fish). Moreover, the task
aims to give each tweet a veri cation label rather than an
over all veri cation label for the event. These di erences in
the dataset and task de nitions limit our model to directly
work on it. But the idea of exploiting inter-tweet
implications inspire us to propose a two level classi cation method.
Figure 1 gives an overview of this method.
      </p>
      <p>As illustrated in Figure 1, the proposed model has two
levels of classi cations: One is the message level which is
just the same as previous message level methods. Features
extracted from tweets text content, user information and
other aspects are used for training; the other is the
topic level which is the main contribution of this paper. By
assuming tweets under a same topic probably have similar
credibility values, we cluster tweets into di erent topics. A
topic is a speci c subject in an event, it consists of all
tweets concerning the same subject. Compared with raw tweets,
topics eliminate variations of tweets by taking the average of
them. Thus, it also reduces the impact of noisy data.
Compared with event, topics maintain most of tweet details.</p>
      <p>
        Topics Clustering: In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], a clustering algorithm is used
to cluster tweets into sub-events. But this algorithm
performs poorly in forming topics in the task dataset as it is
di cult to decide the optimum number of clusters.
However, we observe that each tweet contains an image or video
and each image or video can be contained in more than one
tweets. This intrinsic one-to-many relations in the data set is
a clue to form topics. To form topics, each image/video
corresponds to a topic and tweets containing this image/video
belong to this topic.
      </p>
      <p>Topics Labeling: We label each topic as the average
labels of its tweets: if more than a half of tweets in a topic is
real then we label this topic as real. The labels are used for
training the topic level classi er. (In fact, with the proposed
topic formation, almost all tweets in a topic have the same
label.)</p>
      <p>Topic Level Feature Aggregation: We take the
average of message level features of all tweets in a topic as the
topic level feature. Some nominal features, such as
"contains question/exclaimation mark", are also aggregated into
corresponding numeric features.</p>
      <p>Fusing Topic Level Result: After topic level
classication, we can get a probability value for each topic on
predicting how likely it is fake. Then for each tweet in the
topic, we add this pre-result value as a feature to its original
feature vector. Finally, we train a message level classi er
with extended message features and give the nal result.
1.2</p>
    </sec>
    <sec id="sec-2">
      <title>Feature Set</title>
      <p>
        In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], 18 content features and 7 user features are extracted
from the message level. We use these two kinds of features
as base features. In addition, we also experiment on some
new features: word term features and several image features.
      </p>
      <p>We extract the commonly used term frequency (tf)
features and tf-idf features to represent each tweet. With
experiments on the training set (development set), this kind
of feature was found to be very over- tting. It reached very
high performance on cross validation and very low
performance on event-separation validation. Because few words
co-occur in di erent events, we assume other pure
termbased features (e.g. LDA features) would contribute little
on this task.</p>
      <p>Almost each tweet contains an image in the dataset, so we
extract several features concerning images (e.g. image
popularity, resolution). These image features can replace the
topic level features to train classi er at topic level, because
a topic is generated for each image as mentioned earlier.
Experiments on the development set show that these image
features result in slightly worse performance for the topic level
classi cation than content features but much worse
performance after fusing with message level features to generate
the nal result. Moreover, these image features cannot be
applied directly on videos included in the test set. As they
are not the main concern of this paper, we leave these
features to future research.</p>
    </sec>
    <sec id="sec-3">
      <title>RESULTS AND DISCUSSION</title>
      <p>In the task requirements de nition, runs 3-5 are
experiments with external resources. As our approach focuses on
the classi cation method rather than using external
materials, we only submitted results for the rst two runs (Table
1). Run 1 uses only content features while run 2 uses both
content and user features. Both runs follow our two level
classi cation model illustrated in Figure 1. We use J48
decision tree classi er for topic level classi cation and Random
Forest classi er for message level classi cation. The topic
level classi cation for training set is built by a 10-fold cross
validation on it. The reported three evaluation measures in
Table 1 are computed with respect to fake tweets.</p>
      <p>From the results we can observe that our two level
classi cation method achieves very promising results on both
runs. Speci cally, it reaches a veri cation F-Score of 0.9423
for run 1 and a slightly worse result 0.9296 for run 2.
Moreover, our method achieves high recall performance as well
as high precision. This demonstrates the strong distinctive
ability of our method for both fake and real tweets. We also
notice that the result of run 2 is slightly worse than that of
run 1, which indicates the user features may be redundant.
In fact, we get a similar result in our experiments on the
development set.</p>
      <p>In the future, we want to explore other features, such as
image forensics features, with our model. This model also
need to be tested on a much larger data set or in real-time
situations to validate its e ectiveness.</p>
    </sec>
    <sec id="sec-4">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was supported by National Nature Science
Foundation of China (61172153, 61571424) and the National High
Technology Research and Development Program of China
(2014AA015202).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Boididou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Andreadou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Papadopoulos</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.-T.</surname>
            Dang-Nguyen,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Boato</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Riegler</surname>
            , and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Kompatsiaris</surname>
          </string-name>
          .
          <article-title>Verifying multimedia use at mediaeval 2015</article-title>
          .
          <source>In Proceedings of the MediaEval 2015 Multimedia Benchmark Workshop</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Boididou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Papadopoulos</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kompatsiaris</surname>
          </string-name>
          .
          <article-title>Challenges of computational veri cation in social multimedia</article-title>
          .
          <source>In Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion</source>
          , pages
          <volume>743</volume>
          {
          <fpage>748</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J.</given-names>
            <surname>Han</surname>
          </string-name>
          .
          <article-title>Evaluating event credibility on twitter</article-title>
          .
          <source>In Proceedings of the SIAM International Conference on Data Mining, page 153. Society for Industrial and Applied Mathematics</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-G.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , and
          <string-name>
            <surname>Y. Zhang.</surname>
          </string-name>
          <article-title>News credibility evaluation on microblog with a hierarchical propagation model</article-title>
          .
          <source>In 2014 IEEE International Conference on Data Mining (ICDM)</source>
          , pages
          <fpage>230</fpage>
          {
          <fpage>239</fpage>
          . IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Fei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Cao</surname>
          </string-name>
          .
          <article-title>Real-time news certi cation system on sina weibo</article-title>
          .
          <source>In Proceedings of the 24th International Conference on World Wide Web Companion</source>
          , pages
          <volume>983</volume>
          {
          <fpage>988</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>