<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Semantic Models at Task Monitoring Public Opinions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aleksandr Dodonov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dmitry Lande</string-name>
          <email>dwlande@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Boris Berezin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Information Recording of National Academy of Sciences of Ukraine</institution>
          ,
          <addr-line>Kyiv, Ukraine dodonov.ipri.kiev.ua</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper proposes a method for constructing and usage of the semantic models (SM) for the purpose of continuous monitoring of public opinion, opinion mining (OM) for finding actual subtopics in the Internet message flow. We define semantic model within this work, as the subject domain model, which has the form of a directed graph, vertices of which correspond to concepts of the domain, and edges define relations between them. Semantic models make it possible to use the results of linguistic statistical analysis of texts (Text Mining) and the use of Information Extraction methods for texts from the Internet for opinion mining. While existing public opinion analysis projects are more focused on one-time (static) public opinion analysis on objects and phenomena, this paper proposes a method for automated construction and use of SM based on continuous monitoring of public opinion on the Internet. OM procedure consists of three steps: construction and clustering of the SM; selection of documents and sentiment definition of subtopics; visualization of results. SM construction using compactified horizontal visibility graph algorithm, usage of cluster analysis methods for determining relevant subtopics, estimation of proportion and tonality for individual subtopic in overall topical information flow are shown. As examples, the models of subject areas corresponding to: “One Belt, One Road”, “Nord Stream”, “Genetically Modified Organisms” topics are considered. Obtained results confirm that proposed method can be used for opinion monitoring in in various subject areas.</p>
      </abstract>
      <kwd-group>
        <kwd>Subject Domain Model</kwd>
        <kwd>Semantic Model</kwd>
        <kwd>Cluster Analysis</kwd>
        <kwd>Sentiment Analysis</kwd>
        <kwd>Content-Monitoring</kwd>
        <kwd>Opinion Monitoring</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Formulation of the problem</title>
      <p>We define semantic model, as the subject domain model, which has the form of a
directed graph, vertices of which correspond to concepts of the domain, and edges
define the relations between them. Concepts can be events, processes, i.e. such a
semantic model can be interpreted as a semantic domain map.</p>
      <p>Information that is created by Internet users reflects public opinion on various
issues and can be collected, analyzed by content monitoring systems and taken into
account when planning the activities of companies, organizations, etc. Semantic
models make it possible to use the results of linguistic statistical analysis of texts (Text
Mining) and the use of Information Extraction methods contained in texts from the
Internet for opinion mining. While the existing public opinion analysis projects are
more focused on one-time (static) public opinion research on objects and phenomena,
this paper proposes a method for automated construction and use of SM based on
continuous monitoring of public opinion on the Internet.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Analysis of publications</title>
      <p>As part of this work, authors propose a public opinion analysis based on natural
language processing methods. This analysis is aimed at determining the attitude of the
subject of monitoring public opinion to the chosen topic. One of the main objectives
of the analysis of public opinion is classification of emotional coloring of the text
(positive, negative or neutral).</p>
      <p>
        Current works devoted to the analysis, extraction of opinions, moods (Sentiment
Analysis - SA, Opinion Mining - OM) note that this is a computer study of opinions,
people's attitudes to an object, a concept that can represent individuals, events or
topics [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ] . In these works, levels of analysis of opinions are highlighted: the level of
the document, the level of the proposal and the aspect level, when an opinion on a
certain concept is considered. For example, in product reviews, product itself is
usually the concept, and everything related to this product (price, quality, etc.) are aspects
of this product. Analysis is often associated with the search not only for general
opinions about the concept, but also for finding opinions about aspects. Some approaches
use a fixed, predefined list of aspects, while others extract aspects from the analyzed
text.
      </p>
      <p>
        The work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] analyzes the difference between the public opinion on genetically
