<!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>S. Chaudhari. Twitter bot detection using supervised machine
learning. ICMAI 2021. Journal of Physics: Conference Series. 1950 (2021) 012006. 2021. URL:
https://iopscience.iop.org/article/10.1088/1742</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1109/INFOCOMMST.2017.8246399</article-id>
      <title-group>
        <article-title>Detecting of Anti-Ukrainian Trolling Tweets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kostiantyn Vyrodov</string-name>
          <email>kostya.vyrodov@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasiya Chupryna</string-name>
          <email>anastasiya.chupryna@nure.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruslan Kotelnykov</string-name>
          <email>ruslan.kotelnykov@nure.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kharkiv National University of Radio Electronics</institution>
          ,
          <addr-line>14 Nauky Ave., Kharkiv, 61166</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>2870</volume>
      <fpage>287</fpage>
      <lpage>291</lpage>
      <abstract>
        <p>The research aims to analyze the effectiveness of the modern machine-learning models usually used for data classification to detect anti-Ukrainian trolling tweets on Twitter. This research was conducted based on 6000 manually gathered tweets. The gathered dataset is divided into training and validation subsets of 75% and 25%, respectively. Also, it consists of 3000 proUkrainian tweets and 3000 anti-Ukrainian tweets. Specific conditions of experiments, models, performance metrics, platform, type of learning, and classification efficiency indicators are determined. SVM, Decision Tree, Multinomial Naive Bayes, and Logistic Regression models are trained using supervised machine learning on the colab research google platform. The evaluation is done by analyzing famous classification metrics, such as accuracy, precision, recall, and F1 score. Finally, the results of experiments are given, along with conclusions and practical recommendations on using machine learning models.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Machine Learning</kwd>
        <kwd>SVM</kwd>
        <kwd>Decision Tree</kwd>
        <kwd>Multinomial Naive Bayes</kwd>
        <kwd>Logistic Regression</kwd>
        <kwd>Twitter</kwd>
        <kwd>Bot</kwd>
        <kwd>Troll</kwd>
        <kwd>NLP</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>On 24 February 2022, Russia invaded Ukraine in a major escalation of the Russo-Ukrainian War,
which began in 2014. However, Russian aggression is not limited to the battleground but includes
cyberattacks and PSYOPS (Psychological Operations) in social media.</p>
      <p>PSYOPS are operations to convey selected information and indicators to audiences to influence their
emotions, motives, objective reasoning, and ultimately the behavior of governments, organizations,
groups, and individuals. Today, social media platforms are perfect for performing PSYOPS via troll
accounts spreading misleading information. A troll is a person who posts or makes inflammatory,
insincere, digressive, extraneous, or off-topic messages online with the intent of provoking others into
displaying emotional responses or manipulating others' perceptions.</p>
      <p>Twitter is a popular social network that the Russian government widely uses to spread
disinformation about the war in Ukraine, spoil the Ukrainian reputation, and convince Ukrainian allies
to stop their support. Therefore, detecting and eliminating troll accounts and their fake trolling content
will positively affect the security of Ukrainians and complicate the execution of PSYOPS for the
aggressor.</p>
      <p>Machine learning is one of the approaches that can be used to identify trolling content on Twitter.
This research aims to gather an up-to-date dataset related to the Russia-Ukrainian war on the Twitter
platform and to set up experiments in order to determine trolling content using the widely used machine
learning models, evaluate the effectiveness of each model within specific conditions, and formulate
recommendations on the practical application of machine learning techniques and methods to solve this
type of problem.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related works</title>
      <p>
        Detecting trolling bots is not easy because anyone can post trolling content online. Currently, more
and more researchers are devoted to developing models and technologies for protecting people from
cyberbullying (trolling) [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. In this respect, paper [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] presents the results of the analysis of
cyberbullying in social networks, paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] describes a transfer learning model for training neural
networks to recognize the facts of cyberbullying in social networks, and paper [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] proposes an effective
model for detecting emotions in messages and comments from social networks.
      </p>
      <p>
        The paper [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] proposed an integrated model to classify cyber harassment in social networks. The
paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] describes behavior-based machine-learning approaches for identifying government-sponsored
Twitter trolls. The paper [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] proposes and presents a model for detecting trolls based on user sentiment
analysis, including the results of experiments proving this statement. The paper [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] describes the
detection of cyber trolls using a model for extracting word embeddings (including hashtags) from tweets
to identify groups of interest. The works [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ] provide an up-to-date review of models and algorithms
for detecting farms and networks of trolls, Twitter bots, and their posts when interfering with networks
at the state level. The paper [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] shares models and algorithms for detecting facts of collusion between
retweets. The paper presents the results of the analysis, detection, and characteristics of such trolls and
messages. The work [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] provides an interesting model for establishing parallels and transferring
technologies from electronic warfare to detecting and combating fake news, trolls, and troll farms. The
paper [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] considers the topical issue of the online trolling ecosystem. Since trolling is integral to the
functioning of modern social networks, models are proposed for detecting trolling facts along with
interesting assessments, analyses, and recommendations for practical application.
      </p>
      <p>
        The analysis of the current state of this problem shows that the vast majority of research is devoted
to analyzing information on Twitter based on the use of neural networks and ML. Papers [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ]
propose emotion recognition results on Twitter using the Unison application model. In addition, the
papers provide the results of comparable studies and learning outcomes. The paper [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] uses a
multiaspect neural network Attentional Graph to determine the user's location in a social network. The
analysis of modern publications shows an excellent prospect for using neural networks, not only for the
analysis of textual information but also for the effect of (graphic) accumulation [
        <xref ref-type="bibr" rid="ref17 ref18 ref19">17–19</xref>
        ], mainly people's
faces and emotions. The paper [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] presents the results of a study on the imitation and recognition of
sarcasm on Twitter. The work [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] presents the results (models and algorithms) for detecting and
extracting social events from Twitter based on the BiLSTM-CRF model. The paper [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] presents the
results of the effects of political polarization of opinions (posts) in social networks based on the use of
neural networks. The paper [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] presents the results of detecting rumors in social networks using
transformer-type models. The paper [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] proposed a new algorithm that was called the "multilevel tweet
analyzer" (MLTA). This algorithm allows text to be graphically represented in social networks using
multi-layer networks (MLN) in order to obtain better results of coding relationships between
independent sets of tweets.
      </p>
      <p>
        The development of modern representation models is no less important for the combination and
presence of cyberbullying facts estimation in e-learning and some other systems [
        <xref ref-type="bibr" rid="ref25">25, 26</xref>
        ].
      </p>
      <p>A study analyzing government-sponsored trolls related to the Russian troll farm found that usually
trolling bots create a small portion of destructive content, such as posts or comments, and heavily spread
them by retweeting and copy-pasting the same information within a specific period [27]. Existing
Twitter bot detection methods can be grouped into feature-based, text-based, and graph-based methods
[28].</p>
      <p>The idea of feature-based methods is to discover features from user information and utilize machine
learning classification algorithms to detect bots. Researchers extract properties from users' metadata,
their follow relationships, and tweets, including various time patterns. The paper [29] presents results
where researchers achieved 87% accuracy in detecting Twitter bots using different machine-learning
methods on a dataset containing metadata about Twitter profiles. However, bot owners are increasingly
aware of discovered features allowing others to identify bot accounts, so new bots try to imitate other
behavior to evade detection. Subsequently, engineers implementing this approach for bot detection have
to keep track of bot evolution to keep their models actual.</p>
      <p>Graph-based methods treat Twitter as graphs using concepts from network science. This approach
adopts neural graph networks, heterogeneous graph neural networks, and node representation learning
to detect Twitter bots. For example, a group of researchers from Xi’an Jiaotong University proposed
TwiBot-22, a graph-based Twitter bot detection benchmark that presents a comprehensive dataset,
providing diversified entities and relations on the Twitter network. They re-implemented 35 Twitter bot
detection baselines, evaluated them on nine datasets, and achieved about 80% accuracy [30].</p>
      <p>Text-based methods utilize techniques in NLP to detect trolling bots based on tweets. Under the
hood, the methods use word embeddings, recurrent neural networks, and pre-trained language models.
Since trolling content is primarily textual and usually represented as a comment or a post containing
hostile language, employing a linguistic and sentiment analysis is a good approach for detecting trolling
content.</p>
      <p>The paper [31] shares the results of applying domain-adaptation techniques for sentiment analysis
