<!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>Medical News Aggregation and Ranking of Taking into Account the User Needs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>nantonyk@yahoo.com</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>chyrunlv@gmail.com</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>vasyl.a.andrunyk@lpnu.ua</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>andriy.vasevych@gmail.com</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>chyrunsofia@gmail.com</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>alex.gozhyj@gmail.com</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>irina.kalinina@gmail.com</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>@gmail.com</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IT Step University</institution>
          ,
          <addr-line>Lviv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Lviv State University of Life Safety</institution>
          ,
          <addr-line>Lviv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Opole</institution>
          ,
          <addr-line>Opole</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2045</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>The purpose of this work is to develop an intelligent information system that is designed for aggregation and ranking of news taking into account the needs of the user. The online market for mass media and the needs of readers, the purpose of their searches and moments is not enough to find the news is analyzed. A conceptual model of the information aggression system and ranking of news that would enable presentation of the work of the future intellectual information system, to show its structure is constructed. The methods and means for implementation of the intellectual information system are selected. An online resource for aggregation and ranking of news, news feeds and flexible settings, a list of available sources of information, compliance with specified media and personal aggregation results are designed. Object of research is processes of aggregation of news and intelligent ranking of necessary news according to the needs of the user. Subject of research is methods and means of aggregation and ranking of news and building an information system that implements them.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Medical News</kwd>
        <kwd>News Aggregation</kwd>
        <kwd>Content Ranking</kwd>
        <kwd>User Needs</kwd>
        <kwd>Intelligent System</kwd>
        <kwd>Content Analisis</kwd>
        <kwd>Data Mining</kwd>
        <kwd>Context Filtering</kwd>
        <kwd>Bayesian Clustering</kwd>
        <kwd>Bayesian Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>We live in the age of information - the time of unrestricted access to information