modified organisms, presented in the Internet resources, and the opinion of experts in
scientific publications. For this purpose, the content of websites from Google search
results, the headlines of articles from Google News found by thematic query, etc.
were considered. For these resources, three semantic networks were built on the basis
of word adjacency analysis; words with a repetition rate above the mean were used as
concepts. As a result, central words in each network were identified, common words
were found in different networks, the tonality of individual network fragments was
estimated.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], an analysis of public opinion consisted in identifying a thematic structure in
an array of comments when discussing a film on the Youtube channel. At the same
time, the results of semantic analysis and thematic modelling are compared. About
three thousand comments were collected on the Youtube service server for analysis.
In constructing the SM, bigrams were used as vertices. The thematic structure of the
discussion was revealed using clustering of the main component of the constructed
semantic network. It is concluded that semantic analysis can complement thematic
modelling or serve as an alternative.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], public opinion on the US presidential election in 2012 is analyzed on the
basis of news articles published on the Internet. With the help of the monitoring system,
more than 81,000 English-language articles from 400 news agencies were collected.
On the basis of these resources, the “subject-verb-object” triplets were allocated and
with the help of them two semantic graphs were constructed, reflecting the main
actors, their election camps, etc. The results of the analysis of the election campaign
were obtained by studying the characteristics of semantic graphs.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Method for constructing and using semantic models</title>
      <p>In this paper, we propose method for constructing and using SM for OM tasks on the
Internet, which involves three stages [6]:
- construction and clustering of SM;
- selection of documents and determining the tonality of subtopics;
- visualization of results.</p>
      <p>
        At the first stage:
- selection of an array of documents for the construction of CM;
- finding concepts; definition of SM connections by constructing a compactified
graph of horizontal visibility [
        <xref ref-type="bibr" rid="ref6">7</xref>
        ];
- graph clustering;
- formation of requests corresponding to clusters (based on the clusters found,
experts identify subtopics and formulate requests for the selection of relevant
documents).
      </p>
      <p>At the second stage is made:</p>
      <p>- selection of documents corresponding to subtopics (subthemes) from the general
information flow using queries;
- determine their share in the total flow of documents;
- the tonality of the documents of the relevant subtopics is determined.
At the third stage of the subtopics with the tonality:
- visualized on the map;
- states are recorded in the database (DB) of the monitoring system for subsequent
receipt of the dynamics of the results change over time.</p>
      <p>Below are considered the main operations performed as part of these three stages.
3.1</p>
      <sec id="sec-3-1">
        <title>Stage of construction and clustering SM</title>
        <p>Selection of an array of documents to build a semantic model. On the basis of a given
monitoring object and topic, a request is formulated for sampling an array of
documents.</p>
        <p>Finding concepts. Documents included in the array are pre-processed, service
information is removed, as well as stop words that do not carry a semantic load. Stemming
can be performed (coercion of words to the base). Then, on the basis of taking into
account the frequency of words in an array of documents, or using other well-known
metrics, for example TFIDF, the most important, having the greatest weight of
concepts are selected from the words of the array of documents [8].</p>
        <p>
          Definition of SM links by constructing a graph of horizontal visibility. The
algorithm of compactified horizontal visibility graph (CHVG) [
          <xref ref-type="bibr" rid="ref6">7</xref>
          ] is used to determine the
relationships between the concepts and build the semantic model [
          <xref ref-type="bibr" rid="ref6">7</xref>
          ], which. provides
three steps:
        </p>
        <p>1. On the horizontal axis, a number of nodes are marked, each of which
corresponds to words in the order of appearance in the text, and weight numerical
evaluations are laid on the vertical axis (visually, a set of vertical lines).</p>
        <p>2. Build a traditional graph of horizontal visibility. At the same time, there is a
connection between the nodes, if they are in “line of sight”, i.e. if they can be
connected by a horizontal line that does not cross any other vertical line.</p>
        <p>3. The network obtained in the previous step is compactified. All nodes with this
word are combined into one node. All connections of such nodes are also combined.</p>
        <p>The peculiarity of using the CHVG algorithm in this work is that its first two steps
are performed separately for each sentence of the analyzed text. After that, the
resulting network is compactified. In the process of developing the proposed method, a
study was carried out on the construction of a SM for documents collected on the
following topics: One Belt, One Road (OBOR is the initiative of the PRC on the New
Silk Road); Nord Stream; GMO et al. (For more detailed analysis of topics and
documents, see the results section). A fragment of the graph of the semantic model built
for 28 concepts of the OBOR topic using the described algorithm is shown in Fig. 1.</p>
        <p>
          Clustering graph SM. Given the relevance of the aspect level of the analysis of