of textual content in online forums. The researchers achieved around 70% in detecting trolls. In the
paper [32], researchers evaluated the sentiments of posts and other metadata from trolling posts and
were able to detect Twitter trolls more than 76% of the time. C.J. Hutto and Eric Gilbert presented
VADER [33], a simple rule-based model for general sentiment analysis. Utilization of the VADER in
combination with sentiment, aggression, lexical, and syntactic textual features to determine whether a
tweet is meant to troll or not achieved 88% accuracy when tested with the Kaggle Twitter cyber-trolls
dataset [34, 35]. Todor Mihaylov and Preslav Nakov developed two classifiers for detecting "sponsored
trolls" trying to manipulate the public's opinion and another for detecting "individual trolls" trying to
provoke negative emotions. They combined sentiment analysis with metadata of trolling posts
(information about the publication time) and achieved 82% accuracy [36].</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methods and materials</title>
      <p>Consider input data, used methods and conditions for experiments and metrics to understand which
model demonstrates better results.
3.1.</p>
    </sec>
    <sec id="sec-4">
      <title>Data description</title>
      <p>In this study, existing Twitter datasets with already identified trolling users and trolling tweets (e.g.,
the IRA troll dataset or the Dataset of Russian trolling tweets for detection of cyber-trolls [37]) were
not used because they are not directory related to the context of the Russia-Ukrainian war.</p>
      <p>The data set, which was used for the research, consists of raw new tweets and labels specifying
whether a tweet is anti-Ukrainian or not. The tweets were gathered via Twitter API and filtered by one
of the similar keywords: “zov”, “nazis”, “azov”, “russia is a terrorist state” or “putin war crimes”
including different hashtags such “#RussiaInvadedUkraine” or “#ZOV”. Such keywords were selected
to find tweets where a user wanted to deliberately create an association with one of the sides in this war.
Each tweet was manually labeled as a pro-Ukrainian or an anti-Ukrainian one by the researcher. All
tweets were gathered via a JS script and saved into a Comma Separated Value (CSVs) file that could
be easily imported into an ML model.</p>
      <p>The dataset contains 6000 items. There are 3000 of anti-Ukrainian tweets and 3000 of pro-Ukrainian
tweets. Table 1 demonstrates two samples from the data set.</p>
      <p>The “TweetId” column represents an id of the tweet and can be used in future research to get extra
data about the tweet. “TweetId” is represented as a number containing 19 digits.</p>
      <p>The “Text” column is a raw tweet congaing a maximum of 280 characters, and the “Label” column
points to the category of the concrete sample. The “Text” can contain arbitrary characters and words,
including emojis, links, or hashtags.</p>
      <p>The dataset was split into two parts to analyze content and build the frequency distribution charts
based on used words. The first part contained anti-Ukrainian tweets and the second contained
proUkrainian tweets. Each tweet was split into words and filtered from stop words and non-alphabetical
symbols. Figure 1 displays the distribution of the words in anti-Ukrainian tweets, and Figure 2 displays
the distribution in pro-Ukrainian tweets.</p>
      <p>It is possible to see in Figure 1 that the most popular words in anti-Ukrainian tweets are “Ukraine”,
“Ukrainian”, “russian”, “Russia”, “war”, “nazi”, “NATO”, “zelensky”. In addition, these tweets contain
specific for this category words, such as “zelenskywarcrime” or “ukrainenazis”.</p>
    </sec>
    <sec id="sec-5">
      <title>Machine learning models validation and metrics/efficiency indicators</title>
      <p>Machine learning models are built based on feedback from evaluated performance metrics that help
to understand whether a model meets requirements.</p>
      <p>There are different metrics in the AI Industry, such as recall or precision, helping to evaluate the
performance of a model. This research will use accuracy, precision, recall, and F1 metrics that are
derived from the confusion matrix.</p>
      <p>A confusion matrix (Figure 3) is a tabular structure that helps visualize the performance of
classifiers. Each column in the matrix represents classified instances based on predictions, and each
row of the matrix represents classified instances based on the actual class labels.</p>
      <p>True Positive (TP) indicates the number of correct hits or predictions for our positive class. False
Negative (FN) indicates the number of instances we missed for that class by predicting it falsely as the
negative class.</p>
      <p>False Positive (FP) is the number of instances we predicted wrongly as the positive class when it
was not.</p>
      <p>True Negative (TN) is the number of instances we correctly predicted as the negative class.</p>
      <p>Accuracy is defined as the overall accuracy or proportion of correct predictions of the model, which
can be depicted by the formula (1) where we have our correct predictions in the numerator divided by
all the outcomes in the denominator.</p>
      <p>+</p>
      <p>.
 =</p>
      <p>+  +  +</p>
      <p>Precision is defined as the number of predictions made that are correct or relevant out of all the
