<!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>Algorithm for the Information Space Forming and the Evaluation  of Input Objects Search Efficiency </article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vadym Mukhin</string-name>
          <email>v.mukhin@kpi.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valerii Zavgorodnii</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yaroslav Kornaga</string-name>
          <email>ya.kornaga@kpi.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lesia Baranovska</string-name>
          <email>lesia@baranovsky.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”</institution>
          ,
          <addr-line>Peremohy Avenue, 37, Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine\</country>
        </aff>
      </contrib-group>
      <fpage>193</fpage>
      <lpage>204</lpage>
      <abstract>
        <p>   Concept, algorithm and scheme of information space formation is considered in this paper. This algorithm involves the use of an information system, which is actually a software basis for maintaining the information space. Identification of the input object in the information space allows us to identify it univocally according to the relevant features. For this, an identification method based on consecutive analysis of the object's characteristics is used. Classification of the information objects in view to add them to the information space on basis of multidimensional discriminant analysis is considered. Efficiency analysis of the input objects search in information space is perform.</p>
      </abstract>
      <kwd-group>
        <kwd> 1  information space</kwd>
        <kwd>information object</kwd>
        <kwd>parameters</kwd>
        <kwd>discriminant analysis</kwd>
        <kwd>object identification</kwd>
        <kwd>search method</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction </title>
      <p>
        Unified information space can be considered as the information model of a complex subject area. It
includes the information objects, the links between them, the space environment and the processes for
the creation the unified information space [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1–4</xref>
        ]. Unified information space is form as result of
processing information about an object, received from various sources [
        <xref ref-type="bibr" rid="ref10 ref6 ref7 ref8 ref9">5–9</xref>
        ].
      </p>
      <p>
        The contradiction arises between the heterogeneous nature of sensors for collecting features of
objects and the requirement for unified data presentation [
        <xref ref-type="bibr" rid="ref11 ref12">10, 11</xref>
        ]. In this case, the same object, the
parameters of which obtained from different sensors, should be identified uniquely anyway [
        <xref ref-type="bibr" rid="ref13 ref14">12, 13</xref>
        ].
      </p>
      <p>
        An information object is a formal description of some object by its main parameters. It describes as
a tuple of parameters of the object, and all values of parameters are determined by characteristics of
real object. The information about objects in the unified information space changes in dynamic way [
        <xref ref-type="bibr" rid="ref15 ref16 ref2">1,
14, 15</xref>
        ]. The design of the unified information space allows us to provide a unified description of
information objects for all users, and the all users will receive the same information object in the same
way. This feature is the key factor for the unified information space [
        <xref ref-type="bibr" rid="ref17 ref18 ref3">2, 16, 17</xref>
        ].
      </p>
      <p>The unified information space allows us to give the access to the common information without the
limits for place and time. The computer system is form as the basis for unified information space and it
performs the following main functions: transformation of information about objects and formation of
unified in-formation space; to provide users with information about objects.</p>
      <p>The creation of an information space is intended to provide access to some common information
without the space and time limits. The basis of the information space is a set of computer systems, local
networks, open networks (Internet), software (operating system, applications, databases, mail services,
etc.). Also, the creation the information space is based on the mechanisms that combine the different
information systems to each other.</p>
      <p>
        The main purpose of the information space is to unambiguously compare each input object to the
respective information object in information space [
        <xref ref-type="bibr" rid="ref19 ref20 ref21 ref22">18–21</xref>
        ]. The identification of the input object in the
information space allow us to uniquely identify it by the appropriate parameters. The identification
method, based on a consecutive analysis of the parameters of the input object, can be used for this
purpose [
        <xref ref-type="bibr" rid="ref23 ref24 ref25">22–24</xref>
        ].
      </p>
      <p>
        Identification of the information object is performed by the external or internal parameters, taking
into account the interaction of the information object in the information space. To do this, each
information object is assigned a set of parameters that, to some extent, characterize the object, i.e. form
the image of the information object. Similarly, an information request to input object is formulated as
brief description [
        <xref ref-type="bibr" rid="ref26 ref27 ref28">25–27</xref>
        ].
      </p>
      <p>
        Due to this, the procedure of the input object identification is just a simple comparison of its
