<!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>Using a Word Analysis Method and GNNs to Classify Misinformation Related to 5G-Conspiracy and the COVI~D-19 Pandemic</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ferdinand Schaal</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jesper Phillips</string-name>
          <email>jesperphillips@gmail.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simula Research Laboratory</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Norway</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bates College</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>14</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>This paper addresses the FakeNews: Corona virus and 5G conspiracy task at MediaEval 2020. The task involves classifying misinformation that is related to conspiracy topics and the COVID-19 pandemic. The task is divided into two subtasks where we for each subtask are proposing a separate approach. The first subtask is a Natural Language Processing (NLP)-based detection task where we are proposing a simple text-based approach by looking at the frequency of words. The second subtask is a structural-based detection task where we are proposing a method using a Graph Neural Network (GNN) to perform classification by investigating spreading patterns.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Digital wildfires are the rapid spread of online false information that
poses the risk of both economical- and physical harm to society and
individuals. In an efort to combat this, the FakeNews: Corona virus
and 5G conspiracy task [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] aims to build a classifier that can identify
fake news on Twitter. We are proposing two diferent approaches,
one for each of the subtasks, to classify a data set of tweets that
has been collected with the FACT framework [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The data set
contains three classes; 5G Conspiracy, Other Conspiracy and Non
Conspiracy.The task is split into two subtasks, each containing
a labeled training set and unlabeled test set. The first subtask is
a Natural Language Processing (NLP)-based detection task. The
data in the NLP task consists of tweets and their content. For this
subtask we are using a bag-of-words (BOW) method to detect fake
news. The second subtask is a structure-based detection task. In this
subtask the data are tweets represented by distribution graphs. A
distribution graph is a subgraph of the Twitter graph and represents
a specific tweet, where the central node is the author of the tweet
and the rest of the nodes are users that have shared the tweet. The
edges in the graphs are friend/follower relationships between the
users. We also have additional node features that will be used in
some of the experiments.
      </p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        Fake news detection has been widely recognized in research in the
recent past. There are numerous ways of tackling the challenging
problem of fake news. Zhou et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] divides the main methods
used for fake news detection into four categories; Knowledge-based,
Style-Based, Propagation-Based and Source-Based. Our two proposed
methods for NLP-based detection and structure-based detection fall
under the category of style-based and propagation-based methods,
respectively. Our NLP-based approach is much similar to one of
the proposed methods in Zhou et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] that uses BOW to obtain
the frequency of lexicons to detect fake news. Propagation-based
methods typically uses Machine Learning (ML) methods such as
support vector machine (SVM) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], random forest [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and recursive
neural networks [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] to classify fake news. Unlike our approach,
these methods rely on manual feature extraction. Manual feature
extraction is not needed in our structure-based approach because
the GNN operates directly on the distribution graphs.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>APPROACH</title>
      <sec id="sec-3-1">
        <title>3.1. NLP-based Fake News Detection</title>
        <p>The groundwork for our NLP classifier is done by applying a BOW
method on the training set. As classes contain difering amounts
of tweets, we use a ratio of word count per tweet within a class to
better compare between classes. By comparing such a ratio of two
classes, we get insight into how frequently a word is used by one
class compared to a diferent class. By applying this method to the
5G Conspiracy class in the training set we are able to interpret how
often a word is used by a class. By defining the number of times,
a word X is mentioned in a class for  and the total amount
of tweets in that class for  we propose a method to score an
individual word given by the following equation:
 
Score of a word = 5</p>
        <p>5 ·</p>
        <p>All words are assigned a score depending on the ratio of usage in
the 5G-Conspiracy class compared to usage in the Non-Conspiracy
class. A word like "and", which exists in most tweets regardless of
class would score close to 1.00. While words used mostly by the 5G
conspiracy class would score higher. By taking the geometric mean
of the scores of each word within a tweet, we establish an overall
score for a specific tweet. We then apply this method to every tweet
in the test set and rank all the tweets based on their overall score.</p>
        <p>To find a threshold score for classifying a 5G-Conspiracy tweet,
we ran a preliminary test on the development data. We then
calculated the sensitivity and 1− specificity of all thresholds of the results
from the test on the development data. We found the sensitivity
and 1−specificity to have the highest geometric mean at a threshold
of 1.15. This threshold was then applied to the test set.</p>
        <p>The binary classification was done by creating scores with the
combined Other Conspiracy and Non-Conspiracy tweets as class
(1)
0, and 5G Conspiracy class as class 1 as requested by the task. We
then created a multi class classification between 5G Conspiracy,
Other Conspiracy and Non-Conspiracy as Class 1, 2, 3. To do so we
ran our method twice: first using the binary method and secondly
by classifying between other conspiracy and regular tweets. Thus,
by combining these two runs, we are able to establish a multi-class
classification of the 5G Conspiracy, Other Conspiracies, and
NonConspiracy</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Structure-based Fake News Detection</title>
        <p>
          For the task of Structure-based Fake News Detection, Graph Neural
Networks (GNNs) are used as a classifier. GNNs are generalizations
of deep learning architectures such as Convolutional Neural
Network (CNN) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and Recurrent Neural Network (RNN) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] that allow
neural networks to directly operate on graph structured data. There
exist numerous kinds of GNNs within the categories of
convolutional GNNs (ConvGNNs) and recurrent GNN (RecGNN). We have
chosen to work with a spatial-based convolutional GNN because of
its proven eficiency, generality and flexibility compared to the other
GNNs [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Based on its promising results in previous work [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ][
          <xref ref-type="bibr" rid="ref3">3</xref>
          ],
our model will be the Graph Isomorphism Network (GIN) [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The
reader is referred to Xu et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] for a detailed description of GIN,
but in short it uses a neighborhood aggregation scheme in order to
perform node embeddings that allows for classification.
        </p>
        <p>Three diferent classification tasks are conducted: one
multiclass classification with node features, one multi-class classification
without node features, and one binary classification task without
node features. For the tasks where node features are not provided,
we are using one-hot encoding of node degrees as input features.
In the binary classification task, we are grouping Other Conspiracy
and Non-Conspiracy together.</p>
        <p>Hyperparameter optimization is conducted separately for each
classification task with a 5-fold cross-validation, which splits the
training set into a 80%/20% training/validation set for each fold.</p>
        <p>
          To cope with the unbalanced sets, we oversample the minority
classes in our training sets. The hyperparameters used in the cross
validation are chosen based on the one used by Xu et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and
are listed in Table 1.
        </p>
        <p>The models are then retrained on another 80%/20% split of the
training set using the best performing hyperparameter
configuration. With drop-out and early stopping, we make sure that the
model is not overfitting on the training set.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>RESULTS AND ANALYSIS</title>
      <sec id="sec-4-1">
        <title>4.1. Results: NLP-based Fake News Detection</title>
        <p>For the NLP subtask, we achieved a score of 0.372 for multi-class
classification and 0.385 for binary classification. It was expected
that the score would be higher for the binary classification, as at
its core, our classifier is a binary method, ran multiple times to
F. Schaal, J. Phillips
make tertiary. We identify certain flaws in our method. Reviewing
our results, we saw the method did better for the highest threshold
of our three runs. We, therefore, suspect our thresholds may have
been set too low. A diferent method of determining this threshold
resulting in a higher threshold might have led to greater accuracy
in the classification.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Results: Structure-based Fake News Detection</title>
        <p>The best performing hyperparameters for all three experiments
were batch size of 128, 32 hidden units, and three hidden layers
when additional features were provided and two otherwise. This
means that the shallower networks perform better than the deeper
networks, which is likely due to the fact that the distribution graphs
are relatively small in size and well connected. For the multi-class
tasks our GIN model had a score of 0.1810 when using features
and a score of 0.1375 without using features. The performance
declined for the binary classification task, which received a score of
0.1122. Based on the results, using the additional features provided
increases the performance significantly. Nevertheless, the
performance is fairly low compared to the NLP subtask. Table 2 below
reports the results of each experiment in both subtasks.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>DISCUSSION AND OUTLOOK</title>
      <p>In our NLP-based results we see that when the method fails, it often
fails by not managing to interpret human characteristics. It has no
method to identify characteristics like sarcasm and humor in tweets.
A sarcastic tweet discussing the 5G-Conspiracy, yet not claiming it
is true may still contain high scoring frequency words. Therefore
such a tweet would be wrongly classified as 5G-Conspiracy. To
counter this we would have had to incorporate methods more
advanced than our simple word counting.</p>
      <p>It is interesting that the binary classification for the
structurebased approach performs worse compared to the multi-class
classiifcation. This might be because of similarities in the distribution
graphs between the two conspiracy classes: 5G-Conspiracy and
Other-Conspiracy, which makes it dificult to separate the two
classes.</p>
      <p>In the future, it would be interesting to see a hybrid method of
the two proposed approaches. A combination of the NLP-based
approach with the structure-based approach would most likely
result in a much more robust model.</p>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was created in the context of the Norwegian
SAMRISK2 project "UMOD" (#272019) under the supervision of Johannes
Langguth, Daniel Thilo Schroeder, and Konstantin Pogorelov.
FakeNews: Corona virus and 5G conspiracy</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Carlos</given-names>
            <surname>Castillo</surname>
          </string-name>
          , Marcelo Mendoza, and
          <string-name>
            <given-names>Barbara</given-names>
            <surname>Poblete</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Information credibility on Twitter</article-title>
          .
          <source>Proceedings of the 20th International Conference Companion on World Wide Web, Www</source>
          <year>2011</year>
          (
          <year>2011</year>
          ),
          <fpage>675</fpage>
          -
          <lpage>684</lpage>
          . https://doi.org/10.1145/1963405.1963500
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>JL</given-names>
            <surname>ELMAN</surname>
          </string-name>
          .
          <year>1990</year>
          .
          <article-title>FINDING STRUCTURE IN TIME</article-title>
          .
          <source>Cognitive Science 14</source>
          ,
          <issue>2</issue>
          (
          <year>1990</year>
          ),
          <fpage>179</fpage>
          -
          <lpage>211</lpage>
          . https://doi.org/10.1207/s15516709cog1402_
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Federico</given-names>
            <surname>Errica</surname>
          </string-name>
          , Marco Podda, Davide Bacciu, and
          <string-name>
            <given-names>Alessio</given-names>
            <surname>Micheli</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>A Fair Comparison of Graph Neural Networks for Graph Classiifcation</article-title>
          . (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Sejeong</given-names>
            <surname>Kwon</surname>
          </string-name>
          , Meeyoung Cha, Kyomin Jung, Wei Chen, and
          <string-name>
            <given-names>Yajun</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Prominent features of rumor propagation in online social media</article-title>
          .
          <source>Proceedings - Ieee International Conference on Data Mining</source>
          ,
          <string-name>
            <surname>Icdm</surname>
          </string-name>
          (
          <year>2013</year>
          ),
          <volume>6729605</volume>
          ,
          <fpage>1103</fpage>
          -
          <lpage>1108</lpage>
          . https://doi.org/10.1109/ICDM.
          <year>2013</year>
          .61
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>LeCun</surname>
          </string-name>
          , P. Hafner,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bottou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>Object recognition with gradient-based learning</article-title>
          .
          <source>Shape, Contour and Grouping in Computer Vision</source>
          (
          <year>1999</year>
          ),
          <fpage>319</fpage>
          -
          <lpage>45</lpage>
          ,
          <fpage>319</fpage>
          -
          <lpage>345</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Jing</given-names>
            <surname>Ma</surname>
          </string-name>
          , Wei Gao, and Kam Fai Wong.
          <year>2018</year>
          .
          <article-title>Rumor detection on twitter with tree-structured recursive neural networks</article-title>
          .
          <source>Acl</source>
          <year>2018</year>
          -
          <article-title>56th Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <source>Proceedings of the Conference (long Papers)</source>
          <volume>1</volume>
          (
          <issue>2018</issue>
          ),
          <fpage>1980</fpage>
          -
          <lpage>1989</lpage>
          . https: //doi.org/10.18653/v1/p18-
          <fpage>1184</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Konstantin</given-names>
            <surname>Pogorelov</surname>
          </string-name>
          , Daniel Thilo Schroeder, Luk Burchard, Johannes Moe, Stefan Brenner, Petra Filkukova, and
          <string-name>
            <given-names>Johannes</given-names>
            <surname>Langguth</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>FakeNews: Corona Virus and 5G Conspiracy Task at MediaEval 2020</article-title>
          . In MediaEval 2020 Workshop.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Thilo</surname>
          </string-name>
          <string-name>
            <surname>Schroeder</surname>
          </string-name>
          , Konstantin Pogorelov, and
          <string-name>
            <given-names>Johannes</given-names>
            <surname>Langguth</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>FACT: a Framework for Analysis and Capture of Twitter Graphs</article-title>
          .
          <source>In 2019 Sixth International Conference on Social Networks Analysis, Management and Security (SNAMS)</source>
          . IEEE,
          <fpage>134</fpage>
          -
          <lpage>141</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Zonghan</given-names>
            <surname>Wu</surname>
          </string-name>
          , Shirui Pan, Fengwen Chen,
          <string-name>
            <given-names>Guodong</given-names>
            <surname>Long</surname>
          </string-name>
          , Chengqi Zhang, and
          <string-name>
            <surname>Philip</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>A Comprehensive Survey on Graph Neural Networks [arXiv]</article-title>
          .
          <source>Arxiv</source>
          (
          <year>2019</year>
          ), 22 pp.,
          <volume>22</volume>
          pp.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Keyulu</surname>
            <given-names>Xu</given-names>
          </string-name>
          , Stefanie Jegelka, Weihua Hu, and
          <string-name>
            <given-names>Jure</given-names>
            <surname>Leskovec</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>How powerful are graph neural networks?</article-title>
          <source>7th International Conference on Learning Representations, Iclr</source>
          <year>2019</year>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Xinyi</surname>
            <given-names>Zhou</given-names>
          </string-name>
          , Atishay Jain,
          <string-name>
            <surname>Vir</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Phoha</surname>
            , and
            <given-names>Reza</given-names>
          </string-name>
          <string-name>
            <surname>Zafarani</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Fake News Early Detection: A Theory-driven Model [arXiv]</article-title>
          .
          <source>Arxiv</source>
          (
          <year>2019</year>
          ), 24 pp.,
          <volume>24</volume>
          pp.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Xinyi</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>Reza</given-names>
            <surname>Zafarani</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>A Survey of Fake News: Fundamental Theories, Detection Methods, and</article-title>
          <string-name>
            <given-names>Opportunities. Acm</given-names>
            <surname>Computing Surveys</surname>
          </string-name>
          (
          <year>2020</year>
          ),
          <volume>37</volume>
          . https://doi.org/10.1145/3395046
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>