predictions based on the positive class. This is also known as positive predictive value and can be
depicted by the formula (2) where we have our correct predictions in the numerator for the positive
class divided by all the predictions for the positive class including the false positives.
 (2)
 = .</p>
      <p>+</p>
      <p>Recall is defined as the number of instances of the positive class that were correctly predicted. This
is also known as hit rate, coverage, or sensitivity and can be depicted by the formula (3) where we have
our correct predictions for the positive class in the numerator divided by correct and missed instances
for the positive class, giving us the hit rate.</p>
      <p>+</p>
      <p>F1 score is another accuracy measure that is computed by taking the harmonic mean of the precision
and recall and can be represented by the formula (4).</p>
      <p>2 ∗  ∗  (4)
1  = .</p>
      <p>+ 
(1)
(3)
 =

.</p>
    </sec>
    <sec id="sec-6">
      <title>Main methods and techniques</title>
      <p>This research will rely on NLP techniques since the primary piece of information in the dataset is
raw text. NLP or Natural Language Processing is a part of computer science, human language, and
artificial intelligence whose goal is to make a program capable of “understanding” the content of
documents, including the contextual nuances of the language within them.</p>
      <p>The first step is the normalization of data. Data normalization is a process consisting of steps that
should be followed to wrangle, clean, and standardize textual data into a form that machine learning
models could consume.</p>
      <p>Text normalization steps:
1. Tokenization. It is the process of splitting or segmenting text from sentences into their constituent
words.</p>
      <p>2. Removing special symbols such as punctuation or emojis.
3. Expanding contractions such as “won’t” or “can’t”.
4. Case conversion. Transforming all tokens to lowercase or uppercase.</p>
      <p>5. Removing stop words, words that have little or no significance. They are removed to retain words
having maximum significance and context.</p>
      <p>6. Stemming. It is the process of reducing a word to its stem that affixes to suffixes and prefixes or
the roots of words.</p>
      <p>7. Lemmatization.</p>
      <p>The next step after the normalization of the text is its vectorization. Text vectorization is the process
of converting text into a numerical representation. It is done since machine learning models can not
understand the text as is and require the data's numeric representation. This research will use two
popular vectorization methods: bag of words and normalized TF-IDF.</p>
      <p>The bag of words model is one of the most straightforward yet powerful techniques to extract
features from text documents. The essence of this model is to convert text documents into vectors such
that each document is converted into a vector representing the frequency of all the distinct words present
in the document vector space for that specific document.</p>
      <p>TF-IDF stands for Term Frequency-Inverse Document Frequency, a combination of two metrics:
term frequency and inverse document frequency. This technique was initially developed as a metric for
ranking functions for showing search engine results based on user queries and has come to be a part of
information retrieval and text feature extraction now.</p>
      <p>The cleaned and vectorized data is forwarded as input into the model for training. This research will
focus on decision trees, SVM, multinomial naive bayes, and logistic regression models to find out which
of them, within specific conditions, give the best results. These models were selected since they are
well-established and reliable. In addition, they are capable of drawing a line between different features
in a multi-dimensional space detecting the optimal line between the trolling and non-trolling tweets.</p>
    </sec>
    <sec id="sec-7">
      <title>4. Experiment</title>
      <p>In order to identify the best model that is preferred to be used for detecting trolling content, we will
run multiple experiments using various machine-learning models that will be tested under different
conditions.</p>
      <p>For the experiments, the CoLab Research Google platform will be used. The programming
language is Python since it is well-supported in CoLab. In addition, the programming language has
many libraries for analyzing data and training models. All machine learning models, such as logistic
regression or multinomial naive bayes and vectorization packages, will be taken from the sklearn
Python package. The pandas library is required for experiments as it provides data reading and
manipulation functions. The pyplot library will be used for data visualization, and nltk will be used for
text preprocessing.</p>
      <p>The experiment consists of 3 parts and is visualized in Figure 2.</p>
      <p>The first step in the experiment is data preparation. The entire dataset containing 6000 samples and
represented as a CSV file will be read using the “pandas” library. After this, column “TweetId” will be
dropped since it does not give any value to models and exists only as a reference to the original tweet
for extra information. As a result, the dataset containing data will consist of two columns: “Text” and
“IsTrolling”. The column “Text” is represented as an arbitrary text that contains links, emojis, and stop
words such as articles “the” or “a”. The column “IsTrolling” is represented as a number one or zero.</p>
      <p>After this, it necessary to perform text normalization. It is required because it can positively affect