resources, the time when the amount of information published by various sites, news</p>
      <p>
        feeds and other sources increases exponentially [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Every day, thousands of
electronic newspapers publish tens of thousands of articles on various topics. Each of
them may be potentially interesting to a particular reader [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. An overabundance of
news sources creates a situation in which a person can spend more time searching for
news of interest to himself than when reading these news [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. A significant number
of news aggregation algorithms are designed to overcome the excess information,
allowing a person to read immediately what is interesting [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Like information
retrieval systems, news aggregation systems allow the user to find the information he
needs. Since the needs of an individual user can vary significantly in different people,
the system of aggregation of news should be tailored to a particular person [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The
main distinguishing feature of media aggregators from other sources of information is
the unique ability to provide the most up-to-date information, regardless of the time of
day and its volume [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. At the moment, it's easy to find out what happened at the other
end of the globe in a matter of minutes or even seconds [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. An entirely new space has
emerged that destroys all possible boundaries [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. This unique opportunity gives us
modern means of communication, means of information transmission, including
radio, television, telephony, e-mail and the global Internet network with its practically
unlimited possibilities [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Meanwhile, along with an unprecedentedly large potential
for informing the society, there were the same opportunities in scope for its
misinformation [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The news aggregator solves the problem of fake publications in
the media, in particular, makes it possible to filter out unreliable news sources [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
The Internet combines visual, audio, print and video representation of data and
provides any necessary information at any level of users interested in it [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. It
involves dialogue, feedback, and not a monologue that is typical of print media, radio
and television [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. There are many similar open and paid systems. Realized
specifically for the general public or for one or another media [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Many of those
information systems do not have a wide-ranging functionality for flexible news feed
set-ups, which is mostly often demanded by regular users [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. It is this system that
will have a functional enough to solve this problem and offer a multifunctional
service to users [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. The system will be implemented as a free software product
under an open distribution license, and this approach will ensure its further
development [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methods and means of solving the problem</title>
      <p>
        Group and context filtering. Most approaches to solving the problem of information
filtering can be divided into two main categories: Contextual (Content Based
Filtering, CBF) and Groupware (Collaborative Filtering, CF) [
        <xref ref-type="bibr" rid="ref18 ref19 ref20 ref21">18-21</xref>
        ].
      </p>
      <p>
        CBF's approach is based on the assumption that news that is interesting to the user
is similar to those that were interesting to him before [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. The CF approach, in turn,
tries to find users similar to the one and then recommends to the user that information
that seemed interesting to similar users [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. A large number of studies have recently
been conducted to combine these two approaches. Such approaches are called hybrid.
      </p>
      <p>
        Context Filtering. The CBF system deals with similarity calculations, between
fresh news and user profiles [
        <xref ref-type="bibr" rid="ref24 ref25 ref26 ref27 ref28 ref29">24-29</xref>
        ]. The most common and simple method in this
category is keyword matching. Based on this simple method, systems like vector
space model were developed that allow better filtering and searching of information.
      </p>
      <p>
        Group filtering. The collaborative filtering task is to predict the benefits of
elements for a particular user, based on the user preferences database of other users
[
        <xref ref-type="bibr" rid="ref30 ref31 ref32 ref33 ref34 ref35">30-35</xref>
        ]. Consider two types of collaborative filtering: memory-based and
modelbased. Memory-based algorithms operate over the entire database to create
recommendations. Model-based, on the contrary, uses a database to study or
customize a model, which is then used in the formulation of recommendations.
Collaborative filtering systems often vary by feature: they operate by implicit or
explicit means of expressing user interests. Explicit methods mean that the user
deliberately describes his needs, usually based on a discrete integer scale. Implicit
methods mean the interpretation of user behavior or choice to determine preferences.
Implicit ways of expressing interests can be based on viewing information (for
Internet applications, for example), shopping history (for stores), or other templates
for access to information. Despite the type of available preference data, collaborative
filtering - algorithms need to cope with data deficiencies. Normally, we do not have a
complete set of preferences for all item names. It can not be assumed that the absence
of some element is a coincidence, since users are inclined to express preferences for
those elements that were viewed by them, and therefore they are interested [
        <xref ref-type="bibr" rid="ref36 ref37 ref38 ref39 ref40 ref41">36-41</xref>
        ].
      </p>
      <p>
        Memory-based algorithms. In general, the task of collaborative filtering is to
predict the user's preferences based on the custom base of preferences [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. The database
consists of users, so a set of preferences (votes) vij, which corresponds with the user i
of element j. If Ii denotes the set of elements on which user i has defined its estimates,
then you can make an average rating User i as [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ]:
(1)
(2)
In memory-based collaborative filtering, the user's evaluation algorithms, which we
denote as a, are predicted based on incomplete information about it and the set of
weights calculated on the basis of the user database. Assume that the predicted paj
estimate by a user of element j is the weighted sum of ratings of other users [
        <xref ref-type="bibr" rid="ref44">44</xref>
        ]:
where n is the number of users in the collaborative filtering database with non-zero
weights. Weights w(a,i) can reflect the distance, correlation or similarity between
each user i and the current (active) user a. Next, we will consider the details of
various collaborative filtering algorithms that relate weighting. There are other possible
characteristics of memory-based collaborative filtering, but in this work we restrict
ourselves to the wording described above [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ].
      </p>
      <p>1
vi  | Ii | jIi vij .</p>
      <p>n
paj  va   w(a,i)(vij  vi )
i1
,</p>
      <p>
        Correlation. The general formulation of collaborative filtering statistical methods
(as opposed to verbal or high-quality annotations) first appeared in the context of the
GroupLens project, where the Pearson correlation was the basis for weighting [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ].
Correlation between users a and i is expressed as:
where the sum of j is spent on the elements for which both users (a and i) have
determined their estimates.
      </p>
      <p>
        Similarity of vectors. In information retrieval area, the similarity between two
documents is usually measured through a comparison with the word-frequency vector
document and the calculation of the cosine of the angle between two vectors of
frequencies. We can use this formalism in the collaborative filtering task, where
evaluations will play the role of the words frequency. Note that by following this algorithm,
measured ratings indicate positive feedback, and negative reviews are not counted,
and invaluable items get a zero estimate. Accordingly, weights are expressed as
w(a,i)  
j
vaj
 vak2
kIa
vij
 vik2
kIi
,
where the factors in the denominator serve to normalize ratings so that users who rate
more actively than others will not be more like the others. Other schemes of
normalization are also possible. The method can be supplemented by the "default estimation"
scheme, which allows you to expand the set of user-evaluated elements. Another
important addition may be the use of so-called inverse frequency estimates. When
searching for text documents, the comparison of documents is based on the frequency
vectors of individual words, with each word having a weight reflecting its specificity,
so that the commonly used vocabulary has a lower priority. A similar pass can also be
used in collaborative filtering by introducing a new user evaluation of a element j:
n
f j  log
vaj  f jvaj , where nj [
        <xref ref-type="bibr" rid="ref47">47</xref>
        ].
      </p>
      <p>
        Model-based methods. From the probabilistic point of view, the collaborative
filtering task can be considered as calculating the mathematical expectation of the value
of the estimate based on the available information about the user [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ]. For an active
user, we want to anticipate ratings for items that have not yet been viewed. If we
assume that the estimates are integers in the range from 0 to m, then we get:
m
paj  E(vaj )   Prob(vaj  i | vak , k  Ia )i
i0
where Prob(vaj  i | vak , k  Ia ) is the likelihood that the active user will evaluate the
element j, precisely, for such a value, provided that there is an observation of the
estimates made.
      </p>
      <p>
        Bayesian clustering. Let C takes a small discrete set of values denoting clusters of
users [
        <xref ref-type="bibr" rid="ref49">49</xref>
        ]. We divide users into clusters, and we will consider their advantages
through conditional probabilities:
      </p>
      <p>
        (6)
Bayesian networks. The method of learning the Bayesian network is to form such a
network that each node of it is an element to be evaluated [
        <xref ref-type="bibr" rid="ref50">50</xref>
        ]. Each node has a finite
set of states - estimates of the corresponding element. In this model, the training
algorithm of the bay network defines the best predictors for each element, such that it
becomes possible to construct a decision tree, which, depending on the state of the
root element, determines the high probability of the value of the sheet element.
      </p>
      <p>
        In general, the Bayesian method, as well as the correlation method, work faster
than others, respectively, sharing the primacy among different sets of data [
        <xref ref-type="bibr" rid="ref51">51</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Statement and substantiation of the problem</title>
      <p>
        A conceptual model is a system that uses concepts and ideas to formulate a given
presentation. Conceptual modeling is used in many industries, ranging from sciences
to socio-economic theory to software development. Using the conceptual model to
represent abstract ideas, it is important to distinguish conceptual model from
conceptual model. That is, the model is actually a matter for itself, but this model also
contains the notion that such a model represents - which model is, unlike what is a model.
Without deep immersion in philosophy, recognizing these differences between the
model itself and what it represents is crucial to understanding the proper use of
conceptual models in the first place. Then, one should not be surprised that conceptual
models are often used as an abstract representation of real-world objects.To develop a
conceptual model for aggregation and ranking of news, it is necessary to set out the
output and input data typical for the development of this system. Input - data coming
from the outside of the system [
        <xref ref-type="bibr" rid="ref52">52</xref>
        ]:
 User registration data is you must enter your name, last name, email address and
password. The password must be confirmed, and validation is made on it;
 Data for authorization is the user must enter the password and email address of the
mail. To authorize in the admin panel, you must enter the same data, but the
administrator;
 Data for search is entered in a text format in the specified search field;
 News source is the administrator must add information about the source of news,
its rating and reliability of this online media.
 Review is the text information entered by the user to the selected news.
Output is data that is received by the user after processing by the system or other
external entities. The source data includes: various types of user search results, in which
there are keywords, a general news feed, and a rating for each publication. For
authorized users, the opportunity to receive a personal news feed is another source
information provided by the user system based on intelligent selection based on user
preferences.
      </p>
      <p>The purpose of the work is to develop an intelligent system that will be used to
aggregate and rank news based on user preferences. This system is a web-resource that
provides the following basic functions:
 searching for medical news on keywords;
 search for news about the location of the user;
 viewing and selecting the right medical news sources;
 reviewing the rating of publications;
 leaving feedback on a particular medical news or source;
 means of administering the aggregator of medical news;
To develop this web resource, client-server architecture is considered, it is considered
one of the architectural software templates and carries an important concept for the
development of network applications, and also provides for the exchange of data
between them and interaction. It includes the following essential components: a set of
servers, a set of clients and a network.</p>
      <p>Appointment of the system. This resource is designed to aggregate and rank
medical news based on the needs of the user, and in order to facilitate the choice of the
user, the system will generate a personal medical news feed, but only for registered
users. The user will be able to search for the receipt and search for medical news by
keywords, put filters on the search results, receive medical news that is next to him,
that is within a certain radius. To improve the results of the medical news feeds, the
user will be able to leave feedback, this will be one of the factors influencing the
subsequent selections of medical news publications.</p>
      <p>Place of application of the system. The system will be useful for readers of the
online media who do not want to spend time searching for the medical news they need
and to hang out the pre-selected set. This system will help the user to find medical
news on the keywords, filter the results by the specified type. A registered user is also
able to post reviews about individual medical news. And on the basis of his
assessments get a more interesting for him a selection of medical news.</p>
      <p>Justification, development and implementation of the system. To date,
Ukrainian Internet media have already had a significant and very interesting way of
development. Publishers, through trial and error, accumulated experience, the market was
strong and developed along with the improvement of new technologies. As a result,
today we see high-tech multimedia media with great services and wide opportunities.
And one can safely assert that this is just the beginning. Currently, many media
experts are seeing a great future in the online media market. Instead of the expected
decay of print media, convergence occurs: many publications that want to develop
and receive new interactive capabilities go online. There is also a reverse trend:
convergent not only the Internet with print editions - has it also connected to television.</p>
      <p>Expected effects from the implementation of the system. Like information
retrieval systems, aggregation systems will allow the user to quickly find the
information he needs. Since the needs of an individual user can vary significantly in
different people, the system of aggregation of medical news should be tailored to a
particular person. The main distinguishing feature of the aggregator of the Internet media
from other sources of information will be a unique opportunity to provide the most
up-to-date information, regardless of the time of day and its volume.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Algorithm for choosing medical news sources to show to user</title>
      <p>The task of finding medical news sources interesting to the user is complicated by the
number of sources. In order for the algorithm given in the previous section to collect
statistics for all agencies, it would have been necessary for decades. In order to
overcome this problem, group filtering algorithms were used in this paper. Accordingly,
the best way with the task of group filtering medical news is to handle the Memory
Based algorithm with weights equal to the correlation of the user vectors. In general,
Memory Based methods are characterized by the possibility of effective
implementation on the database, which is also the advantage of this algorithm for systems with a
large number of users.</p>
      <p>Consider the algorithm described by the following two formulas:</p>
      <p>n
paj  va   w(a,i)(vij  vi ),</p>
      <p>i1
So, at the beginning of each custom session, we have va, the vector of explicit user
ratings and the vector pa, obtained using the group filtering algorithm. You must
select k sources that will be shown to the user (Fig. 1).</p>
      <sec id="sec-4-1">
        <title>NotInteresting</title>
      </sec>
      <sec id="sec-4-2">
        <title>Banned</title>
      </sec>
      <sec id="sec-4-3">
        <title>NonObserved</title>
      </sec>
      <sec id="sec-4-4">
        <title>Newbie</title>
      </sec>
      <sec id="sec-4-5">
        <title>Interesting</title>
      </sec>
      <sec id="sec-4-6">
        <title>Favorite</title>
        <p>The source, about which the user does not know anything, is in the NonObserved
state. The Newbie group has a fixed size and comes with NonObserved sources that
have received the highest ranking by the group filtering algorithm. What got into the
group Newbie gets va,i equal va .</p>
        <p>In the state of Newbie channels are within 4 sessions after getting into it, in which
they were displayed. This time should be enough for the user to evaluate the content.
After the end of the 4 sessions, the source passes either to the interesting or to the
NotInteresting, depending on the amount of interest to it from the user. In the state of
Interesting are those channels that are of greatest interest to the user. From it the
stream passes to the state of NotInteresting in the event of a fall in the value of
interest in it. I will be banned and favorite will be issued as a result of explicit user actions
(by pressing the buttons add to favorite and ban). In these states the channel is located
regardless of what the algorithms give it. The display algorithm works as follows:
preferred and interest channels are displayed whenever they have medical news. If
there is not enough of these channels, channels are added in the state of Newbie.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Client-server interaction architecture</title>
      <p>Web applications are a type of program built on the client-server architecture. The
client-server model is a program structure that distributes tasks and loads between
resource providers and services, servers, and those who send a request ie a client.
Essentially, clients and servers are software. As a rule, they are located on different
computers and exchange data on a computer network using network protocols, but
sometimes the client and the server can be on the same computer. The server host
runs one or more server programs that distribute their resources between clients. The
client asks for the content of the server, but does not transmit anything. Servers are
waiting for requests, and customers initiate communication sessions with them.
Customer requests are handled on a server - where the Database is located and the
Database Management System (DBMS). This gives you the advantage of not having to
send large volumes of data, and the query is optimized in such a way that it consumes
a minimum amount of time. All this increases the system performance and reduces
the waiting time for the result of the request. When performing queries, the server
significantly increases the security of data, since data integrity rules are determined in
the database on the server and are unique to all applications that use this database.</p>
      <p>Customer functions:
 Initialization of the server request;
 Processing of the results of requests received from the server;
 Representation of the results of the request to the user in the form of a user
interface.</p>
      <p>Server functions:
 Receiving requests from the client;
 Processing requests;
 Execution of requests to the Databases and their optimization (Fig. 2);
 Sending results of client requests;
 Providing security (Fig 3);
 Providing stability to multi-user mode of operation.</p>
      <sec id="sec-5-1">
        <title>RSS Feed 1</title>
      </sec>
      <sec id="sec-5-2">
        <title>Atom feed</title>
      </sec>
      <sec id="sec-5-3">
        <title>RSS Feed 2</title>
      </sec>
      <sec id="sec-5-4">
        <title>Scanner</title>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Productivity</title>
      <p>Software development has evolved over the years, from manual testing, but in those
times the requirements were much lower, the sites were text and downloaded in a few
minutes. Therefore, the Web developer had much less incentive to pre-test. But rates
have grown as ecommerce gains momentum in the world of web development.
Therefore, testing began to be conducted in the development environment. But with the
growth of applications began to automate and test. Developers began to write
automated tests. In the end, testing has matured to such an extent that it has spread beyond
the simple set of test modules and integration tests in the playback style.
Organizations began to build increasingly sophisticated, thin test cases.</p>
      <p>To date, the rates for applications have become higher than ever.</p>
      <p>The tests of the program have long been de facto standard. Since the applications
became too complicated for manual testing, test frameworks were created to automate
testing. And any good code starts with writing tests. But this does not let you know
how the application behaves in the real environment. Testing the performance of web
applications fixes it. Performance testing is a form of software testing that focuses on
how the system works under a certain load. Performance testing should give
organizations the diagnostic information they need to identify and troubleshoot.</p>
      <p>The slow work of apps affects paid subscribers, and new subscribers become less
influential on revenue. Most often, the problem of performance is very difficult due to
the fact that it is difficult for developers to reproduce such "bugs". Performance issues
do not directly affect the behavior of the software. Rather, they are related to how the
software reacts to the chaotic world of environments in which the application is
launched. Therefore, it is necessary to conduct performance testing.</p>
      <p>Usual QA testing is to observe how the app handles one person. To produce the
test, you need to simulate the harsh conditions, so you can detect how behaving the
application under heavy load, so-called load testing.</p>
      <p>In the test environment, you can choose the load for the application, for example,
the simultaneous use of the application by a thousand users in the normal operations
and measure the behavior of the program. Does it keep track of speed or slows down
or even drops? Of course, such testing will not be conducted by a thousand real
people. To do this, software is created to help simulate the load.</p>
      <p>In addition to stress testing, a stress test and endurance testing are performed.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Description of the task realization</title>
      <p>The developed software product is called Intelligent Information System and Medical
news Ranking. The purpose of this product is to help users, based on their preferences,
to compile a mix of medical news from different media, usually based on the criteria
given automatically.</p>
      <p>The aggregate information system and medical news ranking allows the user to
automatically scan medical news sites and aggregate algorithms to form a medical news
feed. Since the needs of an individual user can vary significantly in different people,
the system of aggregation of medical news adapts to a specific person.</p>
      <p>Functional restrictions are imposed on users with outdated versions of browsers,
since they do not support the latest standards used to develop this product.</p>
      <p>The database of the web service consists of 10 tables. This system was developed
as distributed, where one part is responsible for displaying the data, the other for its
processing, where the existence of the first without the second does not make sense.</p>
      <p>The bulk of the system being developed includes sub-modules for processing,
shaping, validating data, and the logic of working with them. Thanks to well-chosen
software implementations, software solutions have a high degree of declarative,
which provides ease of understanding of executable code and simplifies the
development of the system.</p>
      <p>Before running the program, you must run the executable web server locally or
deploy it on a dedicated server with a static IP address. If we start the site locally, then
we need to open a localhost with the port specified in the parameters in the browser. If
the site is deployed on a dedicated server, we should open the server address or its
domain name in the browser. The entry point in the program can be both the main
page and the admin panel page.</p>
      <p>The input can include:
 Search data;
 Medical news sources;
 Data for user registration;
 Reviews.</p>
      <p>Output data for the system of automation of contextual advertising can be:
 Generated medical news feed;
 Medical news rating;
 User-wanted medical news.
8</p>
    </sec>
    <sec id="sec-8">
      <title>Instruction for the user</title>
      <p>The Aggregation and Ranking system works as a web page, and in order to take
advantage of its capabilities, the user must have a pre-installed browser, which version
is not younger than the version released in 2016, in order to go through all the
functionality. The web page requires permission to execute JavaScript scripts, since it is
completely built on them. The service consists of two parts:
 The component responsible for displaying and working with users, that is, the
interface of the system, implemented under the web page;
 A component that acts as the heart of a system that implements the entire
functionality, and can connect to other interfaces such as mobile applications.</p>
      <p>The service solves the problem of aggregation and ranking of medical news based on
user preferences. Provides flexible medical news feed setting. Using the aggregation
service and ranking of medical news will save time in finding the right medical news,
as the system analyzes the user's preferences and automatically generates a suitable
medical news feed for him. The system also allows the user to flexibly configure
aggregation, select medical news sources that he likes to read and type of publication.
The service will function correctly with browsers released in 2016 and later. Without
permission to run JavaScript scripts, the service will not be able to function.
Requirements for the technical characteristics of the device on which this service is used is
the same as the requirements of the browser in this device. Necessary Internet
connection.
9</p>
    </sec>
    <sec id="sec-9">
      <title>Conclusions</title>
      <p>In the article an object approach was defined, which allowed to construct diagrams:
components, states, sequences, activities, classes, usage options, and design a target
tree. By establishing and justifying the expediency of creating this system,
connections and necessary external entities are defined in order to achieve the desired results,
as well as determined: the purpose of development, the purpose and place of
application of the system, the development of a conceptual model (input and output data).</p>
      <p>The choice and justification of the methods for solving the problem was made for
realization of this intellectual information system of aggregation and ranking medical
news Selected and grounded list of various solutions to this problem problems among
which: software (libraries, database extensions, frameworks, package managers),
systems that significantly accelerate and facilitate development of this system, and in
some cases, it is possible to solve all set for development of the task.</p>
      <p>This work describes the key features of the system, described the creation of a
software product, which such properties as general information, functional purpose,
description of the logical structure, input data, call and download, output data. The
user manual describes the features of the system and the possibilities of use, the
functional limitations that may be imposed on the user due to the non-compliance of the
environment. The description of the control example, which demonstrates the realized
possibilities of the system of aggregation of medical news, shows the drawings, which
confirm this and describes the main way of using the system.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Mukalov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelinskyi</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levkovych</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tarnavskyi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pylyp</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shakhovska</surname>
          </string-name>
          , N.:
          <article-title>Development of System for Auto-Tagging Articles, Based on Neural Network</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>106</fpage>
          -
          <lpage>115</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noha</surname>
          </string-name>
          , R. Y.:
          <article-title>Methods and tools for text analysis of publications to study the functioning of scientific schools</article-title>
          .
          <source>In: Journal of Automation and Information Sciences</source>
          ,
          <volume>47</volume>
          (
          <issue>12</issue>
          ). (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shvorob</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>The method for detecting plagiarism in a collection of documents</article-title>
          ,”
          <source>Computer Sciences and Information Technologies (CSIT)</source>
          ,
          <fpage>142</fpage>
          -
          <lpage>145</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Arzubov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lipinski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Analyzing ways of building user profile based on web surf history</article-title>
          .
          <source>In: Computer Sciences and Information Technologies (CSIT)</source>
          ,
          <volume>1</volume>
          ,
          <fpage>377</fpage>
          -
          <lpage>380</lpage>
          . (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basystiuk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Development of the Speech-to-Text Chatbot Interface Based on Google API</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>212</fpage>
          -
          <lpage>221</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bobalo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stakhiv</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mandziy</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holoschuk</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>The concept of electronic textbook "Fundamentals of theory of electronic circuits</article-title>
          .
          <source>In: Przegląd Elektrotechniczny</source>
          ,
          <volume>88</volume>
          NR 3a/
          <year>2012</year>
          ,
          <fpage>16</fpage>
          -
          <lpage>18</lpage>
          . (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Makara</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The consolidated information web-resource about pharmacy networks in city</article-title>
          ,
          <source>” CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2255</volume>
          ,
          <fpage>239</fpage>
          -
          <lpage>255</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Korobchinsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Peculiarities of Content Forming and Analysis in Internet Newspaper Covering Music News</article-title>
          , In: Computer Science and Information Technologies,
          <source>Proc. of the Int. Conf. CSIT</source>
          ,
          <fpage>52</fpage>
          -
          <lpage>57</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Naum</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kanishcheva</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Intellectual System Design for Content Formation</article-title>
          .
          <source>In: Computer Science and Information Technologies, Proc. of the Int. Conf. CSIT</source>
          ,
          <fpage>131</fpage>
          -
          <lpage>138</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kanishcheva</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Method of Integration and Content Management of the Information Resources Network</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing</source>
          ,
          <volume>689</volume>
          , Springer,
          <fpage>204</fpage>
          -
          <lpage>216</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lytvynenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savina</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krejci</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voronenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakobchuk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryvoruchko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Bayesian Networks' Development Based on Noisy-MAX Nodes for Modeling Investment Processes in Transport</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lytvynenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lurie</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krejci</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voronenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savina</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taif</surname>
            .,
            <given-names>M. A.</given-names>
          </string-name>
          :
          <article-title>Two Step Density-Based Object-Inductive Clustering Algorithm</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>117</fpage>
          -
          <lpage>135</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Designing architecture of electronic content commerce system</article-title>
          .
          <source>In: Computer Science and Information Technologies, Proc. of the X-th Int. Conf. CSIT'</source>
          <year>2015</year>
          ,
          <fpage>115</fpage>
          -
          <lpage>119</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Vysotska</surname>
          </string-name>
          , V.:
          <article-title>Linguistic Analysis of Textual Commercial Content for Information Resources Processing</article-title>
          . In: Modern Problems of Radio Engineering, Telecommunications and Computer Science, TCSET'
          <year>2016</year>
          ,
          <fpage>709</fpage>
          -
          <lpage>713</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Rusyn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pohreliuk</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Model and architecture for virtual library information system</article-title>
          .
          <source>In: Computer Sciences and Information Technologies</source>
          ,
          <fpage>37</fpage>
          -
          <lpage>41</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Rusyn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Emmerich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pohreliuk</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The Virtual Library System Design and Development</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing</source>
          ,
          <volume>871</volume>
          ,
          <fpage>328</fpage>
          -
          <lpage>349</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Features of E-Learning Realization Using Virtual Research Laboratory</article-title>
          . In: Computer Science and Information Technologies,
          <source>Proc. of the XI-th Int. Conf. CSIT'</source>
          <year>2016</year>
          ,
          <fpage>143</fpage>
          -
          <lpage>148</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Shakhovska</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <article-title>Intelligent Systems Design of Distance Learning Realization for Modern Youth Promotion and Involvement in Independent Scientific Researches</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing 512</source>
          . Springer International Publishing AG,
          <fpage>175</fpage>
          -
          <lpage>198</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Information resources processing using linguistic analysis of textual content</article-title>
          .
          <source>In: Intelligent Data Acquisition and Advanced Computing Systems Technology and Applications</source>
          , Romania,
          <fpage>573</fpage>
          -
          <lpage>578</lpage>
          , (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Rzheuskyi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stefanchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oborska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lozynska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mykich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basyuk</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Development of Mobile Application for Choreographic Productions Creation and Visualization</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          ,
          <volume>2386</volume>
          ,
          <fpage>340</fpage>
          -
          <lpage>358</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rzheuskyi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Technology for the Psychological Portraits Formation of Social Networks Users for the IT Specialists Recruitment Based on Big Five, NLP and Big Data Analysis</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2392</volume>
          ,
          <fpage>147</fpage>
          -
          <lpage>171</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Information Technology of Processing Information Resources in Electronic Content Commerce Systems</article-title>
          . In: Computer Science and Information Technologies, CSIT'
          <year>2016</year>
          ,
          <fpage>212</fpage>
          -
          <lpage>222</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Distance Learning Method for Modern Youth Promotion and Involvement in Independent Scientific Researches</article-title>
          .
          <source>In: Proc. of the IEEE First Int. Conf. on Data Stream Mining &amp; Processing (DSMP)</source>
          ,
          <fpage>269</fpage>
          -
          <lpage>274</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Chyrun L.:
          <article-title>Analysis and evaluation of risks in electronic commerce</article-title>
          ,
          <source>CAD Systems in Microelectronics, 9th International Conference</source>
          ,
          <volume>332</volume>
          -
          <fpage>333</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Analysis features of information resources processing</article-title>
          .
          <source>In: Computer Science and Information Technologies, Proc. of the Int. Conf. CSIT</source>
          ,
          <fpage>124</fpage>
          -
          <lpage>128</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The Commercial Content Digest Formation and Distributional Process</article-title>
          .
          <source>In: Computer Science and Information Technologies, Proc. of the XI-th Int. Conf. CSIT'</source>
          <year>2016</year>
          ,
          <fpage>186</fpage>
          -
          <lpage>189</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pukach</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobyk</surname>
          </string-name>
          , І.,
          <string-name>
            <surname>Pakholok</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>A method for constructing recruitment rules based on the analysis of a specialist's competences</article-title>
          .
          <source>In: Eastern-European Journal of Enterprise Technologies</source>
          ,
          <volume>6</volume>
          /2(
          <issue>84</issue>
          ),
          <fpage>4</fpage>
          -
          <lpage>14</lpage>
          . (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Content monitoring method for cut formation of person psychological state in social scoring</article-title>
          .
          <source>In: Int. Scientific and Technical Conference on Computer Sciences and Information Technologies</source>
          , CSIT,
          <fpage>106</fpage>
          -
          <lpage>112</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chyrun</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Content Analysis Method for Cut Formation of Human Psychological State</article-title>
          .
          <source>In: International Conference on Data Stream Mining and Processing</source>
          ,
          <volume>139</volume>
          -
          <fpage>144</fpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veres</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>The Contextual Search Method Based on Domain Thesaurus</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing</source>
          ,
          <volume>689</volume>
          ,
          <fpage>310</fpage>
          -
          <lpage>319</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veres</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
          </string-name>
          , H.:
          <article-title>Classification methods of text documents using ontology based approach</article-title>
          ,
          <source>Advances in Intelligent Systems and Computing</source>
          ,
          <volume>512</volume>
          ,
          <fpage>229</fpage>
          -
          <lpage>240</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dosyn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Model of Touristic Information Resources Integration According to User Needs</article-title>
          .
          <source>In: Computer Sciences and Information Technologies</source>
          ,
          <fpage>113</fpage>
          -
          <lpage>116</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dosyn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Method for ontology content and structure optimization, provided by a weighted conceptual graph</article-title>
          .
          <source>In: Webology</source>
          ,
          <volume>15</volume>
          (
          <issue>2</issue>
          ),
          <fpage>66</fpage>
          -
          <lpage>85</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalinina</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>The method of web-resources management under conditions of uncertainty based on fuzzy logic</article-title>
          .
          <source>In: Int. Scientific and Technical Conference on Computer Sciences and Information Technologies</source>
          ,
          <fpage>343</fpage>
          -
          <lpage>346</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yevseyeva</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalinina</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozhyj</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Web Resources Management Method Based on Intelligent Technologies</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing</source>
          ,
          <volume>871</volume>
          ,
          <fpage>206</fpage>
          -
          <lpage>221</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dosyn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lozynska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oborska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Methods of Building Intelligent Decision Support Systems Based on Adaptive Ontology</article-title>
          .
          <source>In: International Conference on Data Stream Mining and Processing</source>
          , DSMP,
          <fpage>145</fpage>
          -
          <lpage>150</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kravets</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Ontological approach to plot analysis and modeling</article-title>
          ,
          <source>” CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>22</fpage>
          -
          <lpage>31</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veres</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rishnyak</surname>
          </string-name>
          , H.:
          <article-title>The Risk Management Modelling in Multi Project Environment</article-title>
          .
          <source>In: International Scientific and Technical Conference on Computer Sciences and Information Technologies</source>
          , CSIT,
          <fpage>32</fpage>
          -
          <lpage>35</lpage>
          . (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pukach</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vovk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ugryn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Method of functioning of intelligent agents, designed to solve action planning problems based on ontological approach,” Eastern-</article-title>
          <source>European Journal of Enterprise Technologies</source>
          ,
          <volume>3</volume>
          /2(
          <issue>87</issue>
          ),
          <fpage>11</fpage>
          -
          <lpage>17</lpage>
          . (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demkiv</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ukhanska</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hladun</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalchuk</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petruchenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dzyubyk</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sokulska</surname>
          </string-name>
          , N.:
          <article-title>Design of the architecture of an intelligent system for distributing commercial content in the internet space based on SEOtechnologies, neural networks, and Machine Learning</article-title>
          .
          <source>In: Eastern-European Journal of Enterprise Technologies</source>
          ,
          <volume>2</volume>
          (
          <issue>2</issue>
          -
          <fpage>98</fpage>
          ),
          <fpage>15</fpage>
          -
          <lpage>34</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Vasyl</surname>
            <given-names>Lytvyn</given-names>
          </string-name>
          , Victoria Vysotska, Dmytro Dosyn, Roman Holoschuk, Zoriana Rybchak:
          <article-title>Application of Sentence Parsing for Determining Keywords in Ukrainian Texts</article-title>
          . In: Computer Science and Information Technologies, CSIT,
          <fpage>326</fpage>
          -
          <lpage>331</lpage>
          . (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hasko</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuchkovskiy</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Process analysis in electronic content commerce system</article-title>
          .
          <source>In: International Conference on Computer Sciences and Information Technologies</source>
          , CSIT,
          <fpage>120</fpage>
          -
          <lpage>123</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fernandes</surname>
            ,
            <given-names>V.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Emmerich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Web content support method in electronic business systems”</article-title>
          ,
          <source>CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2136</volume>
          ,
          <fpage>20</fpage>
          -
          <lpage>41</lpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharonova</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hamon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grabar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kowalska-Styczen</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          : . In:
          <article-title>Computational linguistics and intelligent systems</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2136</volume>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          45.
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rusyn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pohreliuk</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berezin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naum</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <source>Textual Content Categorizing Technology Development Based on Ontology. In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>234</fpage>
          -
          <lpage>254</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          46.
          <string-name>
            <surname>Vysotska</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvyn</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berezin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Emmerich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Basto</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          :
          <article-title>Development of Information System for Textual Content Categorizing Based on Ontology</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>53</fpage>
          -
          <lpage>70</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          47.
          <string-name>
            <surname>Leoshchenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skrupsky</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Parallel Method of Neural Network Synthesis Based on a Modified Genetic Algorithm Application</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>11</fpage>
          -
          <lpage>23</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          48.
          <string-name>
            <surname>Bisikalo</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ivanov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sholota</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Modeling the Phenomenological Concepts for Figurative Processing of Natural-Language Constructions</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          49.
          <string-name>
            <surname>Shepelev</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khairova</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kochueva</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Method “Mean - Risk” for Comparing PolyInterval Objects in Intelligent Systems</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>12</fpage>
          -
          <lpage>21</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          50.
          <string-name>
            <surname>Khairova</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kolesnyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mamyrbayev</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukhsina</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>The Aligned KazakhRussian Parallel Corpus Focused on the Criminal Theme</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2362</volume>
          ,
          <fpage>116</fpage>
          -
          <lpage>125</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          51.
          <string-name>
            <surname>Romanenkov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Pasichnyk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veretennikova</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazaruk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leheza</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Information and Technological Support for the Processes of Prognostic Modeling of Regional Labor Markets</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>24</fpage>
          -
          <lpage>34</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          52.
          <string-name>
            <surname>Levchenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanyshyn</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dosyn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Method of Automated Identification of Metaphoric Meaning in Adjective + Noun Word Combinations (Based on the Ukrainian Language)</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          , Vol-
          <volume>2386</volume>
          ,
          <fpage>370</fpage>
          -
          <lpage>380</lpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>