<!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>Approaches to sentiment analysis of the social network text data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vadim Moshkin</string-name>
          <email>v.moshkin@ulstu.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ulyanovsk State Technical University Ulyanovsk</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <volume>11509</volume>
      <fpage>198</fpage>
      <lpage>202</lpage>
      <abstract>
        <p>-The article provides an overview of the most modern approaches to sentiment analysis of text data. The features of using machine learning approaches and dictionarybased methods are also described. In addition, the description of sentiment dictionaries and the most popular software for sentiment analysis of data are given. An original approach was also proposed for sentiment analysis of text data using the integration of machine learning methods with the Wodr2vec data vectorization algorithm. Also presented is the architecture of the developed system for Opinion Mining data of social networks. At the end of the article, experiments are presented to evaluate text reviews using the data from the IMDB portal as an example, confirming the proposed approach.</p>
      </abstract>
      <kwd-group>
        <kwd>sentiment analysis</kwd>
        <kwd>word2vec</kwd>
        <kwd>Opinion Mining</kwd>
        <kwd>machine learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I.INTRODUCTION</title>
      <p>
        Currently, the main source of information from where
you can get knowledge about certain interests of the client,
prepare for him and proactively offer a new product or
service, are the Internet and social networks [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This
problem is solved by the Opinion mining. Opinion mining
for data from social networks contains two tasks:

morphological analysis to identify entities that will be
evaluated;
 analysis of the sentiment of expressions related to this
entity.
      </p>
      <p>
        By sentiment analyzing of the users’ text messages the
researcher can draw conclusions about:
 emotional evaluation of users of various events and
objects;
 individual user preferences;
 some features of the users’ nature [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Sentiment analysis is a section of text mining, a system
for automatically extracting subjective opinions from text.
Sentiment analysis determines the content of the text as
much as its tonality.</p>
      <p>Automatic analysis of the tonality of the text is based on
the technologies of linguistic interpretation of emotions,
machine learning, extracting emotional meaning from
information, etc.</p>
      <p>The technology of sentiment analysis has become
especially relevant with the development of Web 2.0, as a
tool for monitoring the views of millions of Web users.</p>
      <p>However, text data in social networks have the following
features:
 use whole and incomplete sentences.
 the presence of speech and spelling errors.
 the use of smiles, emoji to give the message a certain
emotional coloring.</p>
      <p>In this article we will consider the use of various existing
algorithms for assessing the sentiment of social network texts
within the framework of the developed software system for
Opinion Mining. The article proposes an original approach
for analyzing the emotional coloring of text data using the
integration of machine learning methods with the Wodr2vec
algorithm.</p>
      <p>II.THE EXISTING METHODS AND SOFTWARE FOR SENTIMENT</p>
      <p>ANALYSIS OF TEXT DATA</p>
      <p>There are two main groups of methods for the
automatic sentiment analysis of text data:</p>
      <sec id="sec-1-1">
        <title>A. Statistical methods</title>
        <p>The basis of these methods is the use of machine
classifier. This classifier is learned on pre-marked texts in the
first stages. Then the classifier builds a model for analyzing
new documents using the knowledge gained. The algorithm
consists of:
 a collection of documents is collected for machine
classifier learning;
 each document is decomposed into a feature vector;
 the correct sentiment type is indicated for each
document;
 the selection of the classification algorithm and the
method for learning the classifier;
 the resulting model is used to determine the
documents sentiment of the new collection.</p>
        <p>The disadvantage of such methods is the need for a
large amount of data for learning.</p>
        <p>
          The statistical approach widely uses the support
vector method (SVM) [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], Bayesian models [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], various
types of regression [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], methods Word2Vec, Doc2Vec [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ],
CRF [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], convolutional and recurrent neural networks
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ][
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>Word2Vec. The Word2Vec method is based on the
vector representation of words and the determination of the
semantic proximity of lexical units based on their
distribution in collections of texts on specific topics.</p>
        <p>A big set of texts are input to Word2Vec. Specialized
vocabulary is created and at the same time is learned on this
set of texts. At the second stage, the dictionary turns into a
set of vector representations of words. This representation is
based on the contextual proximity of a given word: if the
words are found in the text side by side often enough, then
there is a semantic connection between them, and therefore,
in the vector representation, these words will have close
coordinates.</p>
        <p>For this algorithm, two training methods were developed
- CboW and Skip-gram. Schemes of these algorithms are
presented in Figure 1. The first algorithm is based on the
prediction of the next word in the sequence given during
training. The second learning method works differently - it
predicts the surrounding words. The result of this method is
the ability to calculate the "semantic distance" for each pair
of words.</p>
        <p>Doc2Vec. The Doc2Vec method consists of two
methods: distributed memory (DM) and distributed word bag
(DBOW). The DM method predicts a word from known
prior words and a paragraph vector. The paragraph vector
does not move and takes into account the word order Despite
the fact that the context moves through the text. DBOW
predicts random word groups in a paragraph based only on
the paragraph vector.</p>
        <p>A serious disadvantage of this method is the complexity
of the analysis of the training sample, which is why it is
extremely difficult to continuously update the model when
new training data is received.</p>
      </sec>
      <sec id="sec-1-2">
        <title>B. Methods based on dictionaries</title>
        <p>The method using dictionaries is based on the search for
emotive vocabulary (lexical tonality) in the text according to
pre-compiled tonal dictionaries and rules using linguistic
analysis.</p>
        <p>
          These methods can use rule lists that are substituted into
regular expressions and special rules for connecting tonal
vocabulary within sentences [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>
          Glossary terms must have a weight corresponding to the
subject area of the document in order to classify the
document with high accuracy. Emotion is taken into account
in the algorithm when finding the marker. The result of the
algorithm is the average emotional color of the text [
          <xref ref-type="bibr" rid="ref11 ref12">11-12</xref>
          ].
The following algorithm is usually used:
 assign the sentiment score from the dictionary to each
word in the text;
 calculate the overall sentiment score of the entire text
by adding the sentiment score of individual words
[13].
        </p>
        <p>The disadvantage of this method is a significant amount
of labor because the method requires the creation of many
rules.</p>
        <p>
          A mixed method is also sometimes used [
          <xref ref-type="bibr" rid="ref16">14-16</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>C. Dictionaries and thesauri</title>
        <p>There are a number of thesauri labeled with regard to the
emotional component. These dictionaries are necessary for
computer programs when analyzing the tonality of the text.</p>
        <p>WordNet-Affect is a semantic thesaurus in which
concepts related to emotions are represented using words that
have an emotional component. WordNet-Affect also uses
additional emotional labels to separate synsets according to
their emotional valency. To do this, four additional
emotional labels are defined:
 positive;
 negative;
 ambiguous;
 neutral.</p>
        <p>SentiWordNet [17] is a lexical semantic thesaurus. The
first version of SentiWordNet was developed in 2006. This
thesaurus appeared as a result of automatic annotation of
each set of synonyms in accordance with its degree of
positivity, negativity and objectivity.</p>
        <p>SenticNet is another semantic thesaurus for working with
sets of emotional concepts. SenticNet is used to design
intelligent applications designed to analyze the emotional
component of text. The main purpose of SenticNet is to
simplify the process of machine recognition of conceptual
and emotional information transmitted using natural
language. If we compare other lexical thesauruses, such as
SentiWordNet and WordNet-Affect with SenticNet, then
their main difference is that SentiWordNet and
WordNetAffect provide the linking of words and emotional concepts
at the syntactic level, not allowing to reveal the semantic
component.</p>
      </sec>
      <sec id="sec-1-4">
        <title>D. Existing sentiment analysis software.</title>
        <p>Currently there is a certain set of libraries and software
for sentiment analysis of text data.</p>
        <p>Chorus is a service for determining the emotional
coloring of email. This service was a startup and was
developed by a company from Australia. Chorus is intended
for customer support services:
 recommends the following message for processing;
 indicates a message that needs an urgent response;
 indicates where you can save the client after the
response.</p>
        <p>The disadvantage is the ability to analyze only emails.
Currently no longer supported.</p>
      </sec>
      <sec id="sec-1-5">
        <title>Sentiment Analysis with Python NLTK Text Classification</title>
        <p>[18] is a demo showing the capabilities of NLTK. He divides
the emotional coloring into positive, negative and neutral. An
API with restrictions and the ability to buy premium access
is also offered. The demo sample is a form for manual
verification with character size restrictions.</p>
        <p>Sentirength [19] is a library for analyzing emotional
coloring. The algorithm is based on the search for the
maximum tonality value in the text for each scale (ie, the
search for the word with the maximum negative rating and
the word with the maximum positive rating) [20]. As a result,
a double score (positive and negative) is given from 1 to 5.
There are also options for triple and single assessment of
results. This library is paid. You can check the library on the
project website.</p>
        <p>
          Tone Analyzer [
          <xref ref-type="bibr" rid="ref19">21</xref>
          ] is a service from IBM based on IBM
Watson. This service uses linguistic analysis to detect
emotional and linguistic connotations in the written text.
Options for using the analyzer are social listening, improving
the quality of customer service and integration with chat
bots. This service is paid and supports only English.
III.SENTIMENT ANALYSIS USING MACHINE LEARNING AND
        </p>
        <p>WORD2VEC.</p>
        <p>The Random forest method of text sentiment analysis is a
clustering method based on machine learning.</p>
        <p>Schematically, the developed algorithm is presented in
the Fig.2.</p>
        <p>1) Text data pre-processing is carried out at the first
stage. The html code, any non-alphabetic characters, and
also stop words are removed from the text. Stop words are
phrases and words that do not carry a semantic load and
make it difficult to index a page by search engines. Further,
all remaining words are reduced to lowercase.</p>
        <p>2) At the second stage, the text from these files (test
and training) presented in the form of a list of significant
words is processed using the Word2Vec tool.</p>
        <p>
          Word2vec is an open source tool for calculating word
spacing provided by Google [
          <xref ref-type="bibr" rid="ref20">22</xref>
          ]. Word2Vec creates a
special model that includes a dictionary of words with their
vector representation.
        </p>
        <p>By the similarity of the values of the vectors, synonyms
and similar words can be determined. 300-dimensional
vectors were used to most accurately identify words. The
resulting model is saved as a file.</p>
        <p>3) The next stage is the clustering of vector words
according to the K-Means method for splitting by synonyms
and similar words. The number of clusters should be such
that on average there are 5 words per cluster, for the most
accurate result.</p>
        <p>It is required to prepare data for machine learning after
breaking all the significant words into clusters. A
twodimensional array is created for each file as follows:
 the number of lines is equal to the number of text
messages in the file;
 the number of columns is equal to the number of
clusters.</p>
        <p>These data will be important in determining the
emotional coloring.</p>
        <p>
          The Random Forest model (Fig. 3) was used for machine
learning. The random forest method is currently one of the
most popular and effective methods for solving machine
learning problems, such as classification and regression. He
trains not one decision tree with his weights, but many
decision trees [
          <xref ref-type="bibr" rid="ref21">23</xref>
          ].
        </p>
        <p>Predicting data and calculating the accuracy of the
algorithm is performed using a trained model.</p>
        <p>IV.SOFTWARE ARCHITECTURE FOR OPINION MINING SOCIAL</p>
        <p>MEDIA</p>
        <p>
          A module for assessing the tonality of texts in the
information system for Opinion Mining (Fig.4) was
developed to evaluate the effectiveness of the proposed
algorithms [
          <xref ref-type="bibr" rid="ref22">24-26</xref>
          ].
        </p>
        <p>This information system solves the following tasks:
 extracts data from various social networks (Facebook,</p>
        <p>Ok, VKontakte, Instagram, Twitter, etc.)
 conducts preprocessing of the extracted data;

makes matching (comparison) of user profile data
from different social networks;
 translates the extracted data into an internal format for
storing knowledge;
 conducts semantic analysis of data using subject
ontologies to simplify the search;
 conducts sentimental analysis of the extracted data
using the developed algorithm.</p>
        <p>The developed software system for Opinion Mining has a
service architecture and supports the REST architectural
style. The ElasticSearch library is used to extract and
preprocess data. MongoDB is used to store a large set of
data. The Sypher query language is used to search the graph
database Neo4j [27-28].</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>V.EXPERIMENT RESULTS.</title>
      <p>Experiments were conducted to determine the accuracy
of estimating the emotional coloring of text data using the
random forest method.</p>
      <p>Test data is a data set from the IMDB site that contains
100,000 detailed film reviews (positive and negative). 1,500
reviews were taken separately to verify accuracy. The
maximum accuracy is 79% because some reviews do not
contain emotional coloring, but are only a retelling of the
plots of films, which lowered the accuracy of the program.</p>
      <p>When using different parameters, the running time of the
algorithm ranged from 40 to 55 minutes. In the experiments,
the optimal values of the algorithm's work were revealed,
such as the dimension of the vectors, the number of clusters
and the minimum amount of use of the word in the reviews
to make it important.</p>
      <p>The results of the experiments are presented in Table 1
and Fig.5.</p>
      <p>The best result was shown when using 300-dimensional
vectors, the minimum number of repetitions of words equal
to 60 and the number of vectors calculated so that each
cluster had an average of 5 words, i.e. 3956 clusters.</p>
      <p>Thus, in this paper, an approach to the analysis of the text
data of social networks was proposed. This approach is based
on the integration of the word2vec vectorization algorithm
and the k-means clustering algorithm using a random forest
algorithm for training a neural network. This approach was
implemented in the Opinion Mining analysis system.</p>
      <p>Experiments were conducted to evaluate the effectiveness
of this algorithm when analyzing user feedback from the
IMDB portal. The experiments showed that the Best result
was shown using 300-dimensional vectors, the minimum
number of repetitions of words was 60, and the number of
vectors was calculated so that each cluster had an average of
5 words, i.e. 3956 clusters.</p>
      <p>In future works, we plan to hybridize this approach using
well-known sentimental ontologies and dictionaries to take
into account the peculiarities of word usage and language..</p>
    </sec>
    <sec id="sec-3">
      <title>ACKNOWLEDGMENT</title>
      <p>This work was supported by the Russian Federal Property
Fund. Projects No. 18-47-730035 and 18-47-732007.</p>
      <p>A. Pazelskaya and A. Soloviev, “Method for determining emotions
in texts in Russian,” Computational linguistics and intellectual
technologies: Sat scientific articles, vol. 11, no. 18, pp. 510-523,
2011.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>O.</given-names>
            <surname>Shipilov</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Belyaev</surname>
          </string-name>
          , “
          <article-title>Analysis of the emotional color of messages in the social network twitter,” Science Questions</article-title>
          , vol.
          <volume>3</volume>
          , pp.
          <fpage>91</fpage>
          -
          <lpage>98</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Vlasov</surname>
          </string-name>
          , “
          <article-title>Description of the information image of a social network user, taking into account its psychological characteristics</article-title>
          ,”
          <source>International Journal of Open Information Technologies</source>
          , vol.
          <volume>6</volume>
          . no.
          <issue>4</issue>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.S.</given-names>
            <surname>Sabuj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Afrin and K.M.</surname>
          </string-name>
          <article-title>A</article-title>
          . Hasan, “
          <source>Opinion Mining Using Vector Machine for Web Based Diverse Data,” Pattern Recognition and Machine Intelligence. Lecture Notes in Computer Science</source>
          , vol.
          <volume>10597</volume>
          , pp.
          <fpage>673</fpage>
          -
          <lpage>678</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.P.</given-names>
            <surname>Dinu</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Iuga</surname>
          </string-name>
          , “
          <article-title>The Best Feature of the Set,”</article-title>
          <source>Computational Linguistics and Intelligent Text Processing. Lecture Notes in Computer Science</source>
          , vol
          <volume>7181</volume>
          , pp.
          <fpage>556</fpage>
          -
          <lpage>567</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I.</given-names>
            <surname>Chetviorkin</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Loukachevitch</surname>
          </string-name>
          , “
          <source>Sentiment Analysis Track at ROMIP-</source>
          <year>2012</year>
          ,”
          <article-title>Computational linguistics and intellectual technologies: Sat scientific articles</article-title>
          , vol.
          <volume>2</volume>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>50</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sokolova</surname>
          </string-name>
          , “
          <article-title>Word2Vec and Doc2Vec in Unsupervised Sentiment Analysis of Clinical Discharge Summaries</article-title>
          ,” CoRR abs
          <year>1805</year>
          .
          <volume>00352</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Antonovam</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Soloviev</surname>
          </string-name>
          , “
          <article-title>Using the conditional random fields method for processing texts in Russian,” Computational linguistics and intellectual technologies: Sat scientific articles</article-title>
          , vol.
          <volume>12</volume>
          , no.
          <issue>19</issue>
          , pp.
          <fpage>27</fpage>
          -
          <lpage>44</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Maas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Daly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ng</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          , “
          <article-title>Learning word vectors for sentiment analysis,” The International Language Technologies</article-title>
          .
          <source>International Association for Computational Linguistics</source>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>142</fpage>
          -
          <lpage>150</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Yu.V.</given-names>
            <surname>Vizilter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.S.</given-names>
            <surname>Gorbatsevich</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.Y.</given-names>
            <surname>Zheltov</surname>
          </string-name>
          , “
          <article-title>Structurefunctional analysis and synthesis of deep convolutional neural networks</article-title>
          ,
          <source>” Computer Optics</source>
          , vol.
          <volume>43</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>886</fpage>
          -
          <lpage>900</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019-43-5-
          <fpage>886</fpage>
          -900.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Saif</surname>
          </string-name>
          , “
          <article-title>Contextual semantics for sentiment analysis of Twitter,”</article-title>
          <source>Information Processing &amp; Management</source>
          , vol.
          <volume>52</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>19</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pak</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Paroubek</surname>
          </string-name>
          , “
          <article-title>Twitter as a Corpus for Sentiment Analysis</article-title>
          and
          <string-name>
            <given-names>Opinion</given-names>
            <surname>Mining</surname>
          </string-name>
          ,” LREC,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12] [14] [17] [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tarasova</surname>
          </string-name>
          , “
          <article-title>Synergy of interrogative and exclamation marks in network texts (on the material of Tatar, Russian and English languages</article-title>
          ),” Bulletin of Vyatka State University, vol.
          <volume>4</volume>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          Cand. filol. Sciences,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>B.</given-names>
            <surname>Pang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lee</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          , “
          <article-title>Thumbs up?” Sentiment Classification using Machine Learning Techniques</article-title>
          , pp.
          <fpage>79</fpage>
          -
          <lpage>86</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>P.</given-names>
            <surname>Turney</surname>
          </string-name>
          , “
          <article-title>Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews,”</article-title>
          <source>Proceedings of the Association for Computational Linguistics</source>
          , pp.
          <fpage>417</fpage>
          -
          <lpage>424</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>I.A.</given-names>
            <surname>Rycarev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Kirsh</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Kupriyanov</surname>
          </string-name>
          , “
          <article-title>Clustering of media content from social networks using BigData technology</article-title>
          ,”
          <source>Computer Optics</source>
          , vol.
          <volume>42</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>921</fpage>
          -
          <lpage>927</lpage>
          ,
          <year>2018</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2018-42-5-
          <fpage>921</fpage>
          -927.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Yarushkina and I. Andreev, "The Sentiment Analysis of Unstructured Social Network Data Using the Extended Ontology SentiWordNet,"</article-title>
          12th International Conference on Developments in eSystems Engineering (DeSE), Kazan, Russia, pp.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Esuli</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Sebastiani</surname>
          </string-name>
          , “
          <article-title>SENTIWORDNET: A Guide for Respecting the Opthion Mining</article-title>
          ,” pp.
          <fpage>417</fpage>
          -
          <lpage>422</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>I.</given-names>
            <surname>Menshikov</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Kudryavtsev</surname>
          </string-name>
          , “
          <article-title>Review of systems for analysis of tonality of a text in Russian,” Young scientist</article-title>
          , no.
          <issue>12</issue>
          , pp.
          <fpage>140</fpage>
          -
          <lpage>143</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Watson</given-names>
            <surname>Tone Analyzer</surname>
          </string-name>
          [Online]. URL: https://www.ibm.com/cloud/ watson-tone-analyzer.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [23]
          <article-title>Introduction to Word Embedding and Word2Vec [Online]</article-title>
          . URL: https://towardsdatascience.com/introduction-to
          <article-title>-word-embeddingand-word2vec-652d0c2060fa.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>J.</given-names>
            <surname>Žižka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Dařena</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Svoboda</surname>
          </string-name>
          , “Random Forest,”
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .1201/9780429469275-8.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>