the results of experiments.</p>
      <p>The normalization of text consists of the following steps:
● Words tokenization, a process of splitting a sentence into separate words, which will simplify
the performing of the next steps.
● Cleaning all website links using regular expressions. It is required because they do not bring
meaningful information and can confuse a machine learning model for experimenting.
● Cleaning everything except alphabetical and numerical characters.
● Lemmatization, a process of grouping the inflected forms of a word so they can be analyzed as
a single item.
● Stemming, a process of reducing inflected words to their word stem.
● Removing stop words.</p>
      <p>The normalization is done using regular expressions for cleaning up text from needless data and
using the “nltk” library. The “nltk” has already implemented functions for lemmatization, stemming,
and removing stop words.</p>
      <p>The second step is text vectorization. It is necessary because machine learning models can not
directly work with text and need data to be represented as numbers, so vectorization is the process
of converting text into numerical data. There are various algorithms of vectorization, but this
research will use bag of words and normalized TF-IDF since they are the most popular and are
available out of the box on the colab.</p>
      <p>The final step is the training of models and obtaining results. Vectorized data will be split in the
ratio of 75% and 25% to have training and validation sets. When the text is normalized, vectorized,
and divided into training and validation chunks, ML models will be trained. For the first experiment,
the support vector machine model will be used. The second experiment will use the decision tree
model. The multinomial naive bayes will be used for the third one, and the last experiment will use
logistic regression.</p>
      <p>Every model will have separate experiments for bag of words and normalized TF-IDF
vectorization algorithms. In addition, every model will be tested with different levels of text
normalization. There will be experiments with:
1. Fully normalized text.
2. Normalization without stemming.
3. Normalization without stemming and lemming.
4. Normalization without stemming, lemming and removing stop words.
5. Normalization without stemming, lemming, removing stop words, and cleaning not
alphabetical characters.</p>
      <p>After every run of the experiment, the following metrics will be collected: accuracy, recall,
precision, and F1, and saved in a separate table for analysis. As a result, it should be possible to
determine what model has the better output and should be used for detecting trolling tweets.</p>
    </sec>
    <sec id="sec-8">
      <title>5. Results</title>
      <p>Consider obtained results of experiments conducted under different conditions using different
machine learning models, algorithms of vectorization, and different levels of text normalization. Each
chapter demonstrates results for the concrete model, but with different algorithms for text vectorization
and different levels of text normalization.
5.1.</p>
    </sec>
    <sec id="sec-9">
      <title>Support vector machine</title>
    </sec>
    <sec id="sec-10">
      <title>Multinomial naive bayes</title>
    </sec>
    <sec id="sec-11">
      <title>Logistic regression</title>
    </sec>
    <sec id="sec-12">
      <title>6. Discussion</title>
      <p>After analyzing the results (metrics) listed above, it is possible to conclude that the multinomial
naive bayes model provides the best result with the bag of words algorithm for text vectorization. The
result of multinomial naive bayes is 89.4% in all metrics. At the same time, the worst results
demonstrated the decision tree with 75.46% in all metrics using the bag of words vectorizer. The
difference between the multinomial naive bayes and the decision tree is 13.94%. The worst result for
the multinomial naive bayes was 87.13% with normalized TF-IDF, while the best outcome for the
decision tree was 81.06% with the bag of words algorithm.</p>
      <p>Logistic regression demonstrated 88.53% accuracy, which is second among the tested models. The
logistic regression achieved this result with the bag of words vectorization algorithm and the text that
was not normalized. The difference between the best and the worst result for this model is 4.47%.</p>
      <p>The SVM model took third place and achieved 88.46%, which is only 0.07% lower than the logistic
regression. This result was achieved using the normalized TF-IDF algorithm with the raw text that was
not normalized. The difference between this model's best and worst results is 4%. Figure 3 visualizes
discussed results and shows the difference between the best and the worst result for every model.
90
88
86
84
82
80
78
76
74
72
70</p>
      <p>SVM</p>
      <p>Decission tree</p>
      <p>Multinomial naive bayes</p>
      <p>Logistic regression</p>
      <p>An interesting fact is that only sometimes the text normalization leads to improvement of results.
Although there is no direct correlation in metrics when text normalization is done or not, overall, this
practice may positively affect results. For instance, the SVM model demonstrates good results with the
bag of words vectorizer and full-text normalization. However, the best result among all experiments
this model gave was when the text was not normalized, and the model used the normalized TF-IDF
vectorizer. Proper text normalization can improve the model's performance by 4.26%.</p>
      <p>There is no clear performance correlation in vectorizer algorithms since different models with
