<!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>Detection in Tweets with Abstract Argumentation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lars Malmqvist</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommy Yuan</string-name>
          <email>tommy.yuan@cs.york.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Nightingale</string-name>
          <email>peter.nightingale@york.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of York</institution>
          ,
          <addr-line>Deramore Lane, York YO10 5GH</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Argumentation, Graph Neural Networks, Misinformation Detection The problem of detecting misinformation in social network data has received increasing attention CMNA'21: Workshop on Computational Models of Natural Argument, September 2-3, 2021, Online CEUR Workshop Proceedings</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        (P. Nightingale)
recently, not least due to the COVID-19 public health emergency [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. It is fair to say that deep
learning models based on a variety of architectures have been increasingly successful in learning
to detect various types of misinformation such as rumours, fake news, and the intentional
spreading of false information [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        For Twitter data two of the most successful recent approaches have been one the one hand
detection based on large-scale language models [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], using the characteristics of the language
used to determine veracity, and on the other methods that use the features of the propagation
graph by which a source tweet is retweeted by other actors on the social network [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], using
the structure of the graph as an indicator of veracity.
      </p>
      <p>Our approach seeks to combine and enrich these two approaches by combining graph
structure, in the form of an abstract argumentation framework derived from stance information with
linguistic node level features from a language model and argumentative features based on the
acceptability status of arguments under diferent semantics.</p>
      <p>
        This paper presents our work-in-progress towards this goal including the planned
methodology and experimental setup. This research builds on earlier work presented at SAFA 2020 [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
http://www-users.cs.york.ac.uk/~tommy/ (T. Yuan); https://www-users.cs.york.ac.uk/pwn/ (P. Nightingale)
© 2021 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
where we presented a way to approximate acceptability in abstract argumentation frameworks
using graph neural networks. While the approximation task was diferent in that example (e.g.
determining acceptability), the same GCN architecture can apply in this case.
      </p>
      <p>As part of this research, we plan to make the following contributions:
• Show that adding the structure of an argumentation graph can improve detection of
misinformation relative to baseline language models
• Determine the optimal way to construct abstract argumentation graphs from stance
information
• Determine the best architectures for combining linguistic and argumentative features for
input into Graph Convolutional Networks (GCN)</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <sec id="sec-2-1">
        <title>2.1. Abstract Argumentation</title>
        <p>The notion of acceptability is key to abstract argumentation.</p>
        <p>Definition 2 (Acceptability). An argument A ∈ args is called acceptable with respect to an
extension  ⊆   if for every  ∈   with  attacks  there is an argument  ′ ∈  with  ′
attacks  .</p>
        <p>
          Extensions are subsets of argumentation frameworks that are collectively acceptable.
Extensions are evaluated based on semantics that define rules for what arguments can be accepted
together [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. In this research, we will construct Argumentation Frameworks based on stance
information, using a variety of schemas and determine their acceptability status using an abstract
argumentation solver as an input to a Graph Convolutional Network.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Graph Convolutional Networks</title>
        <p>
          Convolutional Neural Network (CNN) models have been highly successful in computer vision
tasks. Graph Convolutional Networks seek to apply this kind of model to graph structured data.
In the original model proposed by Kipf et al. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], the convolutional operator is modelled by an
1-hop aggregation of neighbourhood information within the graph. While simple, this approach
has proven successful in a number of context, including the approximation of acceptability for
abstract argumentation. In this work, we will use an adapted version of the GCN that we have
previously presented [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] for this purpose, changing the classification task but retaining much
of the architecture.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Misinformation Detection on Social Networks</title>
        <p>
          There is a large extant literature on misinformation detection in its various guises. The two
approaches most directly relevant to our research are those that rely on large-scale language
models such as GPT-3 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and BERT [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] to analyze tweet content [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and those that use the
patterns of tweet propagation to detect misinformation [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>
          However, the most directly parallel work in the literature is found in Toni and Orascu’s
[
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] use of argumentative features to improve a Bi-LSTM model for detection of fake reviews
and to determine whether news headlines support tweets. This research showed the power
of argumentative features for this problem. However, compared to our research, it relies on
a more complex formalism, bipolar argumentation frameworks, and uses the argumentative
features as an adjunct to a principally NLP-based model instead of having a primary focus on
graph structures.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>Our approach to the problem follows a four step process:
1. Construct an abstract argumentation graph based on stance information
2. Generate linguistic features by creating embeddings for the input tweets, using a language
model
3. Generate argumentative features by resolving the acceptability of the arguments in the
argumentation framework
4. Train a Graph Convolutional Network using the argumentation graph and the generated
features inserted at the node level
In the following section, we will explore each of these steps in more detail.</p>
      <sec id="sec-3-1">
        <title>3.1. Constructing the Argumentation Framework</title>
        <p>
          We will construct the argumentation framework based on existing stance information present
in our source datasets. The problem of stance detection has a substantial literature of its own
[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and we do not seek to add to it with this research.
        </p>
        <p>While stance categorization can vary between datasets it is generally possible to classify the
relationship between a source tweet, that is the target for classification, and additional tweets
in its propagation graph into a polarity of positive, negative, or neutral. We use this polarity to
construct abstract argumentation frameworks containing arguments representing each tweet
and attacks based on diferent combinations of the following schemes for mapping stance into
attack relationships:
• Adding attack relationships from any node that has a negative stance towards the source
node to the source node itself
• Adding attack relationships from the source node to any node that has negative stance
towards it
• Adding attack relationships between nodes that have difering stance to the source node.</p>
        <p>So if tweet A is positive toward the source node and tweet B is negative, we would add
either unilateral or bilateral attack relationships, depending on our chosen scheme
• Limiting these attack relationships to only those in a tweet’s sub-propagation graph
relative to the source node
• Adding neutral nodes to the graph both as isolated components, only linked to themselves
and with attack relationships towards the source node or node with a negative stance
towards the source node, thereby reclassifying neutral nodes as positive or negative for
the purposes of the argumentation graph</p>
        <p>These schemes will be tested in diferent experimental setups to determine which perform
better in diferent contexts. While some of these schemes may seem prima facie strange from a
common sense point-of-view, they are designed to allow diferent ways for neighbourhood
information to aggregate in the graph convolutional network, which may help in the classification
task.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Linguistic Features</title>
        <p>We generate linguistic features by creating embeddings for all tweets in our dataset using
a variety of language models. First and foremost, we use the large-scale transformer based
language models such as BERT. But we will also include simpler models such as Word2Vec
for comparison. We generate these using diferent embedding sizes for comparison. These
embeddings are added as node features in the GCN model along with the argumentative features.
We will, however, also train a baseline classifier using only linguistic information for the sake
of comparison.</p>
        <p>We will try diferent feature settings with our experimental setup to determine, which are
more successful in predicting misinformative tweets.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Argumentative Features</title>
        <p>Argumentation specific features are generated by incorporating the acceptability status both
for sceptical and credulous acceptance under the Complete, Preferred, Stable, Semi-Stable, and
Stage semantics. The features will be pre-calculated using an abstract argumentation solver
and added as node features by encoding acceptable as 1 and unacceptable as 0.</p>
        <p>These features will be tested in diferent experimental setups to determine whether the
addition of acceptability information improves overall performance.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. GCN Architecture</title>
        <p>
          We follow the GCN Architecture outlined in Malmqvist et al. [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] and adapt it to incorporate
the additional feature information from the language model and the argumentation solver.
        </p>
        <p>
          The architecture includes the following elements:
1. Pre-computed linguistic and argumentative features along with the normalised adjacency
matrix for the argumentation framework
2. An input layer receiving these inputs
3. 6 repeating blocks of a GCN layer [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and a Dropout layer [15]
4. Residual connections feeding the original features and the normalised adjacency matrix
as additional input at each block
5. An layer that aggregates the embeddings generated by the GCN layers for graph level
classification. We will experiment with diferent aggregation functions during the final
phase of the research
6. A sigmoid layer that represents the probability that the source tweet is true
We treat the problem of veracity as a binary classification problem at the level of the graph.
That means we aggregate information from all nodes and the embeddings generated by the
GCN in order to judge whether the source tweet is true or not.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Planned Experiments</title>
      <p>
        We will test the model on two datasets that contain both veracity and stance information and
are commonly used in the research literature: Pheme [16] and RumourEval [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Both datasets
contain tweets relating to controversial current events.
      </p>
      <p>We will construct a baseline model using only linguistic features and one using only the
argumentation graph and argumentative features. Then we will generate diferent model
variants using various combinations of language models and argumentation graph construction
schemes some including and some excluding argumentative features.</p>
      <p>We will compare the results of these models based on their performance on the benchmark
datasets to establish what combinations yield the best results for detecting misinformation.
Finally, we will present our results in the context of other work using the same datasets.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <p>This paper presents the work-in-progress for our experiments in applying abstract
argumentation in conjunction with linguistic features for detecting misinformation. We hope that this
will extend the applicability of argumentation based methods for misinformation detection as
well as give greater understanding of how argumentation can be used to enrich and improve
deep learning architectures. This will also help decrease the gap between the formal world of
abstract argumentation and natural language expressions of argument by incorporating both
types of information in the same deep learning model. So far early work has demonstrated
the technical feasibility of this approach and we aim to be able to present concrete results in
September 2021.
[15] Nitish Srivastava, Geofrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan
Salakhutdinov. Dropout: A Simple Way to Prevent Neural Networks from Overfitting. Journal of
Machine Learning Research, 15(56):1929–1958, 2014.
[16] Arkaitz Zubiaga, Maria Liakata, Rob Procter, Geraldine Wong Sak Hoi, and Peter Tolmie.</p>
      <p>Analysing How People Orient to and Spread Rumours in Social Media by Looking at
Conversational Threads. PLOS ONE, 11(3):1–29, 2016.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Jennifer</surname>
            <given-names>L Bonnet</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Senta</given-names>
            <surname>Sellers</surname>
          </string-name>
          .
          <source>The COVID-19 Misinformation Challenge: An Asynchronous Approach to Information Literacy. Internet Reference Services Quarterly</source>
          ,
          <volume>24</volume>
          (
          <issue>1-2</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Oana</given-names>
            <surname>Cocarascu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Francesca</given-names>
            <surname>Toni</surname>
          </string-name>
          .
          <article-title>Combining Deep Learning and Argumentative Reasoning for the Analysis of Social Media Textual Content Using Small Data Sets</article-title>
          . Comput. Linguist.,
          <volume>44</volume>
          (
          <issue>4</issue>
          ):
          <fpage>833</fpage>
          -
          <lpage>858</lpage>
          , dec
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Jacob</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <article-title>Bert: Pretraining of deep bidirectional transformers for language understanding</article-title>
          .
          <source>arXiv preprint arXiv:1810.04805</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Phan</given-names>
            <surname>Minh Dung</surname>
          </string-name>
          .
          <article-title>On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming</article-title>
          and
          <string-name>
            <given-names>N-Person</given-names>
            <surname>Games</surname>
          </string-name>
          .
          <source>Artificial Intelligence</source>
          , pages
          <fpage>321</fpage>
          -
          <lpage>357</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Luciano</given-names>
            <surname>Floridi</surname>
          </string-name>
          and
          <string-name>
            <given-names>Massimo</given-names>
            <surname>Chiriatti</surname>
          </string-name>
          . GPT-3
          <article-title>: Its nature, scope, limits, and consequences</article-title>
          .
          <source>Minds and Machines</source>
          ,
          <volume>30</volume>
          (
          <issue>4</issue>
          ):
          <fpage>681</fpage>
          -
          <lpage>694</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Genevieve</given-names>
            <surname>Gorrell</surname>
          </string-name>
          , Elena Kochkina, Maria Liakata, Ahmet Aker, Arkaitz Zubiaga, Kalina Bontcheva, and Leon Derczynski. SemEval
          <article-title>-2019 Task 7: RumourEval, Determining Rumour Veracity and Support for Rumours</article-title>
          .
          <source>In Proceedings of the 13th International Workshop on Semantic Evaluation</source>
          , pages
          <fpage>845</fpage>
          -
          <lpage>854</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Md</given-names>
            <surname>Rafiqul</surname>
          </string-name>
          <string-name>
            <surname>Islam</surname>
          </string-name>
          , Shaowu Liu,
          <string-name>
            <given-names>Xianzhi</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Guandong</given-names>
            <surname>Xu</surname>
          </string-name>
          .
          <article-title>Deep learning for misinformation detection on online social networks: a survey and new perspectives</article-title>
          .
          <source>Social Network Analysis and Mining</source>
          ,
          <volume>10</volume>
          (
          <issue>1</issue>
          ):
          <fpage>82</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Thomas</surname>
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Kipf</surname>
            and
            <given-names>Max</given-names>
          </string-name>
          <string-name>
            <surname>Welling</surname>
          </string-name>
          .
          <article-title>Semi-Supervised Classification with Graph Convolutional Networks</article-title>
          .
          <source>In 5th International Conference on Learning Representations, ICLR 2017 - Conference Track Proceedings</source>
          , sep
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Dilek</given-names>
            <surname>Küçük</surname>
          </string-name>
          and
          <string-name>
            <given-names>Fazli</given-names>
            <surname>Can</surname>
          </string-name>
          .
          <article-title>Stance detection: A survey</article-title>
          .
          <source>ACM Computing Surveys (CSUR)</source>
          ,
          <volume>53</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>37</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Kula</surname>
          </string-name>
          , Michał Choraś, and
          <string-name>
            <given-names>Rafał</given-names>
            <surname>Kozik</surname>
          </string-name>
          .
          <article-title>Application of the BERT-Based Architecture in Fake News Detection BT</article-title>
          . In Álvaro Herrero, Carlos Cambra, Daniel Urda, Javier Sedano, Héctor Quintián, and Emilio Corchado, editors,
          <source>13th International Conference on Computational Intelligence in Security for Information Systems (CISIS</source>
          <year>2020</year>
          ), pages
          <fpage>239</fpage>
          -
          <lpage>249</lpage>
          , Cham,
          <year>2021</year>
          . Springer International Publishing.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Jing</surname>
            <given-names>Ma</given-names>
          </string-name>
          , Wei Gao, and
          <string-name>
            <surname>Kam-Fai Wong</surname>
          </string-name>
          .
          <article-title>Rumor Detection on {T}witter with Tree-structured Recursive Neural Networks</article-title>
          .
          <source>In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
          , pages
          <fpage>1980</fpage>
          -
          <lpage>1989</lpage>
          , Melbourne, Australia, jul
          <year>2018</year>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Lars</given-names>
            <surname>Malmqvist</surname>
          </string-name>
          .
          <article-title>Approximate Solutions to Argumentation Frameworks with Graph Neural Networks</article-title>
          .
          <source>Online Handbook of Argumentation for AI</source>
          , page
          <volume>32</volume>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Lars</surname>
            <given-names>Malmqvist</given-names>
          </string-name>
          , Tommy Yuan,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Nightingale</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Suresh</given-names>
            <surname>Manandhar</surname>
          </string-name>
          .
          <article-title>Determining the acceptability of abstract arguments with graph convolutional networks</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          ,
          <volume>2672</volume>
          :
          <fpage>47</fpage>
          -
          <lpage>56</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Baroni</surname>
            <given-names>Pietro</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Martin</given-names>
            <surname>Caminada</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Giacomin</given-names>
            <surname>Massimilliano</surname>
          </string-name>
          .
          <article-title>An Introduction to Argumentation Semantics</article-title>
          .
          <source>The Knowledge Engineering Review</source>
          ,
          <volume>00</volume>
          (January):
          <fpage>1</fpage>
          -
          <lpage>24</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>