<!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>Syed Abdul Razak. ”Malicious accounts: Dark of the social networks.”Journal of Network and
Computer Applications</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.23919/CYCON.2019.8756832</article-id>
      <title-group>
        <article-title>Methodology for Countering Malicious Information on Social Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Svitlana Popereshnyak</string-name>
          <email>spopereshnyak@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Viktoriia Zhebka</string-name>
          <email>viktoria.zhebka@ukr.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasiya Vecherkovskaya</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>COLINS-2024: 8th International Conference on Computational Linguistics and Intelligent Systems</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”</institution>
          ,
          <addr-line>37, Prospect Beresteiskyi, Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>State University of Information and Communication Technologies</institution>
          ,
          <addr-line>str. Solomyanska, Kyiv, 03110, 7</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>24, Bohdana Gavrylyshyn Street, Kyiv, 02000</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>79</volume>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This work is devoted to an urgent problem, namely, the fight against malicious information on social networks. The goal of this work is to increase the effectiveness of countering malicious information in social networks by analyzing the sources of malicious information and automating the process of selecting countermeasures. The theoretical significance of this work lies in its contribution to the development of the theory and methodology of information security. The proposed approach allows us to determine scientifically based requirements for solving problems related to the analysis of sources of malicious information on social networks and countering both the message itself and its source. In addition, the developed models, algorithms, methods and architecture can be included in the operator's decision support system in order to combat malicious information. The proposed models, algorithms, methods and architecture, as well as their practical implementation, together provide a solution to the current scientific and technical problem of increasing the effectiveness of countering the spread of malicious information on social networks.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Model</kwd>
        <kwd>algorithm</kwd>
        <kwd>methodology</kwd>
        <kwd>malicious information</kwd>
        <kwd>social networks</kwd>
        <kwd>information security1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The deep implementation of social media in daily life is huge, and its advantage is that the
participants of communication can quickly express their opinions to a large audience and share
media files. Nowadays, social networks play not only the role of a means of communication, but
also a tool for information dissemination. One of the obvious problems of information security in
modern society is the spread of malicious information. Terrorist and criminal groups are
increasingly using the means of information influence, developing strategies to expand their
influence and attract new supporters through social networks. Therefore, one of the key elements
of information security is to control, analyze and actively counteract malicious information in
social networks. The concept of "malicious information" is considered by experts from various
sciences, but no consensus has yet been reached.</p>
      <p>Currently, the problem of combating malicious information has an insufficient number of
scientific and technical solutions. The known means of detecting and counteracting malicious
information in social networks do not meet the requirements for speed, completeness, accuracy
and adequacy of decisions. This is due to several reasons, including the division of systems into
two independent modules (Figure 1): monitoring and counteraction.</p>
      <p>In between these modules is the operator, which plays a central role. In addition, social
networks have a complex structure and contain many different messages, which is often not taken
into account when defining countermeasure targets, such as message type, message source and
other parameters. It is important to note that huge volumes of messages need to be processed in
real time and targets for countermeasures need to be identified quickly. Manually, a
countermeasure operator cannot completely stop the spread of malicious information.</p>
      <p>Monitoring</p>
      <p>Operator</p>
      <p>Opposition</p>
      <p>
        Consequently, the main problem in combating malicious information in social networks is