various levels of text normalization demonstrated different results. However, normalized TF-IDF gave
better results in 3 out of 4 models with the text without normalization. The most significant difference
between vectorization algorithms is 4.47%, so it is worth trying different vectorization approaches to
improve metrics.</p>
      <p>Based on the analyzed results, it is possible to recommend using the multinomial naive bayes model
for detecting trolling content since it demonstrated the best result among all models. In addition, using
the normalized TF-IDF vectorizer is preferred because it will most likely demonstrate a better result.
Also, it is not recommended to use fully normalized text, and it is better to try different normalization
levels to find that normalization level that will improve metrics.</p>
    </sec>
    <sec id="sec-13">
      <title>7. Conclusion</title>
      <p>The researchers gathered 6000 tweets during this research, where every tweet was labeled as
antiUkrainian or pro-Ukrainian. The researchers selected four popular machine learning models and
conducted experiments to identify which ML model is the most suitable for identifying trolling content
in Tweets. The data samples were split in a 75% and 25% ratio for training and validating models.
Google colab was used as the experiment environment. This platform allows utilizing a programming
language called Python, which is popular in ML and Data Science and has an enormous number of
libraries for machine learning.</p>
      <p>Every model was tested under different conditions. They were tested with different algorithms of
text vectorization and with different levels of text normalization. Unexpectedly text normalization only
sometimes improves the performance metrics of models. For instance, the SVM model demonstrated
better performance results with no normalized text among all experiments conducted for the model.</p>
      <p>The multinomial naive bayes showed the best results for the selected tweets with completely
normalized text and the bag of words vectorization algorithm. At the same time, the worst results were
obtained from the decision tree in combination with the bag of words vectorization algorithm and
without text normalization.</p>
      <p>The results of the current research possibly could be used in big data methods for E-learning systems