parameters with a certain image of the query [
        <xref ref-type="bibr" rid="ref29 ref30 ref31">28–30</xref>
        ]. In the case when the parameters of the input
object in the necessary and sufficient way match the parameters of initial object, we may consider that
the input object has been identified successfully.
2. Algorithm for the information space forming 
      </p>
      <p>We present an algorithm for the information space design that based on the information system
(Fig. 1):</p>
      <p>1. Information system is a distributed system that performs the conversion of information from
various sources and usually it comes in different formats, into a single set of information object’s
parameters, by which users of information space can uniquely identify the input object.</p>
      <p>2. The user's entry point into the information system is created. There may be many such entry
points.
3. A single hardware space formed for the user regardless of the certain entry point. That is, to
process the information request of any user, the same hardware is used.</p>
      <p>4. The software tools are available to the user from anywhere.</p>
      <p>5. Each user has an account, which contains the software tools that are often used by him, as well as
his actions, including in relation to specific services.</p>
      <p>6. User accounts are stored remotely and user may access them from the different login points.
7. The user enter into the information space via entry point, and there is performed the adjusting of
his environment, i.e. the services that he often used are fixed, and his actions in for the specific services
are analyzed.</p>
      <p>8. As a result, the information system is present to the user as a single space, regardless of the current
entry point.</p>
      <p>Figure 2 shows the general scheme of the information space formation.</p>
      <sec id="sec-1-1">
        <title>Figure 2: The general scheme of information space formation </title>
        <p>The data collection in the information space and its formation is presented in the form of a graph,
which reflects an integrated model of the information space, where the nodes of the graph correspond
to the information objects, and arcs are the relationship between these objects.</p>
        <sec id="sec-1-1-1">
          <title>Formally, such a model is described as:</title>
          <p>, , ,  ,   (1) 
where  is the set of information objects;  is the set of parameters of information objects;  is the set
of connections types;  is mapping that specifies a certain relationship from set of relationships between
the information objects.</p>
          <p>We define the set of connections types as the union of the set of connections between information
objects and the set of connections between the parameters of information objects:
 
 , 
(2) 
where  is the set of connections between information objects; 
the parameters of information objects.</p>
          <p>In turn, the single information space is a union of information spaces:
is the set of connections between
where  is the number of information spaces.</p>
          <p>Moreover, each single information space is presented as a graph:
 
, , , 
,  ,  ,  
where  is the set of information spaces;  is the set of connections types, which is similar to expression
(2) are the union of a set of connections between information objects of information spaces 
set of relationships between the parameters of information objects of information spaces 
and the</p>
          <p>is mapping that specifies a certain relationship of set of types between set of the information
⋃ 
spaces  .</p>
          <p>For each input object   1, 
information object</p>
          <p>1, 
is determined. In case when  ,

⋂ 
⋂</p>
          <p>, that enters the inputs of the information space and
, which already are in the information space, the set of parameters  ,</p>
          <p>does not completely match the set of parameters  and  ,
 is considered identified and is not added to the information space  .
such an input object</p>
          <p>is considered new and is added to the information space  .</p>
          <p>Otherwise in case when  , 
matches the set of parameters 
and 
, such an input object
between the new information object and the existing information objects of the
are added. An important goal of the information space design is to transform the</p>
          <p>Also, the links 
information space 
present unambiguously.
input information in the certain way when each information object in the information space will be</p>
          <p>The parameters of information objects in the information space should be defined in unified format
and their number must be the same. The users of the information space should also perceive information
objects unambiguously. Usually, the input data in the information space has heterogeneous nature. The
goal of the internal mechanisms of the computer system is to transform the heterogeneous information
coming in different formats and from different sources into a single set of parameters of information
objects, by which the users of information space can uniquely identify the input object.