opinions, after building a semantic model, its network structure is analyzed using graph
clustering algorithms— community detection (clustering graph, community
detection). In [
          <xref ref-type="bibr" rid="ref7">9</xref>
          ], a community is defined as a tightly connected group of nodes that is
weakly connected with the rest of the network. Identifying online communities is a
complex problem due to the existence of multiple definitions of communities and the
complexity of community detection algorithms. In [
          <xref ref-type="bibr" rid="ref7">9</xref>
          ], more than a dozen clustering
algorithms were considered to identify communities of both disjoint and overlapping
(and communities of both types). For the clustering of SM graphs, this paper
considered the use of various known algorithms. The best, most meaningful results were
obtained using the Louvain, Leading Eigenvector, and Walktrap algorithms.
        </p>
        <p>
          Among the well-known community search algorithms in the graph, we can
distinguish the Louvain algorithm [
          <xref ref-type="bibr" rid="ref8 ref9">10,11</xref>
          ], according to which at the beginning of the
algorithm each vertex forms a separate community. The step of the algorithm consists of
two phases. At the first phase, for each vertex, an attempt is made to find a
community, moving to which will give the maximum overall positive change in modularity.
You can move a vertex only along adjacent edges, that is, only into those
communities that belong to the vertices adjacent to this one. Viewing all vertices continues as
long as at least one vertex movement occurs. In the second phase, the graph is
compressed: the vertices belonging to the same community form a new super vertex with
the corresponding edge transformation. The algorithm stops when the graph stops
changing.
        </p>
        <p>
          The Leading Eigenvector [
          <xref ref-type="bibr" rid="ref10">12,13</xref>
          ] algorithm uses the provisions of spectral graph
theory. The algorithm is based on maximizing modularity by dividing the graph into
two groups of vertices, using the spectrum of the graph. The algorithm proposed in
the paper [
          <xref ref-type="bibr" rid="ref9">11</xref>
          ] consists in finding the eigenvector corresponding to the first
component of the spectrum of the modularity matrix. The partition is determined by the
estimate of the leading eigenvector of the modularity matrix.
        </p>
        <p>
          Walktrap clustering algorithm [
          <xref ref-type="bibr" rid="ref11">14</xref>
          ], which allows to find densely connected
subgraphs (communities in the graph) on the basis of random walks. The principle of the
algorithm is that short random walks, as a rule, remain in the same community. It is
argued that transitions from one cluster to another should occur quite rarely. Based on
this property, a metric is introduced for the similarity of the vertices.
        </p>
        <p>Fragment of the results of clustering of SM graphs constructed for documents
collected on the OBOR topic using the considered algorithms are shown in Table 1.</p>
        <p>The first line of Table 1 shows the names of three algorithms that were used to
cluster the SM. Columns 1–2 show the results of applying clustering algorithms to the
SM based on the concepts selected by frequency of use in the documents, and
columns 3–4 show the results of clustering SM based on the concepts selected using the
TFIDF indicator. The columns of the fragment of the cluster table show the
interrelated sets of concepts of the analyzed topic, which were found using three clustering
algorithms.</p>
        <p>Formation of queries corresponding to clusters. As a result of the clustering of the
semantic model graph, the sets of the most connected graph vertices were found,
corresponding to the identified clusters, i.e. sets of similar concepts. On the basis of these
concepts in the general stream of documents characterizing the analyzed subject area,
subtopics, aspects are highlighted. Experts in this subject area give names to these
subtopics and formulate requests for subsequent selection using the information
retrieval system of documents corresponding to subtopics from the general flow of
documents characterizing the general subject area.</p>
        <p>For the OBOR topic under discussion, on the basis of the clusters found, the
experts formulated four subtopics and the corresponding queries, given in Table 2.</p>
        <p>Louvain</p>
        <p>Walktrap
economy
military world
countries country
state global
war trade projects
economic
cooperation security
political infrastructure
investment
development international
support national</p>
        <p>chinese
people
market
ness million
including
billion summit
ers</p>
        <p>president
government
xi
busi</p>
        <p>debt
beijing</p>
        <p>leadindia china
south asia power
region pakistan
relations influence us
strategic east
europe russia american
trump japan africa
part sea</p>
        <p>prime minister