trying to optimize the learning process for teachers and students, which were described in the work
[38]. The primary idea of such systems is organizing information stored in libraries with unstructured
data from emerging outlets such as social media.</p>
    </sec>
    <sec id="sec-14">
      <title>8. Reference</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ochoa</surname>
          </string-name>
          et al.,
          <article-title>"Analysis of Cyber-bullying in a virtual social networking,"</article-title>
          <source>2011 11th International Conference on Hybrid Intelligent Systems (HIS)</source>
          , Melacca, Malaysia,
          <year>2011</year>
          , pp.
          <fpage>229</fpage>
          -
          <lpage>234</lpage>
          , doi: 10.1109/HIS.
          <year>2011</year>
          .
          <volume>6122110</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Behzadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. G.</given-names>
            <surname>Harris</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Derakhshan</surname>
          </string-name>
          ,
          <article-title>"Rapid Cyber-bullying detection method using Compact BERT Models,"</article-title>
          <source>2021 IEEE 15th International Conference on Semantic Computing (ICSC)</source>
          , Laguna Hills, CA, USA,
          <year>2021</year>
          , pp.
          <fpage>199</fpage>
          -
          <lpage>202</lpage>
          , doi: 10.1109/ICSC50631.
          <year>2021</year>
          .
          <volume>00042</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Canales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Strapparava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Boldrini</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Martínez-Barco</surname>
          </string-name>
          ,
          <article-title>"Intensional Learning to Efficiently Build Up Automatically Annotated Emotion Corpora,"</article-title>
          <source>in IEEE Transactions on Affective Computing</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>335</fpage>
          -
          <issue>347</issue>
          , 1 April-June 2020, doi: 10.1109/TAFFC.
          <year>2017</year>
          .
          <volume>2764470</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>K. B. Raj</surname>
            ,
            <given-names>J. K.</given-names>
          </string-name>
          <string-name>
            <surname>Seth</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Gulati</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Choubey</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <article-title>Patni and Bhawna, "</article-title>
          <source>Automated Cyberstalking Classification using Social Media," 2022 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES)</source>
          , Chennai, India,
          <year>2022</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          , doi: 10.1109/ICSES55317.
          <year>2022</year>
          .
          <volume>9914337</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Alhazbi</surname>
          </string-name>
          ,
          <article-title>"Behavior-Based Machine Learning Approaches to Identify State-Sponsored Trolls on Twitter,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>8</volume>
          , pp.
          <fpage>195132</fpage>
          -
          <lpage>195141</lpage>
          ,
          <year>2020</year>
          , doi: 10.1109/ACCESS.
          <year>2020</year>
          .
          <volume>3033666</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xiong</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <article-title>"Discriminating Topical Influencers Based on the User Relative Emotion,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>7</volume>
          , pp.
          <fpage>100120</fpage>
          -
          <lpage>100130</lpage>
          ,
          <year>2019</year>
          , doi: 10.1109/ACCESS.
          <year>2019</year>
          .
          <volume>2929548</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Recalde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendieta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Boratto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Terán</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vaca</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Baquerizo</surname>
          </string-name>
          ,
          <article-title>"Who You Should Not Follow: Extracting Word Embeddings from Tweets to Identify Groups of Interest and Hijackers in Demonstrations,"</article-title>
          <source>in IEEE Transactions on Emerging Topics in Computing</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>206</fpage>
          -
          <issue>217</issue>
          , 1 April-June 2019, doi: 10.1109/TETC.
          <year>2017</year>
          .
          <volume>2669404</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Luca</given-names>
            <surname>Follis; Adam Fish</surname>
          </string-name>
          ,
          <article-title>"3 When to Hack," in Hacker States</article-title>
          , MIT Press,
          <year>2020</year>
          , pp.
          <fpage>73</fpage>
          -
          <lpage>111</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Kate</given-names>
            <surname>Eichhorn</surname>
          </string-name>
          ,
          <article-title>"5 JOURNALISM AND POLITICS AFTER CONTENT,"</article-title>
          in Content , MIT Press,
          <year>2022</year>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>127</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H. S.</given-names>
            <surname>Dutta</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <article-title>"Blackmarket-Driven Collusion Among Retweeters-Analysis, Detection, and Characterization,"</article-title>
          <source>in IEEE Transactions on Information Forensics and Security</source>
          , vol.
          <volume>15</volume>
          , pp.
          <fpage>1935</fpage>
          -
          <lpage>1944</lpage>
          ,
          <year>2020</year>
          , doi: 10.1109/TIFS.
          <year>2019</year>
          .
          <volume>2953331</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Ross</surname>
            <given-names>Anderson,</given-names>
          </string-name>
          "Electronic and
          <string-name>
            <given-names>Information</given-names>
            <surname>Warfare</surname>
          </string-name>
          ,
          <article-title>" in Security Engineering: A Guide to Building Dependable Distributed Systems</article-title>
          , Wiley,
          <year>2020</year>
          , pp.
          <fpage>777</fpage>
          -
          <lpage>814</lpage>
          , doi: 10.1002/9781119644682.ch23.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>H.</given-names>
            <surname>Berghel</surname>
          </string-name>
          ,
          <article-title>"Trolling Pathologies,"</article-title>
          <source>in Computer</source>
          , vol.
          <volume>51</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>66</fpage>
          -
          <lpage>69</lpage>
          ,
          <year>March 2018</year>
          , doi: 10.1109/
          <string-name>
            <surname>MC</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <volume>1731067</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>H.</given-names>
            <surname>Berghel</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Berleant</surname>
          </string-name>
          ,
          <article-title>"The Online Trolling Ecosystem,"</article-title>
          <source>in Computer</source>
          , vol.
          <volume>51</volume>
          , no.
          <issue>8</issue>
          , pp.
          <fpage>44</fpage>
          -
          <lpage>51</lpage>
          ,
          <year>August 2018</year>
          , doi: 10.1109/
          <string-name>
            <surname>MC</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <volume>3191256</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>N.</given-names>
            <surname>Colnerič</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Demšar</surname>
          </string-name>
          ,
          <article-title>"Emotion Recognition on Twitter: Comparative Study and Training a Unison Model,"</article-title>
          <source>in IEEE Transactions on Affective Computing</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>433</fpage>
          -
          <issue>446</issue>
          ,
          <fpage>1</fpage>
          <lpage>JulySept</lpage>
          .
          <year>2020</year>
          , doi: 10.1109/TAFFC.
          <year>2018</year>
          .
          <volume>2807817</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>N.</given-names>
            <surname>Colnerič</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Demšar</surname>
          </string-name>
          ,
          <article-title>"Emotion Recognition on Twitter: Comparative Study and Training a Unison Model,"</article-title>
          <source>in IEEE Transactions on Affective Computing</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>433</fpage>
          -
          <issue>446</issue>
          ,
          <fpage>1</fpage>
          <lpage>JulySept</lpage>
          .
          <year>2020</year>
          , doi: 10.1109/TAFFC.
          <year>2018</year>
          .
          <volume>2807817</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>"Multiple-Aspect Attentional Graph Neural Networks for Online Social Network User Localization,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>8</volume>
          , pp.
          <fpage>95223</fpage>
          -
          <lpage>95234</lpage>
          ,
          <year>2020</year>
          , doi: 10.1109/ACCESS.
          <year>2020</year>
          .
          <volume>2993876</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K.</given-names>
            <surname>Smelyakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shupyliuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Martovytskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tovchyrechko</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Ponomarenko</surname>
          </string-name>
          ,
          <article-title>"Efficiency of image convolution,"</article-title>
          <source>2019 IEEE 8th International Conference on Advanced Optoelectronics and Lasers (CAOL)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>578</fpage>
          -
          <lpage>583</lpage>
          , doi: 10.1109/CAOL46282.
          <year>2019</year>
          .
          <volume>9019450</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>K.</given-names>
            <surname>Smelyakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chupryna</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          <article-title>Bohomolov and I. Ruban, "The Neural Network Technologies Effectiveness for Face Detection,"</article-title>
          <source>2020 IEEE Third International Conference on Data Stream Mining &amp; Processing (DSMP)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>201</fpage>
          -
          <lpage>205</lpage>
          , doi: 10.1109/DSMP47368.
          <year>2020</year>
          .
          <volume>9204049</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Smelyakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chupryna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Bohomolov</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Hunko</surname>
          </string-name>
          ,
          <article-title>"The Neural Network Models Effectiveness for Face Detection</article-title>
          and
          <string-name>
            <given-names>Face</given-names>
            <surname>Recognition</surname>
          </string-name>
          ,
          <article-title>"</article-title>
          <source>2021 IEEE Open Conference of Electrical, Electronic and Information Sciences (eStream)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          , doi: 10.1109/eStream53087.
          <year>2021</year>
          .
          <volume>9431476</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>F.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , W. Liang and
          <string-name>
            <given-names>K.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <article-title>"Mimicking the Brain's Cognition of Sarcasm From Multidisciplines for Twitter Sarcasm Detection,"</article-title>
          <source>in IEEE Transactions on Neural Networks and Learning Systems</source>
          , vol.
          <volume>34</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>228</fpage>
          -
          <lpage>242</lpage>
          , Jan.
          <year>2023</year>
          , doi: 10.1109/TNNLS.
          <year>2021</year>
          .
          <volume>3093416</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>"Jointly Detecting and Extracting Social Events From Twitter Using Gated BiLSTM-CRF," in IEEE Access</article-title>
          , vol.
          <volume>7</volume>
          , pp.
          <fpage>148462</fpage>
          -
          <lpage>148471</lpage>
          ,
          <year>2019</year>
          , doi: 10.1109/ACCESS.
          <year>2019</year>
          .
          <volume>2947027</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>L.</given-names>
            <surname>Belcastro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cantini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Marozzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Talia</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Trunfio</surname>
          </string-name>
          ,
          <article-title>"Learning Political Polarization on Social Media Using Neural Networks,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>8</volume>
          , pp.
          <fpage>47177</fpage>
          -
          <lpage>47187</lpage>
          ,
          <year>2020</year>
          , doi: 10.1109/ACCESS.
          <year>2020</year>
          .
          <volume>2978950</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <article-title>"Deep Feature Fusion for Rumor Detection on Twitter,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>9</volume>
          , pp.
          <fpage>126065</fpage>
          -
          <lpage>126074</lpage>
          ,
          <year>2021</year>
          , doi: 10.1109/ACCESS.
          <year>2021</year>
          .
          <volume>3111790</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Longa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Luca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kaul</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Lopez</surname>
          </string-name>
          ,
          <article-title>"Emotion Analysis Using Multilayered Networks for Graphical Representation of Tweets,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>10</volume>
          , pp.
          <fpage>99467</fpage>
          -
          <lpage>99478</lpage>
          ,
          <year>2022</year>
          , doi: 10.1109/ACCESS.
          <year>2022</year>
          .
          <volume>3207161</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>I.</given-names>
            <surname>Shubin</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kyrychenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Goncharov</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Snisar</surname>
          </string-name>
          ,
          <article-title>"Formal representation of knowledge for infocommunication computerized training systems," 2017 4th International Scientific-Practical</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>