(3) 
(4) 
(5) 
3. Classification of information objects in the information space </p>
          <p>We use the multidimensional discriminant analysis to classify information objects in order to add
them to the information space. To do this, for each information space we built a discriminant function
in the following form:
calculate the value of the discriminant function 
.</p>
          <p>Then, based on a set of values</p>
          <p>for each information space, we calculate the main statistical
characteristics of the obtained values of discriminant functions: expected value 
and dispersion
. These characteristics make it possible to determine the affiliation of a new information object



⋯</p>
          <p>, 
;</p>
          <p>where 
space; 
is the value of the discriminant function for  -th information object in ℎ-th information
are the parameters  -th information object that are significant (have a value other than
NONE) for ℎ-th information space,  1, 
corresponds to ℎ-th information space, ℎ 1,  ; 
is the free coefficient of discriminant function, which
are the coefficients of the discriminant function,
which correspond to the significant parameters of each information space,  1, 
.</p>
          <p>Then, for each information object 
 1, 
in each information space 
ℎ 1, 
, we
to a particular information space.
discriminant functions are calculated 
for each information space. New information object 
case when its characteristics meet the following condition:</p>
          <p>For each input object  , which should be added as a new information object 
, the values of
and are compared with the obtained statistical characteristics</p>
          <p>will be added to the information space in





.  
(6) </p>
          <p>The implementation of the above discriminant analysis allow us determine the certain information
space to which the new input information object should correspond.
space </p>
          <p>Let us analyze the effectiveness of the input objects search in the information space. We created an
information space of 20,000 information objects for the experiments. The part of the missing parameters
in the information objects (NONE) was set at the level 6%. After that, the information space was
reconstructed by excluding of the duplicate information objects. We performs 100 experiments with
certain probabilities (5, 10, 15, 20, and 25%, respectively), which reflects the fact that the parameter
would not be read by sensors (NULL).</p>
          <p>Let us consider the case when every of the 20,000 information objects is described by 7 parameters.
Table 1 shows a fragment of 10 information objects (
) of the information space ( ).</p>
        </sec>
      </sec>
      <sec id="sec-1-2">
        <title>A fragment of the is information space of 10 information objects    ІО  IO1 </title>
        <p>IO2 
IO3 
IO4 
IO5 
IO6 
IO7 
IO8 
IO9 
IO10 
Р1 
2±0.2 
2±0.2 
2±0.3 
5±0.4 
1±0.7 
5±0.4 
NONE 
3±0.4 
2±0.3 
4±0.7 
Р2 
2±0.7 
6±0.7 
5±0.4 
6±0.6 
6±0.3 
4±0.4 
4±0.5 
2±0.6 
3±0.4 
4±0.2 
Р3 
3±0.4 </p>
      </sec>
      <sec id="sec-1-3">
        <title>NONE </title>
        <p>4±0.1 
NONE 
5±0.9 
3±0.7 
7±0.6 
3±0.8 
5±0.6 
5±0.3 
Parameters 
Р4 
6±0.4 
6±0.9 
8±0.2 
7±0.4 
7±0.8 
6±0.4 
6±0.2 
4±0.2 
5±0.5 
4±0.5 
Р5 
7±0.6 
9±0.8 
5±0.9 
5±0.6 
5±0.8 
5±0.9 
9±0.2 
6±0.5 
8±0.6 
7±0.5 
Р6 
10±0.6 
9±0.7 
10±0.3 
8±0.5 
8±0.5 
8±0.4 
6±0.4 
6±0.6 
8±0.2 
6±0.9 
Р7 
11±0.4 </p>
      </sec>
      <sec id="sec-1-4">
        <title>NONE </title>
        <p>8±0.5 </p>
      </sec>
      <sec id="sec-1-5">
        <title>NONE </title>
        <p>10±0.9 
8±0.1 
8±0.9 
11±0.4 </p>
      </sec>
      <sec id="sec-1-6">
        <title>NONE  10±0.9 </title>
        <p>In this case, the interval length for each parameter is 5 units, for example, for parameter P1 [1;6).</p>
        <p>The sensors read all parameters values for the input object and there was an unambiguous</p>
        <sec id="sec-1-6-1">
          <title>The following results obtained: identification:</title>
          <p>New object:
1.6 2.9 4.2 4.7 5.3 8.5 8.4
Search object:
New object:
4.9 3.3 4.5 7.9 5.2 6.5 11.7
Search object:</p>
          <p>Object absent!
information space.
IO 00603 1±0.6 2±0.6 4±0.6 4±0.6 5±0.6 8±0.4 8±0.5</p>
          <p>The sensors read all parameters values of the input object and did not identify it, it means that no
information objects corresponding to the following input object was found in the information space:
In this case, the input object considered as a new information object and it can be added to the
Object absent!
5. The sensors did not get the value of one or more parameters and after the interaction of the
information objects between themselves in the information space it was found that this object did not
have this parameter (NONE).</p>
          <p>New object:
2.7 4.7 4.1 8.3 5.5 Null 7.6
Search object:
IO 12602 2±0.5 4±0.4 4±0.3 8±0.7 5±0.8 10±0.9 7±0.8
ReCreateObject:
2.7 4.7 4.1 8.3 5.5 Null 7.6
ReCreateObject:
2.7 4.7 4.1 8.3 5.5 Null 7.6
ReCreateObject:
2.7 4.7 4.1 8.3 5.5 None 7.6
Search object:
Object absent!</p>
          <p>The integrated results of the experiments allow us to draw conclusion about the effectiveness of the
input objects search in the information space for 7 parameters of information object and the length of
the interval of 5 units. They are presented in Table 2.</p>
          <p>Table 2 shows the low level of the efficiency of input objects search in the information space for 7
parameters and for interval length of 5 units.</p>
          <p>Next, we reduced the number of parameters that describe the information object, and with the same
initial data to repeat the similar experiments with the number of parameters from 4 to 6. The results of
the experiments are presented in Table 3.</p>
          <p>Table 3 shows the 100% probability for the input object identification in the information space for
4 parameters and the length of the interval of 5 units, i.e. there is no need to reduce the number of
parameters. We design a graph on the data from Tables 2 and 3 in order to compare the efficiency of
search of input objects in the information space for an interval length of 5 units and the number of
parameters from 4 to 7 (Fig. 3).
Figure 3: Graph of comparison of efficiency of input objects search in information space for interval 
length of 5 units and number of parameters from 4 to 7 
Table 4 
The efficiency of input objects search in information space for 7 parameters and interval length from </p>
        </sec>
      </sec>
      <sec id="sec-1-7">
        <title>3 to 5 units </title>
        <p>Probability that the parameter will not be read by 
sensors (NULL),% </p>
        <p>We may conclude that increasing the length of the interval results in a strong decrease in the
efficiency of input objects search in the information space. We design graph on the data in Table 4 in
order to compare the efficiency of search of input objects in the information space for 7 parameters and
the interval length from 3 to 5 units (Fig. 4).
Probability that the parameter will not be read by sensors (NULL),%
3
4
5
Figure  4:  Graph  of  comparison  of  efficiency  of  input  objects  search  in  information  space  for  7 
parameters and interval length from 3 to 5 units 
Table 5 
Efficiency of input objects search in information space for 7 to 10 parameters and interval length of 3 
units </p>
        <p>We design a graph on the data in Table 5 in order to compare the efficiency of search of input objects
in the information space for 7 to 10 parameters and the interval length of 3 units (Fig. 5).
100
%
tce 90
,
j
tob 80
u
inp 70
e
tfh 60
o
ion 50
t
a
iifc 40
t
ied 30
n
f
oy 20
t
i
iab 10
l
b
roP 0
5
10
15
20
25
Probability that the parameter will not be read by sensors (NULL),%
7
8
9
10
Figure 5: Graph of comparison of efficiency of input objects search in information space for 7 to 10 
parameters and interval length of 3 units 
5. Comparison of the results obtained by machine learning and experimental 
data </p>
        <p>The adequacy of the suggested method for input objects identification in the information space was
