<!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>
      <journal-title-group>
        <journal-title>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Oppositional Thinking Analysis: Conspiracy Theories vs Critical Thinking Narratives</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Prabavathy Balasundaram</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Karthikeyan Swaminathan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oviasree Sampath</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pradeep Km</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of CSE, SSN College of Engineering</institution>
          ,
          <addr-line>Rajiv Gandhi Salai, Chennai, Tamil Nadu</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>0</volume>
      <fpage>9</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>Conspiracy theories [1] are complex narratives that attempt to explain the ultimate causes of significant events as cover plots orchestrated by secret, powerful, and malicious groups, whereas critical thinking on the other hand is the process of objectively analyzing and evaluating information to form a reasoned judgment and putting them forth for the public view. Identifying conspiracy theories using Natural Language Processing (NLP) models is challenging because it is hard to tell them apart from critical thinking. Mislabeling critical messages as conspiratorial can push curious individuals towards conspiracy communities, and hence it is highly important to be accurate in such classifications. The task involves distinguishing between two types of oppositional narratives: (1) conspiracy narratives, which suggest secret plots by powerful, malicious groups, and (2) critical thinking narratives, which question major decisions without implying a conspiracy. To achieve subtask 1, a pre-trained BERT classifier is employed to diferentiate between the two classes using a sigmoid activation function. The model for subtask 2 is a pretrained BERT-based sequence classifier fine-tuned for multi-label classification, which enables span-level classification of oppositional narratives. This working note paper presents the results of the Kaprov team at the Oppositional thinking analysis: Conspiracy theories vs critical thinking narratives [2] of PAN at CLEF 2024 [3],which includes two subtasks.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;BERT</kwd>
        <kwd>Multi-label classification</kwd>
        <kwd>Conspiracy Theories (CTs)</kwd>
        <kwd>Tokenizer</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the realm of Natural Language Processing, the computational detection and analysis of conspiracy
theories (CTs) within textual data has gained significant momentum [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. CTs are elaborate narratives
attributing significant events to covert actions by powerful clandestine groups, contrasting with critical
thinking, which challenges mainstream beliefs without endorsing conspiracies. Diferentiating between
these is crucial, as mislabeling opposing views as conspiratorial may sway individuals towards extreme
viewpoints. Current research predominantly focuses on binary classification tasks aimed at accurately
distinguishing between conspiratorial and critical texts. Existing methodologies for distinguishing
between conspiratorial and critical texts typically involve leveraging advanced natural language processing
techniques and machine learning models. Some common approaches include:
• Feature-based Classification: Using algorithms like SVMs (Support Vector Machines) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] or logistic
regression, which analyze word frequencies, n-grams, and syntax to classify texts.
• Sentiment Analysis: Analyzing the sentiment expressed in texts can provide insights into whether
the text is promoting conspiratorial beliefs (e.g., distrust, fear) or engaging in critical discourse
(e.g., skepticism, questioning).
      </p>
      <p>
        Subtask 2 focuses on token-level classification within oppositional narratives, distinguishing between
conspiracy theories and critical thinking. It aims to identify specific text segments—goals, efects, agents,
facilitators, objectives, and negative efects—using advanced NLP techniques. This approach enhances
understanding of nuanced narrative elements for efective content moderation and societal discourse
analysis. The approach includes:
• Topic Modeling: Techniques like Latent Dirichlet Allocation (LDA) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] or Non-Negative Matrix
Factorization (NMF) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] can uncover latent topics within texts, revealing prevalent themes or
ideologies associated with conspiratorial or critical narratives. By identifying dominant topics,
these methods contribute to understanding the discourse’s thematic focus and distinguishing
between diferent narrative types.
• Contextual Embeddings: Utilizing pre-trained contextual embeddings like BERT ( Bidirectional
Encoder Representations from Transformers) or GPT (Generative Pre-trained Transformer) can
capture nuanced contextual information within texts, enabling models to discern subtle linguistic
cues indicative of conspiratorial versus critical narratives. These embeddings enhance model
performance by integrating rich contextual understanding into classification tasks.
      </p>
      <p>The two tasks discussed in this paper and their successful implementation collectively advance the
ifeld by enabling automated detection and analysis of conspiratorial narratives, facilitating nuanced
understanding and efective management of such discourse in various domains, and thereby create
stable and peaceful platforms for discussion on public health issues.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Task and Dataset Description</title>
      <p>There are two tasks that have been worked upon, the first involves distinguishing between critical and