foreign policy
china's
initiative
silk
road</p>
        <p>belt
project</p>
        <p>prime
minister
foreign
road belt
initiativ
silk</p>
        <p>Louvain
(TFIDF)
india military
power pakistan
country us
strategic might
russia american
political iran
russian defense
syria turkey</p>
        <p>sri
president
people
ment
xi
trump
investment
cpec
port
chinese
governprojects</p>
        <p>debt
project
billion
bri
south
region relations
indian xinjiang
economic
cooperation africa
development
beijing
summit pacific
taiwan</p>
        <p>prime minister
foreign japanese
abe mahathir
malaysia
china's
obor
research
global
market</p>
        <p>Leading eigenvector</p>
        <p>(TFIDF)</p>
        <p>Subtopic name</p>
        <p>President of the People's Republic of China
Xi Jinping about investment projects as part of
the Belt and Road Initiative (BRI)</p>
        <p>The attitude of India, Pakistan, the United
States and other countries to the initiative BRI</p>
        <p>The attitude of countries to the
development of the southern region in the framework
of the initiative BRI
Prime Minister of Japan Shinzō Abe about the
initiative BRI</p>
        <p>At this, periodically repeated training monitoring system (repetition period from
several hours to a day), implemented using the SM construction and clustering
algorithms, ends.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>The stage of selection of documents and determining the tonality</title>
        <p>Selection of subtopics documents from the general information flow using queries.
From the general flow of documents generated by the search query, which
characterizes the subject area, the documents of subtopics are selected using search queries,
formulated by experts on the basis of clusters identified in the semantic model. For
selected documents, each of the subtopics is determined by their share in the total
flow of documents.</p>
        <p>
          For the flow of documents generated by the search query to the content monitoring
system InfoStream (one-road) &amp; (one-belt) &amp; china, which characterizes the OBOR
topic, the names of the subtopics and the corresponding requests are given in Table 2.
The shares of the subtopic documents selected using the formulated requests from the
total flow, are shown in Table 3.
Determining the tonality of the subtopic documents. For the documents of each of
the identified subtopics, the tonality is determined - positive, negative, neutral based
on the analysis of the words that make up the documents relating to the topics. To
determine the tonality, the algorithms proposed in [
          <xref ref-type="bibr" rid="ref12">15</xref>
          ] can be used. Under the tonality
of the text in this case is meant a positive, negative or neutral emotional coloring of
the entire text document as well as its individual parts related to certain concepts, such
as persons, organizations, brands, etc. The task of determining the tonality is checked
at least three indicators of emotional coloring: positive, negative, neutral and, often,
there is also a need to check the combination of these hypotheses (for example, to
identify the level of “expressiveness” of the text). The tonality of the subtopic
documents selected from the general document flow of the OBOR topic is given in Table
3.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Stage visualization of the results</title>
        <p>At this stage, the visualization of the found subtopics with tonality on the map is
performed. Monitoring results are visualized in real time on a geographic map with
reference to specific objects. For each subtopic identified in the general flow of
documents, a chart is displayed indicating the name of the subtopic and the proportion of
documents in the total flow attributable to this subtopic, as well as the proportion of
documents in positive, negative and neutral tonality within the subtopics (table 3,
figure 2).</p>
        <p>Fig. 2.Visualization of monitoring results on a geographic map. For each of the subtopics
found, the map shows the proportion of its documents in the total input stream and the tonality
of documents.</p>
        <p>The geographic map shows: the subtopics identified in the flow of input
documents; share of documents on each subtopic; the tonality of the documents on the
subtopics, as well as the dynamics of changes in results over time. The conditions
found during the monitoring are recorded in the monitoring database for later
obtaining the dynamics of the results change over time. The change in share of documents
and tonality of the formulated subtopics (subthemes) of the main OBOR topic by
week is shown in Fig. 3, Fig. 4 andFig. 5.</p>
        <p>1
3
5
7
9
11
13
15</p>
        <p>17</p>
        <p>WEEKS</p>
        <p>The operations performed in the three stages of the considered method are