checked using machine learning methods.</p>
        <p>The multivariate logistic regression using the LogisticRegression class from the Scikit-Learn library
was used to identify information objects. By default, it applies a one-on-one strategy for more than two
classes.</p>
        <p>To switch to multivariate logistic regression, the multi_class hyperparameter is set to “multinomial”
and the lbfgs solver is selected.</p>
        <p>By default, we apply applied  regularization, which can be controlled with the hyperparameter  .</p>
        <p>X = info_data [“InformationObject”] # prepared parameters vectors for information objects
Y = info_data [“IdentifiedObject”]
softamx_reg = LogisticRegression (multi_class = “multinomial”, solver = “lbfgs”, C = 10)
softmax_reg.fit (X, Y)</p>
        <p>
          This method was applied, for example, for the input object with the parameters [
          <xref ref-type="bibr" rid="ref19 ref2 ref26 ref3">2,3 4,6 4,2 5,4 9,1
8,1</xref>
          ] and the following information object was obtained with a probability of 94.2%:
IO 04011 2±0.4 4±0.7 4±0.2 5±0.5 9±0.4 9±0.9 8±0.4
        </p>
        <p>Thus, we can conclude that the results obtained with the suggested method of input objects
identification in the information space are confirmed by the corresponding results obtained with the
machine learning method.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>6. Conclusion </title>
      <p>We develop an algorithm for the information space formation on the information system, which is