conspiracy texts, while the second focuses on detecting elements within oppositional narratives. The
dataset contains Telegram messages in English and Spanish. Both the tasks are performed exclusively
in English.</p>
      <p>
        Subtask 1 involves classifying texts into two categories: (1) messages that critically question public
health decisions without promoting conspiracy theories, and (2) messages that attribute pandemic
or health decisions to secret, influential conspiracies. Each text in the dataset is labeled as either
CONSPIRACY or CRITICAL. Evaluation of model performance is done based on Matthews Correlation
Coeficient (MCC) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], with a baseline established by a BERT classifier [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>Subtask 2 involves a token-level classification challenge where the goal is to identify specific text
segments that represent essential elements in oppositional narratives. Each text data in the input dataset
contains span texts along with their starting and ending positions and the type of oppositional narrative
the span text belongs to out of: AGENT, FACILITATOR, VICTIM, CAMPAIGNER, OBJECTIVE, and
NEGATIVE EFFECT. The performance of models is evaluated using the macro-averaged span-F1 score,
which assesses overall accuracy across all span categories.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Data Pre-Processing</title>
      <p>This section outlines the process of preparing data for the two tasks.</p>
      <sec id="sec-3-1">
        <title>3.1. Subtask 1 : Distinguishing between critical and conspiracy texts</title>
        <p>
          In the data pre-processing stage for subtask 1, the dataset is initially split into two subsets: one for critical
messages and another for conspiracy messages . Each subset is filtered based on the “category” column
values. Exploratory Data Analysis (EDA) [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] begins with a count plot to visualize the distribution
of categories (“CRITICAL” and “CONSPIRACY”) [Fig. 1]. This provides an initial understanding of
the dataset’s class distribution. Following EDA, data cleansing involves checking for missing values.
Addressing any missing data ensures the dataset is ready for subsequent steps such as tokenization,
feature extraction, and model training for binary classification.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Subtask 2 : Detecting elements of the oppositional narratives</title>
        <p>
          Subtask 2 pre-processing starts with extracting annotations from each JSON (JavaScript Object Notation)
entry, gathering crucial details about the relevant text spans and their corresponding categories. This
step prepared the dataset for subsequent pre-processing, ensuring its alignment with the machine
learning pipeline. Post annotation extraction, the Hugging Face AutoTokenizer [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] tailored for BERT
models was employed to tokenize the dataset. Tokenization converted raw text sequences into numerical
token IDs suitable for ingestion by the BERT-based model. To meet BERT’s input specifications, a
truncation strategy was applied to handle sequences exceeding the model’s maximum input length.
This approach maintained consistency in sequence lengths across the dataset, optimizing computational
eficiency during training and evaluation phases.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Methodologies Used</title>
      <sec id="sec-4-1">
        <title>4.1. Tiny BERT Text Classifier</title>
        <p>
          The Tiny BERT Text Classifier model [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is a variant of BERT optimized for English text classification
tasks, specifically focusing on the SST (Stanford Sentiment Treebank)-2 dataset [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] for sentiment
analysis. Built on transformer architecture, this model enables bidirectional understanding of language
nuances, enhancing accuracy in classifying sentences as either critical or conspiracy in nature. This
capability is crucial for distinguishing between texts that question public health decisions (critical) and
those that attribute them to malevolent conspiracies (conspiracy). By leveraging bidirectional context,
these models can capture subtle linguistic cues that diferentiate between these two types of narratives
efectively.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Enhanced Multi-label BERT Classifier</title>
        <p>
          Methodologies of subtask 2 typically involve initial dataset preparation by sourcing annotated text
spans and categorizing them for training, validation, and test sets to ensure unbiased model evaluation.
Utilizing tools like AutoTokenizer from Hugging Face’s Transformers library [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], raw text sequences
are tokenized into numerical token IDs, with strategies like truncation and padding managing sequence
lengths. Model selection focuses on transformer-based architectures pretrained on extensive text
corpora, fine-tuned for span-level classification using transfer learning techniques. Training optimizes
model parameters with Adam optimizer and Binary Cross-Entropy loss [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], while evaluation metrics
such as span-level F1-score, precision, recall, and micro-averaged F1-score assess model performance.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Implementation</title>
      <p>To implement subtask 1, the dataset is structured into a format where each text sample is categorized
either as “CRITICAL” or “CONSPIRACY”. The BertClassifier model from keras-nlp.models is then
employed with specific configurations for binary classification. Pre-trained weights are loaded, and a
sigmoid activation function is utilized to facilitate binary output. The model is trained on the training
data to distinguish between critical viewpoints and conspiracy theories regarding public health decisions.
Evaluation is performed on the test set to assess the model’s capability in accurately classifying these
texts. This approach leverages the capabilities of BERT for semantic understanding, thereby supporting
the task’s objective of discerning between critical analyses and conspiratorial narratives in the domain
of public health.</p>
      <p>
        The BERT-Based Multi-Label Text Classifier was implemented in Python using the bert-base-uncased
model architecture from Hugging Face’s Transformers library. The dataset, sourced from JSON files,
contained annotated text spans (span text) categorized into specific classes (category). After partitioning
the dataset into training (70%), validation (10%), and test (20%) sets, annotations were extracted to
prepare the data for tokenization. The Hugging Face AutoTokenizer [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] was employed to tokenize the
text sequences into numerical token IDs, with a truncation strategy applied to handle sequences longer
than BERT’s maximum input length. The model was fine-tuned for multi-label classification, optimizing
with the Adam optimizer and Binary Cross-Entropy loss function [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] over multiple epochs. Evaluation
on the validation set involved monitoring metrics such as accuracy, precision, recall, and F1-score
to ensure model performance. Finally, the trained model and tokenizer were saved for deployment,
emphasizing reproducibility and scalability in future applications. The BERT-Based Multi-Label Text
Classifier was implemented in Python using the bert-base-uncased model architecture from Hugging
Face’s Transformers library. The dataset, sourced from JSON files, contained annotated text spans
(span text) categorized into specific classes (category). After partitioning the dataset into training (70 %),
validation (10%), and test (20%) sets, annotations were extracted to prepare the data for tokenization.
The Hugging Face AutoTokenizer was employed to tokenize the text sequences into numerical token
IDs, with a truncation strategy applied to handle sequences longer than BERT’s maximum input length.
The model was fine-tuned for multi-label classification, optimizing with the Adam optimizer and Binary
Cross-Entropy loss function over multiple epochs. Evaluation on the validation set involved monitoring
metrics such as accuracy, precision, recall, and F1-score to ensure model performance. Finally, the
trained model and tokenizer were saved for deployment, emphasizing reproducibility and scalability in
future applications.
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Results and Analysis</title>
      <p>Based on the provided results for subtask 1 and subask 2 in English, the performance of the
BERTBased Multi-Label Text Classifier was evaluated. For subtask 1 [Table 1], focusing on conspiracy
and critical categorization, the model achieved an F1-macro score of 0.3700 and 0.8255, respectively,
indicating moderate performance in identifying critical texts compared to conspiracy-related ones . In
subtask 2 [Table 2], which evaluated span-level F1-score and micro-averaged F1, the model attained
scores of 0.0150 and 0.0600, respectively, suggesting challenges in precise span-level predictions. The
implementation utilized Python with the bert-base-uncased model from Hugging Face’s Transformers
library, leveraging AutoTokenizer for tokenization and fine-tuning with Adam optimizer and Binary
Cross-Entropy loss. The results underscore the model’s efectiveness in critical text classification but
highlight areas for improvement in span-level prediction accuracy.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>
        The task Oppositional Thinking Analysis: Conspiracy vs Critical tackles the challenge of distinguishing
conspiratorial from critical narratives in oppositional texts, especially regarding COVID-19. Conspiracy
theories, often depicting events as manipulated by secretive, powerful groups, are complex and hard to
separate from genuine critical thinking. The competition aims to enhance understanding and automatic
detection of these narratives, crucial for content moderation on social media. Diferentiating
conspiratorial messages from critical ones is essential, as mislabeling can push individuals toward conspiracy
communities. This task involved developing sophisticated NLP models to discern these nuances for
accurate classification and better content management. The approach included preprocessing steps like
text cleaning and feature extraction using TF-IDF (Term Frequency-Inverse Document Frequency) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
and word embeddings. Both traditional machine learning algorithms, such as logistic regression and
support vector machines, and advanced deep learning models, like LSTM (Long Short-Term Memory)
and BERT, were used. Evaluations with metrics such as accuracy, precision, recall, and F1-score showed
deep learning models, especially BERT, outperformed traditional ones. Cross-validation ensured
robustness and mitigated overfitting. The methodologies from this competition promise to improve automatic
detection of conspiratorial versus critical narratives, aiding efective content moderation on digital
platforms.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>K. M. Douglas</surname>
            ,
            <given-names>R. M.</given-names>
          </string-name>
          <string-name>
            <surname>Sutton</surname>
          </string-name>
          ,
          <article-title>What are conspiracy theories? a definitional approach to their correlates, consequences, and communication</article-title>
          ,
          <source>Annual review of psychology 74</source>
          (
          <year>2023</year>
          )
          <fpage>271</fpage>
          -
          <lpage>298</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Korenčić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. Bonet</given-names>
            <surname>Casals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taulé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <article-title>Overview of the oppositional thinking analysis pan task at clef 2024</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuvakova</surname>
          </string-name>
          , A. G. S. de Herrera (Eds.),
          <source>Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum</source>
          , Springer,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Ayele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Babakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. B.</given-names>
            <surname>Casals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elnagar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Freitag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Korenčić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Moskovskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mukherjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Rizwan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smirnova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taulé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ustalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Yimam</surname>
          </string-name>
          , E. Zangerle,
          <article-title>Overview of pan 2024: Multi-author writing style analysis, multilingual text detoxification, oppositional thinking analysis, and generative ai authorship verification - condensed lab overview, in: Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>Proceedings of the Fifteenth International Conference of the CLEF Association CLEF-2024</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghasemizade</surname>
          </string-name>
          ,
          <article-title>A computational journey through conspiracy theories: A genealogical approach (</article-title>
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Suthaharan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Suthaharan</surname>
          </string-name>
          ,
          <article-title>Support vector machine, Machine learning models and algorithms for big data classification: thinking with examples for efective learning (</article-title>
          <year>2016</year>
          )
          <fpage>207</fpage>
          -
          <lpage>235</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. I. Jordan</surname>
          </string-name>
          ,
          <article-title>Latent Dirichlet allocation</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>3</volume>
          (
          <year>2003</year>
          )
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <article-title>Non-negative matrix factorization (nmf), Machine Learning for Adaptive Many-Core Machines-A Practical Approach (</article-title>
          <year>2015</year>
          )
          <fpage>127</fpage>
          -
          <lpage>154</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chicco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tötsch</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. Jurman,</surname>
          </string-name>
          <article-title>The matthews correlation coeficient (mcc) is more reliable than balanced accuracy, bookmaker informedness, and markedness in two-class confusion matrix evaluation</article-title>
          ,
          <source>BioData mining 14</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Camizuli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Carranza</surname>
          </string-name>
          ,
          <article-title>Exploratory data analysis (eda), The encyclopedia of archaeological sciences (</article-title>
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          , et al.,
          <article-title>Huggingface's transformers: State-of-the-art natural language processing</article-title>
          , arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>03771</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>X.</given-names>
            <surname>Jiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Shang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          , Tinybert:
          <article-title>Distilling bert for natural language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>10351</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perelygin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          ,
          <article-title>Recursive deep models for semantic compositionality over a sentiment treebank</article-title>
          ,
          <source>in: Proceedings of the 2013 conference on empirical methods in natural language processing</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1631</fpage>
          -
          <lpage>1642</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Rezaei-Dastjerdehei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mijani</surname>
          </string-name>
          , E. Fatemizadeh,
          <article-title>Addressing imbalance in multi-label classification using weighted cross entropy loss function</article-title>
          ,
          <source>in: 2020 27th National and 5th International Iranian Conference on Biomedical Engineering (ICBME)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>333</fpage>
          -
          <lpage>338</lpage>
          . doi:
          <volume>10</volume>
          .1109/ ICBME51989.
          <year>2020</year>
          .
          <volume>9319440</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>L.</given-names>
            <surname>Havrlant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kreinovich</surname>
          </string-name>
          ,
          <article-title>A simple probabilistic explanation of term frequency-inverse document frequency (tf-idf) heuristic (and variations motivated by this explanation</article-title>
          ),
          <source>International Journal of General Systems</source>
          <volume>46</volume>
          (
          <year>2017</year>
          )
          <fpage>27</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>