implemented using the tools of the Gephi software package (http://gephi.org), as well as
using software tools developed in the programming language for statistical
calculations R. The results obtained using the proposed method summarized in the next
section.</p>
        <p>9 11
WEEKS
13
15
17
0
- GMO - genetically modified organisms and some other topics.</p>
        <p>To monitor public opinion onOBOR topic, an array of 1000 English-language
documents (from 30.11.2018 to 07.25.2018) collected using the (one-road) &amp;
(onebelt) &amp; china query using the InfoStream system was analyzed.</p>
        <p>At the first stage, after sampling an array of documents and its preliminary
processing, finding concepts (based on the frequency of use of terms, as well as on the
basis of the TFIDF indicator), the corresponding SMs were built (Fig. 1). Clusters of
concepts obtained using the Louvain, Leading Eigenvector and Walktrap algorithms
based on the constructed SM are shown above in Table 1.</p>
        <p>Based on the comparison of the clusters obtained, experts in this subject area can
classify document subtopics, as well as requests for a selection of documents relating
to the subtopics, determining their share and tonality (Table 2).</p>
        <p>At the second stage, the share of documents of the subtopics selected using the
formulated requests from the general flow is given in Table 3. Also, the tonality of the
documents of the formulated subtopics selected from the general flow of documents
of the OBOR topic are given there.</p>
        <p>At the third stage, the visualization of the results is performed. A general view of
the interface for visualizing the found subtopics, their shares in the general flow and
tonalities is shown in Fig. 2. The dynamics of changes in the share of documents and
the tonality of the formulated subtopics by the composition of the OBOR topic
documents by week are shown in Fig. 3-5. Fig. 3 shows the change in the proportion of
documents in the formulated subtopics (Subtopic 1 - Subtopic 4, four lower graphs) in
the composition of the documents of the OBOR topic (Topic, upper graph) by week.
Fig. 4 shows graphs of changes in the number of documents with a positive, negative
and neutral tonality in the subtopic of the “South Region Development” by week. Fig.
5 shows plots of changes in the number of documents with a positive, negative and
neutral tonality in the “India Pakistan US” subtopic by week.</p>
        <p>In addition to the OBOR topic, the use of the proposed method of public opinion
monitoring on the topics of Nord Stream, GMO and others was considered. For
example, for the Nord Stream topic, on the basis of 1000 English-language documents
(collected from 02/11/2018 through 08/18/2018) a corresponding SM was built,
clusters were found and subtopics were formulated: merkel putin meeting (about
Chancellor of Germanyt Merkel and Putin meeting); gas transit ukraine (on gas transportation
through Ukraine); european security energy market (on the security of the European
energy market), poland united states (on the relationship of Poland and the United
States to the Nord Stream project).
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>A method for constructing and using SM for public opinion monitoring has been
proposed, which includes three stages: the construction and clustering of SM; selection of
documents and the definition of the tonality of subtopics; visualization of results.</p>
      <p>Construction of the SM using the compactified horizontal visibility graph
algorithm, use of cluster analysis methods for determining relevant subtopics, estimating
the proportion and tonality of individual subtopics within the general topical
information flow are shown.</p>
      <p>Obtained results confirm the possibility of using the proposed method of
monitoring public opinion in various subject areas.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Schouten</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frasincar</surname>
            <given-names>F.</given-names>
          </string-name>
          <article-title>Survey on aspect-level sentiment analysis //</article-title>
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <year>2016</year>
          . - Iss.
          <volume>28</volume>
          (
          <issue>3</issue>
          ). - pp.
          <fpage>813</fpage>
          -
          <lpage>830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Medhat</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hassan</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Korashy</surname>
            <given-names>H</given-names>
          </string-name>
          .
          <article-title>Sentiment analysis algorithms</article-title>
          and applications: A survey // Ain Shams Engineering Journal,
          <year>2014</year>
          . - Iss.
          <volume>5</volume>
          (
          <issue>4</issue>
          ). - pp.
          <fpage>1093</fpage>
          -
          <lpage>1113</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Jiang</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anderton</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ronald</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barnett</surname>
            <given-names>G</given-names>
          </string-name>
          .
          <article-title>Semantic Network Analysis Reveals Opposing Online Representations of the Search Term</article-title>
          “GMO” // Global Challenges,
          <year>2018</year>
          . - Iss.
          <volume>2</volume>
          (
          <issue>1</issue>
          ). - pp.
          <fpage>1700082</fpage>
          . DOI: https://doi.org/10.1002/gch2.
          <fpage>201700082</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Юдина</surname>
            <given-names>Д.И.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Дудина</surname>
            <given-names>В</given-names>
          </string-name>
          .И.
          <article-title>Семантическая сеть на биграммах как метод валидизации результатов тематического моделирования в социологическом исследовании // Жур- нал социологии и социальной антропологии</article-title>
          ,
          <year>2016</year>
          . - Iss.
          <volume>19</volume>
          (
          <issue>4</issue>
          ). - C.
          <fpage>71</fpage>
          -
          <lpage>83</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. SudhaharS.,
          <string-name>
            <surname>Veltri</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cristianini</surname>
            <given-names>N.</given-names>
          </string-name>
          <article-title>Automated analysis of the US presidential elections using Big Data and network analysis//Big Data</article-title>
          &amp; Society,
          <year>2015</year>
          . - Iss.
          <volume>2</volume>
          (
          <issue>1</issue>
          ). - pp.
          <source>P</source>
          .
          <volume>21</volume>
          -
          <fpage>49</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          7.
          <string-name>
            <surname>LandeD</surname>
          </string-name>
          .V.,
          <string-name>
            <surname>SnarskiiA</surname>
          </string-name>
          .A.,
          <string-name>
            <surname>YagunovaE</surname>
          </string-name>
          .V.,
          <string-name>
            <surname>PronozaE</surname>
          </string-name>
          .V.
          <article-title>The use of horizontal visibility graphs to identify the words that define the informational structure of a text // 12th</article-title>
          <source>Mexican International Conference on Artificial Intelligence (MICAI)</source>
          ,
          <year>2013</year>
          . - pp.
          <fpage>209</fpage>
          -
          <lpage>215</lpage>
          . DOI:
          <volume>10</volume>
          .1109/MICAI.
          <year>2013</year>
          .33
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          9.
          <string-name>
            <surname>Harenberg</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bello</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gjeltema</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranshous</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harlalka</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seay</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samatova</surname>
            <given-names>N.</given-names>
          </string-name>
          <article-title>Community detection in large-scale networks: a survey and</article-title>
          empirical evaluation // Wiley Interdisciplinary Reviews: Computational Statistics,
          <year>2014</year>
          . - Iss.
          <volume>6</volume>
          (
          <issue>6</issue>
          ). - pp.
          <fpage>426</fpage>
          -
          <lpage>439</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          10.
          <string-name>
            <surname>Blondel</surname>
            <given-names>V.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guillaume</surname>
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lambiotte</surname>
            <given-names>R.</given-names>
          </string-name>
          , Lefebvre E.
          <article-title>Fast unfolding of communities in large networks //</article-title>
          <source>Journal of Statistical Mechanics: Theory and Experiment</source>
          ,
          <year>2008</year>
          . -Iss.
          <fpage>10</fpage>
          . - pp.
          <fpage>P10008</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          11.
          <string-name>
            <surname>Louvain</surname>
          </string-name>
          , http://contest.dislab.org/algs, last accessed
          <year>2019</year>
          /02/06.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          12.
          <string-name>
            <surname>Newman M.E.</surname>
          </string-name>
          <article-title>Finding community structure in networks using the eigenvectors of matrices</article-title>
          . Physical review
          <string-name>
            <surname>E</surname>
          </string-name>
          ,
          <year>2006</year>
          . - Iss.
          <volume>74</volume>
          (
          <issue>3</issue>
          ). - pp.
          <fpage>036104</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          14.
          <string-name>
            <surname>Pons</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Latapy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Computing communities in large networks using random walks</article-title>
          .
          <source>In International symposium on computer and information sciences</source>
          ,
          <year>2005</year>
          , pp.
          <fpage>284</fpage>
          -
          <lpage>293</lpage>
          , Springer, Berlin, Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          15.
          <string-name>
            <surname>Lande D</surname>
          </string-name>
          .V.
          <article-title>Identification of information tonality based on Bayesian approach</article-title>
          and neural networks // E-preprint arXiv:
          <volume>0806</volume>
          .2738 (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>