actually a software basis for maintaining the information space. Identification of the input object in the
information space allow us uniquely identify it by the appropriate parameters. To do this, we suggest
the method of identification based on step-by-step analysis of the object parameters.</p>
    </sec>
    <sec id="sec-3">
      <title>References </title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          4. Simulation 
          <article-title>of  identification  process  for  input  objects  in  the  information </article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J.</given-names>
            <surname>Guo</surname>
          </string-name>
          , “
          <article-title>Mapping discovery modeling and its empirical research for the scientific and technological knowledge concept in unified concept space</article-title>
          ,
          <source>” Cluster Computing</source>
          ,
          <year>2015</year>
          , vol.
          <volume>18</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>103</fpage>
          -
          <lpage>112</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10586-013-0339-7
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yakovis</surname>
          </string-name>
          , “
          <article-title>From unified information space to unified manufacturing control,” Automation</article-title>
          and
          <string-name>
            <given-names>Remote</given-names>
            <surname>Control</surname>
          </string-name>
          ,
          <year>2016</year>
          , vol.
          <volume>77</volume>
          (
          <issue>9</issue>
          ), pp.
          <fpage>1689</fpage>
          -
          <lpage>1698</lpage>
          . doi:
          <volume>10</volume>
          .1134/S0005117916090150
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.A.</given-names>
            <surname>Karin</surname>
          </string-name>
          , “
          <article-title>Integration in a single information space of diverse geospatial data,” Informatsionnoupravlyayushchiye sistemy</article-title>
          ,
          <year>2012</year>
          , vol.
          <volume>2</volume>
          (
          <issue>57</issue>
          ), pp.
          <fpage>89</fpage>
          -
          <lpage>94</lpage>
          . URL: http://www.ius.ru/index.php/ius/article/view/13797
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Ozhereleva</surname>
            <given-names>T.A.</given-names>
          </string-name>
          <article-title>On the relationship of the concepts information space, information field, information environment and semantic environment</article-title>
          .
          <source>International Journal of Applied and Fundamental Research</source>
          , Vol.
          <volume>10</volume>
          , N 2/
          <year>2014</year>
          . P.
          <volume>21</volume>
          -
          <fpage>24</fpage>
          . [in Russian] URL: https://appliedresearch.ru/ru/article/view?id=
          <fpage>5989</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Tsvetkov</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Ya</surname>
          </string-name>
          .
          <article-title>Information field and information space</article-title>
          .
          <source>International Journal of Applied and Fundamental Research</source>
          , Vol.
          <volume>1</volume>
          , N 3/
          <year>2016</year>
          . 455 p. [in Russian] URL: https://appliedresearch.ru/ru/article/view?id=
          <fpage>8536</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.V.</given-names>
            <surname>Vincent</surname>
          </string-name>
          , “
          <article-title>Development of a model of a single information space to assess the reliability of its operation</article-title>
          ,
          <source>” Proceedings of the Kola Scientific Center of the Russian Academy of Sciences</source>
          ,
          <year>2011</year>
          , vol.
          <volume>7</volume>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>70</lpage>
          . URL: https://cyberleninka.ru/article/n/razrabotka
          <article-title>-modeli-edinogoinformatsionnogo-prostranstva-dlya-otsenki-nadezhnosti-ego-funktsionirovaniya</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mayorov</surname>
          </string-name>
          , “
          <article-title>Information objects in the information field</article-title>
          ,
          <source>” Educational Resources and Technologies</source>
          ,
          <year>2015</year>
          , vol.
          <volume>1</volume>
          (
          <issue>9</issue>
          ), pp.
          <fpage>66</fpage>
          -
          <lpage>73</lpage>
          . URL: https://vestnikmuiv.ru/en/article/informatsionnye-obekty
          <article-title>-v-informatsionnom-pole/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.V.</given-names>
            <surname>Yakushenko</surname>
          </string-name>
          , “
          <article-title>Unified information space: theoretical approaches to the content of the concept</article-title>
          ,
          <source>” Belarus and world economic processes: Sat. scientific Art</source>
          ,
          <year>2014</year>
          , vol.
          <volume>11</volume>
          , p.
          <fpage>13</fpage>
          -
          <lpage>20</lpage>
          . URL: https://elib.bsu.by/bitstream/123456789/134114/1/13-
          <fpage>20</fpage>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>V.</given-names>
            <surname>Ya</surname>
          </string-name>
          . Tsvetkov, “Information interaction”,
          <source>European Researcher</source>
          ,
          <year>2013</year>
          , vol.
          <volume>62</volume>
          , no.
          <issue>11-1</issue>
          , pp.
          <fpage>2573</fpage>
          -
          <lpage>2577</lpage>
          . URL: http://www.erjournal.ru/journals_n/1386019866.pdf
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Komaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Herasymenko</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          , “
          <source>Social Risk Assessment Mechanism Based on the Neural Networks,” IEEE International Conference on Advanced Trends in Information Theory</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>179</fpage>
          -
          <lpage>182</lpage>
          . doi:
          <volume>10</volume>
          .1109/ATIT49449.
          <year>2019</year>
          .9030519
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhenbing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          , Ya. Kornaga, and
          <string-name>
            <given-names>O.</given-names>
            <surname>Herasymenko</surname>
          </string-name>
          , “
          <article-title>Resource Management in a Distributed Computer System with Allowance for the Level of Trust to Computational Components”</article-title>
          ,
          <source>Cybernetics and Systems Analysis</source>
          ,
          <year>2017</year>
          , vol.
          <volume>53</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>312</fpage>
          -
          <lpage>322</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10559-017-9931-9
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Krylov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rybalochka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Belous</surname>
          </string-name>
          , “
          <article-title>Devising a method to identify an incoming object based on the combination of unified information spaces</article-title>
          ,
          <source>” Eastern-European Journal of Enterprise Technologies</source>
          ,
          <year>2021</year>
          , vol.
          <volume>3</volume>
          , no.
          <volume>2</volume>
          (
          <issue>111</issue>
          ), pp.
          <fpage>35</fpage>
          -
          <lpage>44</lpage>
          . doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2021</year>
          .229568
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gershkovich</surname>
          </string-name>
          , and T. Biryukova, “
          <article-title>Problems of Identification of Information Objects in Distributed Data Arrays,” Systems and Means of Inform</article-title>
          .,
          <year>2014</year>
          , vol.
          <volume>24</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>224</fpage>
          -
          <lpage>243</lpage>
          . doi:
          <volume>10</volume>
          .14357/08696527140114
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          , L. Liu, N. Liu,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Zhang, and S. Feng, “
          <article-title>A multi-label text classification method via dynamic semantic representation model and deep neural network</article-title>
          ,
          <source>” Applied Intelligence</source>
          ,
          <year>2020</year>
          , vol.
          <volume>50</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>2339</fpage>
          -
          <lpage>2351</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10489-020-01680-w
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Pan</surname>
          </string-name>
          , G. Hu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Shao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Pan</surname>
          </string-name>
          , “
          <article-title>FLGAI: a unified network embedding framework integrating multi-scale network structures and node attribute information</article-title>
          ,
          <source>” Applied Intelligence</source>
          ,
          <year>2020</year>
          , vol.
          <volume>50</volume>
          (
          <issue>11</issue>
          ), pp.
          <fpage>3976</fpage>
          -
          <lpage>3989</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10489-020-01780-7
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>WD</given-names>
            <surname>Yu</surname>
          </string-name>
          , ST Cheng,
          <article-title>CM Wu, and HR Lou, “A self-evolutionary model for automated innovation of construction technologies</article-title>
          ,” Automation in Construction,
          <year>2012</year>
          , vol.
          <volume>27</volume>
          , pp.
          <fpage>78</fpage>
          -
          <lpage>88</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.autcon.
          <year>2012</year>
          .
          <volume>04</volume>
          .018
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Nagpal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Uddin</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Kaur</surname>
          </string-name>
          , “
          <article-title>A Comparative Study of Estimation by Analogy using Data Mining Techniques,”</article-title>
          <string-name>
            <surname>JIPS</surname>
          </string-name>
          ,
          <year>2012</year>
          , vol.
          <volume>8</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>621</fpage>
          -
          <lpage>652</lpage>
          . doi:
          <volume>10</volume>
          .3745/JIPS.
          <year>2012</year>
          .
          <volume>8</volume>
          .4.
          <fpage>621</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Arenas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>BC</given-names>
            <surname>Grau</surname>
          </string-name>
          , E. Kharlamov,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marciuska</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Zheleznyakov</surname>
          </string-name>
          , “
          <article-title>Enabling Faceted Search over OWL 2 with SemFacet</article-title>
          ,”
          <string-name>
            <surname>In</surname>
            <given-names>OWLED</given-names>
          </string-name>
          ,
          <year>2014</year>
          , pp.
          <fpage>121</fpage>
          -
          <lpage>132</lpage>
          . URL: https://marceloarenas.cl/publications/owled2014.pdf
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Teraoka</surname>
          </string-name>
          , “
          <article-title>Organization and exploration of heterogeneous personal data collected in daily life,” Human-Centric Computing</article-title>
          and
          <string-name>
            <given-names>Information</given-names>
            <surname>Sciences</surname>
          </string-name>
          ,
          <year>2012</year>
          , vol.
          <volume>2</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          . doi:
          <volume>10</volume>
          .1186/
          <fpage>2192</fpage>
          -1962-2-1
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>RJ</given-names>
            <surname>Little</surname>
          </string-name>
          , and DB Rubin, “
          <article-title>Statistical analysis with missing data”</article-title>
          ,
          <year>2019</year>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          793. John Wiley &amp; Sons. doi:
          <volume>10</volume>
          .1002/9781119482260
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [21] T. Cheng, HW Lauw, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Paparizos</surname>
          </string-name>
          , “
          <article-title>Entity synonyms for structured web searc,” IEEE transactions on knowledge and data engineering</article-title>
          ,
          <year>2011</year>
          , vol.
          <volume>24</volume>
          (
          <issue>10</issue>
          ), pp.
          <fpage>1862</fpage>
          -
          <lpage>1875</lpage>
          . doi:
          <volume>10</volume>
          .1109/TKDE.
          <year>2011</year>
          .168
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>P.</given-names>
            <surname>Zuiev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhyvotovskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Zvieriev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hatsenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kuprii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Nakonechnyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Adamenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shyshatskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Neroznak</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Velychko</surname>
          </string-name>
          , “
          <article-title>Development of a complex methodology for processing various types of data in intellectual systems to support decision-making,”</article-title>
          <source>EasternEuropean Journal of Enterprise Technologies</source>
          ,
          <year>2020</year>
          , vol.
          <volume>4</volume>
          , no.
          <volume>9</volume>
          (
          <issue>106</issue>
          ), pp.
          <fpage>14</fpage>
          -
          <lpage>23</lpage>
          . doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2020</year>
          .208554
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Barabash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mykolaichuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Statkevych</surname>
          </string-name>
          , “
          <article-title>Method of Restoring Parameters of Information Objects in a Unified Information Space Based on Computer Networks</article-title>
          ,”
          <source>International Journal of Computer Network and Information Security</source>
          ,
          <year>2020</year>
          , vol.
          <volume>12</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>11</fpage>
          -
          <lpage>21</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijcnis.
          <year>2020</year>
          .
          <volume>02</volume>
          .02
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Arenas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>BC</given-names>
            <surname>Grau</surname>
          </string-name>
          , E. Kharlamov, Š. Marciuška, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Zheleznyakov</surname>
          </string-name>
          , “
          <article-title>Faceted search over RDF-based knowledge graphs</article-title>
          ,
          <source>” Journal of Web Semantics</source>
          ,
          <year>2016</year>
          , vol.
          <volume>37</volume>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>74</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.websem.
          <year>2015</year>
          .
          <volume>12</volume>
          .002
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>BC</given-names>
            <surname>Grau</surname>
          </string-name>
          , E. Kharlamov,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marciuska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zheleznyakov</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Arenas</surname>
          </string-name>
          , “
          <article-title>SemFacet: Faceted Search over Ontology Enhanced Knowledge Graphs</article-title>
          ,” International Semantic Web Conference,
          <year>2016</year>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1690</volume>
          /paper75.pdf
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferré</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Hermann, “
          <article-title>Semantic search: Reconciling expressive querying and exploratory search</article-title>
          . In International semantic Web conference, Springer, Berlin, Heidelberg,
          <year>2011</year>
          , pp.
          <fpage>177</fpage>
          -
          <lpage>192</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -25073-6_
          <fpage>12</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dodonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          , Ya. Kornaga,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          , “
          <article-title>Method of searching for information objects in unified information spac</article-title>
          ,
          <source>” Systemresearch and information technologies</source>
          ,
          <year>2021</year>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>34</fpage>
          -
          <lpage>46</lpage>
          . doi:
          <volume>10</volume>
          .20535/SRIT.2308-
          <fpage>8893</fpage>
          .
          <year>2021</year>
          .
          <volume>1</volume>
          .
          <fpage>03</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>A.N.</given-names>
            <surname>Logunov</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.L.</given-names>
            <surname>Logunova</surname>
          </string-name>
          , “
          <article-title>Choice of recognition attributes when searching hidden objects,” Eastern-</article-title>
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2012</year>
          , vol.
          <volume>5</volume>
          , no.
          <volume>9</volume>
          (
          <issue>59</issue>
          ), pp.
          <fpage>21</fpage>
          -
          <lpage>25</lpage>
          . doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2012</year>
          .4622
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dodonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          , “
          <article-title>Method of Parallel Information Object Search in Unified Information Spaces</article-title>
          ,”
          <source>International Journal of Computer Network &amp; Information Security</source>
          ,
          <year>2021</year>
          , vol.
          <volume>13</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijcnis.
          <year>2021</year>
          .
          <volume>04</volume>
          .01
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferré</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Hermann, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ducassé</surname>
          </string-name>
          , “
          <article-title>Semantic faceted search: Safe and expressive navigation in RDF graphs</article-title>
          ,
          <source>” [Research Report] PI</source>
          <year>1964</year>
          ,
          <year>2011</year>
          , pp.
          <fpage>27</fpage>
          . URL: https://hal.inria.fr/inria-00554093
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>