directly related to the current trends in the development of the information sphere, namely: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
increasing the volume of messages containing malicious information; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) increasing the speed of
malicious information dissemination; (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) increasing the speed of message replication; (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
increasing the speed of new sources of information dissemination in social networks; (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
increasing the number of ways to attract the attention of the audience; (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) increasing the level of
heterogeneity; (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) increasing the number of ways to attract the audience's attention; and (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
increasing the level of information dissemination in social networks. This requires improved
effectiveness in combating malicious information on social networks, including more rapid and
well-founded countermeasures.
      </p>
      <p>Thus, the task that this study addresses - developing models, algorithms and methods to
combat malicious information in social networks - is highly relevant.</p>
      <p>The goal of this work is to increase the effectiveness of countering malicious information in
social networks by analyzing the sources of malicious information and automating the process of
selecting countermeasures.</p>
      <p>The theoretical significance of this work lies in its contribution to the development of
information security theory and methodology. The proposed approach makes it possible to define
scientifically sound requirements for solving problems related to analyzing the sources of
malicious information in social networks and counteracting both the message itself and its
source. In addition, the developed models, algorithms, methodology and architecture can be
included in the operator's decision support system to combat malicious information.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <p>The emergence of online social networking platforms has completely transformed how students
interact with information and one another. With the internet's ascent and the interactive nature
of online spaces, a global phenomenon known as social networking has emerged. This
encompasses a wide array of activities, ranging from the creation of virtual communities to casual
conversations and blogging. A study [1] explores the extensive utilization of Social Networking
Sites and their influence, particularly on student. The primary objective of the research [2] was
to explore the dynamics of knowledge sharing within academic social networks among university
students. The results of the study revealed a notable correlation between perceived personal
outcome expectations, perceived social expectations, and knowledge sharing among students.</p>
      <p>As social media usage escalates, individuals using these platforms become increasingly
susceptible to their negative impacts. Detecting cyberbullying on social media platforms poses a
significant challenge, particularly due to the constant evolution of slang. Nonetheless, in the paper
[3] proposes a practical solution—an application designed to identify cyberbullying across
various social media platforms, leveraging data from Twitter and Wikipedia. The paper utilizes
Deep Learning techniques to accomplish this task effectively.</p>
      <p>In the study [4], two prevalent algorithms for network community detection were examined:
Agglomerative Hierarchical Clustering and the Louvain Method. The research delved into their
mechanisms, investigating and contrasting their implementation nuances and the outcomes of
their clustering behavior on a standardized dataset.</p>
      <p>Advancements in technology have resulted in the accumulation of vast amounts of data from
diverse sources, such as biological and social networking data. Consequently, there has been
significant interest in social network analysis, given the abundance of raw datasets that can be
conceptualized using a network framework. The majority of these datasets can be represented as
social networks, characterized by a graph structure comprising actors and their relationships.
Numerous tools have been developed for social network analysis, aimed at extracting insights
from these networks. In [5], an enhanced version of NetDriller is presented, incorporating new
essential features, including the construction of social networks through data collected from
platforms like Twitter, IEEE, and DBLP.</p>
      <p>As machine learning techniques increasingly intersect with real-world scenarios, the
application contexts for these algorithms become progressively complex. Various domains across
different fields have embraced and profited from the implementation of diverse machine learning
algorithms. This complexity is particularly pronounced within the realm of social networks [6].</p>
      <p>Unfortunately, there are limited studies that have explored the integration of convolutional
neural networks for automating opinion discretization. In their paper [7], the authors introduce
a novel distributed architecture aimed at addressing the challenge of opinion classification
mining. With experimental results yielding high accuracy (72.99% ± 3.64), it can be inferred that
implementing the authors' proposed distributed framework for opinion discretization on
Facebook is indeed viable.</p>
      <p>The study outlined in reference [8, 9] explores primary categories of social networks and their
respective analytical methodologies. It delves into various types of connections and scrutinizes
issues pertaining to ties within social networks. Additionally, it investigates and confirms the
correlation between graph theory principles and the analysis of social networks.</p>
      <p>Social networks have experienced significant success in facilitating online social interaction.
However, malicious users exploit these platforms to disseminate rumors. Recent studies indicate
that integrating social applications can enhance efficiency. Regrettably, new security challenges
arise as malicious users exploit this integration to spread rumors across multiple social networks.
In paper [10], which addresses cross propagation in multilayer social networks, the S2IR2 model
is introduced to analyze the dynamics of rumor spreading.</p>
      <p>The research [11] examines several network metrics, including modularity-based algorithms
for community detection and dsynamics within and between groups. Additionally, it explores
network measures such as Degree centrality, betweenness centrality, closeness centrality,
authority, and hub, which could correspond to essential leadership qualities such as influence,
attentiveness, communication, adaptability, dissemination of information, and social adeptness.</p>
      <p>Social network analysis proves to be a valuable tool in addressing challenges such as money
laundering, identity theft, network fraud, cyberattacks, and similar issues. Numerous researchers
have dedicated their efforts to investigating the dynamics of social networks [12-13]. The works
[14-15] is dedicated to exploring methods for detecting and combating malicious accounts and
spammers within online social networks. The paper [16] explores countering misinformation
campaigns on social media using social network analysis, addressing challenges in identifying
and attributing campaigns, tracing information flows, and understanding spheres of influence,
ultimately proposing tactical approaches for mitigation.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Models and algorithm for source analysis and ranking of countermeasures</title>
      <p>Based on the conducted research, a set of functional and non-functional properties of
countermeasures against malicious information in social networks and requirements for
countermeasures methodology are identified.</p>
      <p>The following properties of countering malicious information in a social network are
highlighted:</p>
      <p>where 
address.</p>
      <p>• Responsiveness - the time it takes to counter malicious information on social media;
• validity - a set of considered parameters for the selected objects of influence and
countermeasures in the process of counteraction;
• resource consumption - the probability that the amount of resources used will not exceed
an acceptable value.</p>
      <p>The input and output parameters for the study were determined.</p>
      <p>Given:</p>
      <p>
        DATASET ⊆ {messages,sources}, (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where  – is the set of messages containing malicious information,  – is the
set of sources of these messages.
      </p>
      <p>
        MESSAGE = &lt; messageUR L,source, activit y,messageType&gt;, (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
where  is the address of the post on the social network,  is the source of
the post,  is the post type (post, comment, or reply to a comment), and  is
the characteristics of the post.
      </p>
      <p>
        SOURCE = &lt; sourceID, sourceURL &gt;, (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
is the source's unique identifier,  is the source's social media
      </p>
      <p>
        ACTIVITY =&lt; countLike, countRepos,tcountView, countComment&gt;, (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
where  is the number of "like" marks,  is the number of "reposts"
(copies with a link to the source),  is the number of views, and  is the
number of comments.
      </p>
      <p>Required Finding:</p>
      <p>
        DATASET_MAX ⊆ {messages_max, sources_max}, (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
where  _ is the set of messages ( ) that will have the highest 
characteristics compared to other messages in the set  , and  _ is the set of
sources ( ) that are associated with the maximum number of messages ( ) in the
set  _ .
      </p>
      <p>The objective of the study is to develop:
1. malicious information models based on the social network model and source.;
2. a set of algorithms for analyzing sources of malicious information in social networks
and ranking countermeasures.
3. techniques for countering malicious information on social media;
4. architecture and software prototypes of the components of a system for countering
malicious information in social networks.</p>
      <p>The aim of the research is to improve the effectiveness of countering malicious information in
social networks. In this paper, the effectiveness indicator is defined through the indicator of
validity, as well as considering the requirements for efficiency and resource consumption.</p>
      <p>Based on the models of social network and malicious information source, a
theoreticalmultiple model of malicious information in a social network is developed, which includes such
basic elements as:
• information object  (from English information object),
•  information threat attribute (from the English threat),
•  malicious information object,
• An information threat attribute contained in a malicious information object 
(token),
• discrete feature of an information object  (from English feature)
• connections between objects.</p>
      <p>
        The set-theoretic model is formally represented as follows:
 = { };  = { };   = { }, (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
      </p>
      <p>⊂  ; ∀  ∈  :  ∈  ,
  ⊆  ; ∀  ∈   ∶  ∈  ,</p>
      <p>= { },
 ℎ
( ,  ) = {
; 
},
 ∈ 
where 
 ⇔ ∃</p>
      <p>,
– is a set of information objects,  1 – is a single information object,  – is a set of all
possible attributes of an information threat,   – is a single attribute, 
– is a set of malicious
information (a set of malicious information objects), 
 – is a separate class of malicious
information, 


– a set of attributes characterizing 
.</p>
      <p>To form a set of attributes of malicious information, consider an information and attribute
model that includes the following elements:
1. information threat - specified by the countermeasure system operator;
2. malicious information in the social network - specified by the countermeasure system
operator by forming a set of keywords;
3. information features forming the set of all possible features.</p>
      <p>The developed set of models of social network, source and malicious information contains new
classes and attributes of objects, new relations between them, and also allows to form
requirements to algorithms for analyzing and evaluating sources and choosing countermeasures.</p>
      <p>The
set
of
algorithms for
analyzing
malicious information
sources
and ranking
countermeasures (Fig. 1) consists of:
1. an algorithm for ranking sources by potential,
2. of the source estimation algorithm,
3. an algorithm for sorting the objects of influence,
4. a ranking algorithm for countermeasures.</p>
      <p>The formal notation of the complex of source analysis and countermeasure ranking is as
follows:</p>
      <p>
        Z = SC → max,
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
 1( ) →    = {0,1,2},
 2( ) →    [0,1,2], (  =
max  +1
      </p>
      <p>
        ),
 ( ) → 
(  ) =
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
   ∙ ∑ =1
| |
  ∙ (∑| = 1
|
(   , , ∙    , , ))
100 ∙ | |
,  ( ) → (0; 1]
where:  - source,  - countermeasure,  1( ) - source potential index (   ) is equal to 0, 1, 2
depending on the number of messages in the analyzed dataset belonging to the source. It is
calculated using the "source potential ranking algorithm".  2( )- source influence index (   ),
whose value is between 0 and 2. The calculation of the inferentiality index follows the "source
evaluation algorithm".  3( ) is the priority of the source (
  ) as an influence object in the
analyzed dataset. The "impact object sorting algorithm" is applied to obtain the value.  ( )
ranked countermeasures based on their complexity. The ranking is done according to the
countermeasure ranking algorithm.
      </p>
      <p>At the output of the set of algorithms, lists of target-countermeasure pairs are generated, with
the following rules for selecting objects of influence as targets (
):
{
{
where</p>
      <p>is the set of objects of influence.</p>
      <p>The developed set of algorithms for analyzing sources of malicious information and ranking
countermeasures differs from existing analogues by taking into account such attributes as source
potential, user activity on the source page, and the number of views of messages with malicious
information. The algorithm for ranking countermeasures differs from analogs by taking into
account coefficients and complexity levels for each countermeasure. At the same time, the
developed set of algorithms allows to form the requirements to the methodology of counteraction
to malicious information and is the basis for the counteraction system.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Methodology for countering malicious information in social networks</title>
      <p>
        Let's consider the methodology of countering malicious information in a social network. The
methodology for countering malicious information in a social network consists of two stages: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
the customization stage and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) the exploitation stage. The operation stage of the technique
consists of 3 steps and is presented in Figure 2.
      </p>
      <p>At the same time, the customization stage of the technique consists of two steps:
Step 1. "Query system customization", in which the operator defines information threats and
their attributes, and the countermeasure system generates and stores lists of threats and their
attributes.</p>
      <p>Step 2. "Countermeasure ranking", in which the operator selects available implementation
agents, and the system generates and saves lists of available implementation agents.</p>
      <p>Next, the operator selects the available countermeasures, the system generates a list of
countermeasures and selects the complexity coefficients of countermeasures based on expert
judgment, then the system generates and saves the list of ranked countermeasures.</p>
      <p>The outputs of the methodology are:
1. possible information threats, attributes, countermeasures and their coefficients,
available agents of countermeasure realization;
2. different parameters of impact objects, according to which the operator distributes his
attention and the order of decision making on countermeasures;
3. formed target-countermeasure pairs to counter malicious information in social
networks through available realization agents.</p>
      <p>The developed methodology differs from the known ones by using the author's algorithms for
analyzing sources and ranking countermeasures, which increases the validity of decision making
2. Ranking and sorting of impact targets
3.Counteracting a malicious operation</p>
      <p>Actions of the
countermeasures</p>
      <p>system
1. Data Collection Request</p>
      <p>Requesting</p>
      <p>and
receiving
information
Generating the
initial data set
Ranking of sources
by potential
Evaluation of</p>
      <p>sources
Sorting of impact</p>
      <p>objects
Formation of lists of
impact objects with</p>
      <p>parameters
Pair formation:
targetcountermeasure</p>
      <p>Starting a
Countermeasures
Displaying results
and saving data
Generating a
report
End</p>
      <p>Components of
countermeasures</p>
      <p>system
Loading data from
social networks</p>
      <p>Messages
Sources</p>
      <p>Options
Component of
visualization
Shared data storage
Analysis and sorting
of impact objects
Source options
Parameters of
impact objects
Shared data storage</p>
      <p>Component of
visualization</p>
      <p>Component of
Countermeasures</p>
      <p>Databases of</p>
      <p>ranked
countermeasures</p>
      <p>Databases of
implementation</p>
      <p>agent
Shared data storage</p>
      <p>Component of
visualization
Component of
implementation
about countering the target and choosing a countermeasure and reduces the operator's work
time in the process of countering malicious information in the social network.</p>
      <p>Actions of
operator</p>
      <p>Begin</p>
      <p>Selection of an
information threat and
its information
characteristics
Starting a
request to</p>
      <p>collect
information
Adjustment of lists
of impact objects
Pair adjustment:
targetcountermeasure</p>
      <p>Starting a
Countermeasures
External
systems</p>
      <p>Collection and
semantic analysis</p>
      <p>system
Implementation
agents
Social
network</p>
    </sec>
    <sec id="sec-5">
      <title>5. Architecture of a system for countering malicious information in social networks</title>
      <p>The architecture and software prototypes of the components of the anti-malware system are
presented in Figure 3.</p>
      <p>The architecture includes three levels:
1. management level (management component (flow and request management),
visualization component (reporting));
2. content evaluation level (source analysis and evaluation component, SQL server and
database);
3. the level of countermeasure implementation (countermeasure selection component
and countermeasure implementation component).</p>
      <p>Elements of the architecture are implemented as software prototypes:
1. a software prototype of a social network source analysis and evaluation component
that includes a source ranking algorithm, a source evaluation algorithm, and an impact
object sorting algorithm;
2. a software prototype of a countermeasure selection component that includes a
countermeasure ranking algorithm, an expert judgment algorithm for generating
coefficients;
3. a software prototype of the Information Threat and Countermeasure Database
(DBITandC), which contains information on countermeasures against malicious
information in the social network, the types of information objects to which
countermeasures may be applicable, and the implementation agents through which
countermeasures may be implemented.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Experiment</title>
      <p>The experimental evaluation was carried out in several stages. First, the developed software
prototypes and components were evaluated, then the operator's work time when countering
malicious information without using a technique, and the operator's work time using a technique,
were experimentally assessed. Resource consumption was assessed based on the data obtained
in the two previous stages.</p>
      <p>For experimental evaluation, data from the social network were collected, time measurements
of the complex algorithms of source analysis and countermeasure ranking were made, CPU and
RAM load indicators were obtained.</p>
      <p>The information threat was chosen the dataset that contained to one of 19 categories: Adult
English, Beer, Casino, Cigarette, Cigars, Cults, Dating, Religious, Marijuana, Occults, Prescription
drugs, Racist groups, Religion, Spirits, Sport betting, Violence, Wine, Weapon, Other.</p>
      <p>15,132 messages were collected from social networks, including posts, comments, and replies
to comments. For each message, information was collected on the number of likes, comments,
reposts, views, and information with the name of the source was obtained (Fig. 5). The data was
obtained in csv format and converted into an excel workbook.</p>
      <p>Next, the large data set was divided into 10 small sets of 1000 messages each. Each small set
was analyzed and ranked using a software prototype component for analysis and evaluation of
sources in social networks, the following results and characteristics were obtained (Table 1,
Table 2).</p>
      <p>Table 1
Results of analysis and sorting of impact objects</p>
      <p>Data set</p>
      <p>Target1 (Source)</p>
      <p>In the Target1 column, Source is recommended as the object of influence and shows the
number of sources with high priority for counteraction, which own 334 messages out of 1000 for
1 data set, 360 messages out of 1000 for the second, etc. The Target2 column shows the number
of messages that have medium priority and require additional evaluation by the operator. 118
Column Target3 recommends MessageURL as the target and shows the number of such low
priority messages for each set. Thus, the sequence of the operator’s work according to the results
obtained is as follows (for the 1st data set): 1) the operator needs to agree on 11 objects of
influence (sources) with high priority to counter them; 2) the operator needs to analyze 96
objects of influence, taking into account all characteristics (number of comments, likes, views,
reposts, activity index, viewability index, potential, influence index); 3) check 570 targets last,</p>
      <p>As a result of the experiment, countermeasures were ranked taking into account the
coefficients and levels of complexity for each countermeasure.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Results of experimental and theoretical evaluation of the methodology</title>
      <p>For experimental evaluation, data from the social network were collected, time measurements of
the complex algorithms of source analysis and countermeasure ranking were made, CPU and RAM
load indicators were obtained. Further, research and experiments were conducted to form the
initial data, it was found out that the most costly process in terms of operability is the operator
work time at the stage of setting up the methodology at the 1st, 4th step at the stage of operation
of the methodology. To evaluate the indicator of operator's work time to make a decision on
counteraction with and without the methodology, experiments were conducted, in which 10
experts participated. According to the results of the experimental evaluation of operability, the
probability of performing the technique in a given time was calculated, which is  operability(  ≤</p>
      <p>) = 0,9942, which meets the requirements ( oapcecreapbtialbitlye = 0.99) for responsiveness.</p>
      <p>Resource consumption was assessed using a number of specific indicators typical for step 2 of
the operation phase of the social network anti-malware technique. CPU load, RAM utilization, and
operator work time were considered. It is shown that the resource utilization estimate meets the
requirements  res( ≤  acceptable) ≥  raecsceptable, where  res is the probability that the resources
 , spent on countering malicious information according to the methodology do not exceed the
acceptable value  acceptable = 75%,  raecsceptableis the acceptable probability value.</p>
      <p>As part of the theoretical evaluation, the validity indicators for the developed methodology
were compared with analogs, such as the solutions of Zerofox, ESET, Ithreat Cyber Group Inc. and
others. It is shown that the developed methodology considers a larger number of parameters for
the selected objects of influence and countermeasures in the course of countering malicious
information in the social network, while meeting the requirements for other properties.
Compared to analogs, the number of parameters taken into account when using the technique is

, where</p>
      <p>– is the number of considered parameters
– is the maximum number of considered parameters for analogs.</p>
      <p>larger, such that  
for the technique,</p>
      <p>At that</p>
      <p>= 12, 
8. Discussions
&gt; 
= 8.
•
•
•
•
•
•
A comparative analysis of the developed methodology with known methods in terms of the
functionalities used, such as:</p>
      <p>A - possibility to form tasks of message collection and analysis for the monitoring system;
B - the ability to customize the available countermeasures in the system;
B- the ability to analyze the sources of messages in the resulting dataset;
D - possibility of ranking and sorting the objects of influence in the obtained dataset;
E - the ability to rank and sort the available countermeasures from the countermeasure
database for each dataset;</p>
      <p>G - the ability to select the target of influence for counteraction.</p>
      <p>The results are shown in Table 4 (the following designations and scores are used: "+"
presence of the parameter in the work (1 point); "+/-" - partial compliance with the parameter
(0.5 points); "-" - absence of the parameter (0 points).</p>
      <p>The analysis of the results of comparing the methodology for countering malicious
information in social networks with analogs allows us to draw the following conclusions. First,
none of the techniques, except for the proposed one, satisfies all functional requirements at the
same time. Second, all techniques allow ranking countermeasures to a greater or lesser extent.
Third, the parameters of messages, sources, countermeasures are considered only in the
Thus, the results obtained in the work allow us to assert the achievement of higher efficiency
of the developed methodology compared to the known ones, which proves the realization of the
final goal of the study - to increase the effectiveness of countermeasures against malicious
information by analyzing the sources of malicious information and automating the choice of
countermeasures.</p>
    </sec>
    <sec id="sec-8">
      <title>9. Conclusions</title>
      <p>The rise of the Internet poses a substantial risk to both personal and state data security.
Consequently, the detection and mitigation of unsuitable content circulating on the worldwide
web emerge as a matter of national significance.</p>
      <p>The proposed models, algorithms, methodology and architecture, as well as their practical
implementation together provide a solution to the actual scientific and technical problem of
improving the effectiveness of countering the spread of malicious information in social networks.
The results of the work constitute the following research outcomes:</p>
      <p>1. A set of models of social network, source and malicious information is proposed, which
differs from the existing analogs by the possibility of simultaneous consideration of the structure
of information exchange in the social network, sources and malicious information.</p>
      <p>2. A set of algorithms for analyzing malicious information sources and ranking
countermeasures has been developed, which, unlike existing algorithms, takes into account
connections and dependent attributes of objects in the social network, such as source potential,
user activity on the page, number of message views, etc. The algorithms for ranking
countermeasures take into account coefficients and complexity levels of each countermeasure.
Countermeasure ranking algorithms take into account coefficients and difficulty levels for each
countermeasure.</p>
      <p>3. A methodology of countermeasures against malicious information in a social network is
proposed, focused on automatic and automated selection of objects of influence and
countermeasures against malicious information from a list of ranked countermeasures.</p>
      <p>4. The architecture and program components of the system of countermeasures against
malicious information are developed, which differs from existing architectures in that it supports
ranking and selection of countermeasures available to the operator in the system for malicious
information specified by the operator. The architecture contains original components for
analyzing and evaluating the source of malicious information, a database with information on
countermeasures for malicious information in social networks.</p>
      <p>As recommendations for further development of the topic are to expand the class of algorithms
for analyzing the behavior of sources and authors of messages, algorithms for analyzing the
dissemination of information in a social network, integration of automatic and automated
countermeasures mechanisms into existing architectures and systems.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z. A.</given-names>
            <surname>Shanaa</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Naser</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Abualrish</surname>
            ,
            <given-names>E. A.</given-names>
          </string-name>
          <string-name>
            <surname>Zaitoun</surname>
            and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Yousef</surname>
          </string-name>
          .
          <article-title>"Effects of Social Networking Sites on the Academic Performance of Graduate Students,"</article-title>
          <source>Tenth International Conference on Social Networks Analysis, Management and Security (SNAMS)</source>
          ,
          <source>Abu Dhabi, United Arab Emirates</source>
          (
          <year>2023</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1109/SNAMS60348.
          <year>2023</year>
          .10375420
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kaba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eletter</surname>
          </string-name>
          and
          <string-name>
            <given-names>G. A. E.</given-names>
            <surname>Refae</surname>
          </string-name>
          ,
          <article-title>"Knowledge Sharing Through Academic Social Networking: The Impact of Personal and Social Outcome Expectations,"</article-title>
          <source>Tenth International Conference on Social Networks Analysis, Management and Security (SNAMS)</source>
          ,
          <source>Abu Dhabi, United 3Arab Emirates</source>
          (
          <year>2023</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . doi:
          <volume>10</volume>
          .1109/SNAMS60348.
          <year>2023</year>
          .10375418
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Mahat</surname>
          </string-name>
          .
          <article-title>"Detecting Cyberbullying Across Multiple Social Media Platforms Using Deep Learning,"</article-title>
          <source>International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE)</source>
          , Greater Noida,
          <string-name>
            <surname>India</surname>
          </string-name>
          (
          <year>2021</year>
          ):
          <fpage>299</fpage>
          -
          <lpage>301</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICACITE51222.
          <year>2021</year>
          .9404736
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Motschnig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramharter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Schweiger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zabka and K. -T. Foerster</surname>
          </string-name>
          .
          <article-title>"On Comparing and Enhancing Two Common Approaches to Network Community Detection,"</article-title>
          <source>2021 IEEE Global Communications Conference (GLOBECOM)</source>
          , Madrid, Spain(
          <year>2021</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1109/GLOBECOM46510.
          <year>2021</year>
          .9685248
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Afra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Özyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rokne</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Alhajj</surname>
          </string-name>
          . "
          <string-name>
            <surname>NetDriller-V3: A Powerful Social Network Analysis Tool</surname>
          </string-name>
          ,
          <article-title>"</article-title>
          <source>2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)</source>
          , Istanbul, Turkey(
          <year>2022</year>
          ):
          <fpage>570</fpage>
          -
          <lpage>574</lpage>
          . doi:
          <volume>10</volume>
          .1109/ASONAM55673.
          <year>2022</year>
          .10068570
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Oreški</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Pihir</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Višnjiű</surname>
          </string-name>
          .
          <article-title>"Comparative Analysis of Machine Learning Algorithms on Data Sets of Different Characteristics for Digital Transformation," 2023 46th MIPRO ICT and Electronics Convention (MIPRO), Opatija</article-title>
          , Croatia(
          <year>2023</year>
          ):
          <fpage>1428</fpage>
          -
          <lpage>1433</lpage>
          , doi: 10.23919/MIPRO57284.
          <year>2023</year>
          .10159910
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Xuan Huynh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Duong-Trung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. -H.</given-names>
            <surname>Pham</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Phan</surname>
          </string-name>
          .
          <article-title>"Distributed Framework for Automating Opinion Discretization From Text Corpora on Facebook,"</article-title>
          <source>in IEEE Access</source>
          , vol.
          <volume>7</volume>
          (
          <year>2019</year>
          ):
          <fpage>78675</fpage>
          -
          <lpage>78684</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2019</year>
          .2922427
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Popereshnyak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Suprun</surname>
          </string-name>
          ,
          <article-title>Tools and methods for intersubjective relationships in cyberspace forecasting</article-title>
          ,
          <source>Proceedings of the 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies</source>
          , CSIT '
          <year>2017</year>
          , Lviv, Ukraine,
          <year>2017</year>
          , pp.
          <fpage>244</fpage>
          -
          <lpage>247</lpage>
          . doi:
          <volume>10</volume>
          .1109/STC-CSIT.
          <year>2017</year>
          .
          <volume>8098779</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Popereshnyak</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Yurchuk</surname>
          </string-name>
          ,
          <article-title>Social networks: Analysis, algorithms and their implementation</article-title>
          ,
          <source>CEUR Workshop Proceedings</source>
          ,
          <volume>2870</volume>
          ,
          <year>2021</year>
          , pp.
          <fpage>811</fpage>
          -
          <lpage>821</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>You</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Miao</surname>
          </string-name>
          , Rumor,
          <article-title>Spreading with Cross Propagation in Multilayer Social Networks</article-title>
          ,
          <source>Proceedings of the Intl Conf on Parallel &amp; Distributed Processing with Applications</source>
          ,
          <source>Big Data &amp; Cloud Computing, Sustainable Computing &amp; Communications, Social Computing &amp; Networking</source>
          , ISPA/BDCloud/SocialCom/SustainCom '2019, Xiamen, China,
          <year>2019</year>
          , pp.
          <fpage>1641</fpage>
          -
          <lpage>1645</lpage>
          . doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>ISPA-BDCloud-SustainComSocialCom48970</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <volume>00242</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Garg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gandhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Panigrahi</surname>
          </string-name>
          ,
          <article-title>Social Network measures association with social and intelligent behaviors in Dolphin network</article-title>
          ,
          <source>Proceedings of the 11th International Conference on Cloud Computing, Data Science &amp; Engineering</source>
          , Confluence '
          <year>2021</year>
          , Noida, India,
          <year>2021</year>
          , pp.
          <fpage>655</fpage>
          -
          <lpage>659</lpage>
          . doi:
          <volume>10</volume>
          .1109/Confluence51648.
          <year>2021</year>
          .
          <volume>9377088</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Strengthening Social Networks Analysis by Networks Fusion</article-title>
          ,
          <source>Proceedings of the ACM International Conference on Advances in Social Networks Analysis and Mining</source>
          , ASONAM '
          <year>2019</year>
          , Vancouver, BC, Canada,
          <year>2019</year>
          , pp.
          <fpage>460</fpage>
          -
          <lpage>463</lpage>
          . doi:
          <volume>10</volume>
          .1145/3341161.3342939.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Bitaghsir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kashipazha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dadlani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khonsari</surname>
          </string-name>
          ,
          <article-title>Social-aware Mobile Road Side Unit for Content Distribution in Vehicular Social Networks</article-title>
          ,
          <source>in: Proceedings of the 2019 IEEE Symposium on Computers and Communications</source>
          , ISCC '
          <year>2019</year>
          , Barcelona, Spain,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          , doi: 10.1109/ISCC47284.
          <year>2019</year>
          .
          <volume>8969669</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>