<!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>resources of an electronic archive</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vadim Moshkin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>The Bonch-Bruevich Saint - Petersburg</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>St. Petersburg</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Russia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>St. Petersburg</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Russia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lukashevich N.V.</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dobrov B.V.</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Smirnov S. V.</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guarino</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Systems department</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>State University of Telecommunication</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>The Bonch-Bruevich Saint - Petersburg</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Ulyanovsk State Technical University</institution>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Ulyanovsk</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <issue>15</issue>
      <fpage>44</fpage>
      <lpage>49</lpage>
      <abstract>
        <p>-This paper presents an ontological model of a the the text document as an electronic archive resource. The article also presents an ontology-based algorithm for the classification technical documents.</p>
      </abstract>
      <kwd-group>
        <kwd>ontology</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>INTRODUCTION</p>
      <p>The task of categorizing text documents to simplify the
search
for information in
an electronic
archive
of an
organization is
more relevant than ever. In
most cases,
archiving is structured</p>
      <p>manually by archive specialists.</p>
      <p>Specialists should have knowledge in the subject area and
take into account the specifics of the stored documentation.</p>
      <p>Automation of categorization of the archive of electronic
text documents should be carried out taking into account the
semantics of information in the documents. Otherwise, the
experience of highly qualified specialists developing this
documentation will be difficult to extract from unstructured
resources for further use.</p>
      <p>Currently, researchers offer various ways to solve this
problem. In [1], the ant colony classification algorithm is
used to classify data and is used to quickly search for large
amounts of data from intelligent archives.</p>
      <p>Characteristics of a text document are taken into account
during its analysis and processing and are included in the
document model.</p>
      <p>The extended Boolean model of the document does not
represent terms with values of 0, 1, but with weighting
coefficients using the theory of fuzzy sets [2-5]. In this case,
the value of the weight coefficient is determined from the
interval [0, 1], thus we obtain that 
∈ [0, 1] .</p>
      <p>The vector model formally presents text documents as a
matrix of terms and documents [6]:</p>
      <p>= | |×| |,
where  = { 1, . . . ,   ,. . . ,   }; 
= { 1,. . . ,   ,. . . ,   },
  is a vector in the  -dimensional space   .</p>
      <p>
        In [7] [8], the authors present an ontology designed to
model archival descriptions
of collections of historical
documents. In [9], the authors present aspects of the current
activities of the digital library related to the Semantic Web
and present their functionality. They show examples ranging
from general architectural descriptions to the detailed use of
specific ontologies. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], a semantic search portal is
proposed for intercultural archives, including documents,
images, audio and video.
      </p>
      <p>One of the solutions to this problem is the use of
intelligent algorithms for the analysis of text documents with
the division of the archive into classes in accordance with the
semantics of the subject area. The semantics of the subject
area</p>
      <p>will be concluded in the subject ontology, formed
through the analysis of textual documentation.</p>
      <p>
        Domestic and foreign researchers (Gavrilova T.A. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
Zagorulko Yu.A. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], Khoroshevsky V.F., Soloviev V.D.,
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Uschold M. et al.) note the relevance of applying the
ontological approach to the automatic structuring of large
text archives using the ontological approach and extracting
the semantic basis of project documentation.
      </p>
      <p>II.</p>
      <p>
        MODELS OF APPLIED ONTOLOGY OF TEXT DOCUMENTS
The construction of an ontology in the classification of
documents in electronic archives is necessary to take into
account the characteristics of the subject area and to increase
the speed of document search. Ontology defines a semantic
scale that defines whether a document belongs to one class
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] [15].
      </p>
      <p>Thus, the formal model of applied ontology of the
electronic archive of project documentation is:
 
= ⟨ ,  
, 
,  ⟩,
where  is the set of terms of design documentation for an
electronic archive;</p>
      <p>is a set of terms of a problem area;</p>
      <p>is a set of ontology relationships. Many relationships
include the following:

= {  ,  
,  
},
where   is the hierarchy relation;  
whole relationship;  
is an association relation.</p>
      <p>is a
part-to</p>
      <p>Formally the set of terms of design documentation for an
electronic archive is:
 = (  1 ∪   2 ∪ … ∪    ) ∪  
is a set of terms of the problem area extracted
from the documents of the electronic archive.</p>
      <p>Formally, the functions of interpretation of the subject
where    ,  = 1, 
area;  
ontology are:
where   
 : { 
 = {  
 ,</p>
      <p>},
} → { } is an interpretation function
that defines the correspondence between the terms of the
problem area and the terms of the design documentation of
the
electronic
archive;   
  : { 
} → {  } is
an
interpretation function that defines the correspondence
between the terms of the problem domain extracted from
electronic archive documents and the terms of the problem
domain.</p>
      <p>The main in the ontology of the electronic archive is the
relation
"associate_with".</p>
    </sec>
    <sec id="sec-2">
      <title>This relation determines the</title>
      <p>subject area to which the project document of the electronic
archive belongs and determines the subject of the document.
Copyright © 2020 for this paper by its authors.</p>
      <p>The characteristic of the weight of the term   in a text
document is the frequency of the i-th term in the document.
Hence, the following patterns are relevant:
  .
document d; n is a measure of the power of the text input of


high-frequency terms in a document are system-wide;
terms with a low frequency in a particular document
do not provide an improvement in the quality of
search for documents in the archive.</p>
      <p>The most indicative are terms that have an average
frequency of occurrence in a document, but most fully
characterize a document in a problem area [16, 17].</p>
      <p>If the frequency of occurrence of one term is significantly
higher in the document than the frequency of its occurrence
in all analyzed documents of the electronic archive, then this
term is semantically significant. Formally, this rule is

 =    ⋅ 
(
) ,
where   is an indicator of the semantic significance of the
term 
 in this document; 
is the total number of all
documents in the electronic archive;    is the value of the
index of the normalized frequency of the term   ; 
the total number of documents containing the term  .

(  ) is</p>
      <p>Thus, the ontological model of an electronic archive
document is:
 

= ⟨ 
,   ⟩,
where</p>
      <p>,   is the set of terms of the problem area of the
j-th document of the electronic archive.</p>
    </sec>
    <sec id="sec-3">
      <title>Hence</title>
      <p>_</p>
      <p>ℎ( ,   ) = 1.</p>
      <p>This equality assumes that the document  is mapped
into the space of terms  ,  2, … ,   .. If  
the document  , then the set of terms of the document  can IV.
 is the  -th term of
be represented as follows:</p>
      <p>= { 1 ,  2 , … ,   },
where n is the total number of terms in the document d.</p>
      <p>III.</p>
      <p>THE ONTOLOGICAL INDEX MODEL</p>
      <p>The ontological indexing algorithm for text documents of
the electronic archive is shown in Figure 1.</p>
      <p>The degree of semantic significance of an electronic
ontology term is the value of coincidence of the term context
environment with the set of terms of the electronic archive
document. Contextual environment is composed of terms
that are semantically close to the analyzed concept of a
problem area [19].</p>
      <p>Hence the formally semantic index of the i-th document
is:
{( 1 ,  1), ( 2 ,  2), … , (  ,   ), … , ( 
 ,   )},
where l is the total number of terms in the i-th document of
the electronic archive after text preprocessing.</p>
      <p>The degree of expression of the concept   in the i-th
document d will be calculated as follows:
μ(  ) = 1 −

1 ∑|  −   |,
where   ,   are indicators of the frequency of the term   in
the description of the k-th term of the ontology in the
, 
ℎ = [0.7 … 1.0],
= [0.5 … 0.7),
= [0 … 0.5),
where   is the n-th class of documents (classification
basis);
  is the k-th concept of ontology; m is the linguistic label.</p>
      <p>At the second step, the degree of belonging of the
document d to each class   is calculated
using the
following expression:
 =1</p>
      <p>0
 (  ) =  − ∑(1 −   ),
where k is the number of parameters of the class   ;   is a
sign of a document matching the d -th property of the class
  , which is calculated using the following expression:
  = {
1,   ∈  , μ(  ) ∈ 
.</p>
      <p>Thus, the document d corresponds to the characteristic
  if it contains concepts characterizing the given attribute
and its degree of expression is included in the interval of the
linguistic label.
conducted to assess the quality of the classification of
documents in the electronic archive of the Federal Scientific</p>
    </sec>
    <sec id="sec-4">
      <title>Production Center JSC</title>
      <p>Mars. JSC</p>
      <p>Mars is an organization
engaged in the design, development and
maintenance of
automated systems, software and hardware for the Russian</p>
      <p>For the experiments the following sets of documents
Navy.
were selected:





technical specifications;
patent research reports;
specifications;
testing programs and techniques;
programmer,
manuals.</p>
      <p>user,
system
administrator,
1037
design
documents
were
selected
for
experiments. Figure 2 shows the signs of expert dividing
documents into classes according to certain criteria.
etc.
the
term.
of:
1)
2)
3)
4)
conducted to select the preferred method for defining the</p>
      <p>The test set consisted of a public data set containing
about 10,000 tweets. Each tweet contains a text describing
either a disaster or some other information. Each tweet has a
label that determines whether the tweet belongs to the “
disaster” or “other” class.</p>
      <p>The first step is data preprocessing. Pretreatment consists</p>
    </sec>
    <sec id="sec-5">
      <title>Delete stop words.</title>
      <p>Tokenization according to words - splitting the
analyzed text into separate words.</p>
    </sec>
    <sec id="sec-6">
      <title>Bringing the register.</title>
    </sec>
    <sec id="sec-7">
      <title>Lemmatization.</title>
      <p>At the second step, many indices of the analyzed poorly
structured information resources were erased, which were
based on the following</p>
      <p>models of information resource
representation: a word bag (Fig. 3), a statistical model based
on</p>
      <p>TF-IDF (Fig. 4), and a linguistic
model based on</p>
    </sec>
    <sec id="sec-8">
      <title>Word2Vec (Fig. 5).</title>
      <p>The following assessments of the classification quality
were obtained: “Bag of words” - 62.23%, “TF-IDF”
74.78%, “Word2Vec” - 81.7%.</p>
      <p>Thus, the linguistic model will be the best method for
defining the terms of a semi-structured information resource.
However, it is recommended to use a statistical model if low
computational complexity of the algorithm and high speed of
operation are required.</p>
      <p>An ontological set of document indixes and classic
indexes, which include the term-frequency values, were
built. The classification quality assessment model from [20]
was used as an evaluation function. The results of the
experiments are presented in figures 6 and 7.</p>
      <p>As can be seen from the results of the experiments, the
classification of ontological representations is faster (up to
27 times) relative to the classification time of classical
indices.</p>
      <p>The quality of classification of ontological
representations in comparison with the results of
classification of classical indices is slightly worse only when
divided by the class of documentation. When dividing a
multitude of documents by type of documentation, section of
documentation and subject of work, the quality of
classification of ontological representations is higher than
that of classical indices.</p>
    </sec>
    <sec id="sec-9">
      <title>CONCLUSION</title>
      <p>Thus, an ontological model of a text document as an
electronic archive resource and an ontologically oriented
algorithm for the classification of technical documents is
proposed. As can be seen from the results of the experiments,
the formation of the ontological presentation of each
individual document in the archive can significantly increase
the speed of automatic classification of documents (up to 27
times) while maintaining or slightly improving the quality of
classification.</p>
      <p>In future works, it is planned to introduce fuzzy elements
in the ontological representation of project documents.</p>
    </sec>
    <sec id="sec-10">
      <title>ACKNOWLEDGMENT</title>
      <p>This paper has been approved within the framework of
the federal target project “R&amp;D for Priority Areas of the
Russian Science-and-Technology Complex Development for
2014-2020”, government contract No 05.604.21.0252 on the
subject “The development and research of models, methods
and algorithms for classifying large semistructured data
based on hybridization of semantic-ontological analysis and
machine learning”.
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]</p>
      <p>Addison-Wesley</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>W.</given-names>
            <surname>Yong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Liming</surname>
          </string-name>
          and
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yongsheng</surname>
          </string-name>
          , “
          <article-title>Improvement of big data retrieval algorithm in the intelligent archives management</article-title>
          ,
          <source>” 12th IEEE International Conference on Electronic Measurement &amp; Instruments (ICEMI)</source>
          , pp.
          <fpage>487</fpage>
          -
          <lpage>491</lpage>
          ,
          <year>2015</year>
          . DOI:
          <volume>10</volume>
          .1109/ ICEMI.
          <year>2015</year>
          .
          <volume>7494245</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>R.</given-names>
            <surname>Baeza-Yates</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Ribeiro-Neto</surname>
          </string-name>
          , “Modern Information Rertieval,” ACM Press, New York,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>K.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Schütze</surname>
          </string-name>
          , “Introduction to the Information Search,” M.:
          <string-name>
            <surname>LLC “I.D. Williams</surname>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Song</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Bruce</surname>
          </string-name>
          , “
          <article-title>A general language model for information retrieval (poster abstract</article-title>
          ),
          <source>” Research and Development in Information Retrieval</source>
          , pp.
          <fpage>279</fpage>
          -
          <lpage>280</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>E.M. Voorhees</surname>
          </string-name>
          , “
          <article-title>Natural language processing</article-title>
          and information retrieval,” Information Extraction: Towards Scalable,
          <source>Adaptable Systems</source>
          , pp.
          <fpage>32</fpage>
          -
          <lpage>48</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>G.</given-names>
            <surname>Salton</surname>
          </string-name>
          , “Automatic Text Processing,” Publishing Company, Inc., Reading, MA,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>L.</given-names>
            <surname>Pandolfo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pulina</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zielinski</surname>
          </string-name>
          , “
          <article-title>Towards an Ontology for Describing Archival Resources</article-title>
          ,”
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>L.</given-names>
            <surname>Pandolfo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pulina</surname>
          </string-name>
          and G. Adorni, “
          <article-title>A framework for automatic population of ontology-based digital libraries</article-title>
          ,
          <source>” Advances in Artificial Intelligence</source>
          , pp.
          <fpage>406</fpage>
          -
          <lpage>417</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Kruk</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>McDaniel</surname>
          </string-name>
          , “
          <article-title>Semantic digital libraries</article-title>
          ,” Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scharffe</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          , “
          <article-title>Semantic Search on Cross-Media Cultural Archives,” Advances in Intelligent Web Mastering</article-title>
          .
          <source>Advances in Soft Computing</source>
          , vol
          <volume>43</volume>
          , pp.
          <fpage>375</fpage>
          -
          <lpage>380</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Yu. Zagorulko</surname>
            ,
            <given-names>I.S.</given-names>
          </string-name>
          <string-name>
            <surname>Kononenko</surname>
            and
            <given-names>E.A.</given-names>
          </string-name>
          <string-name>
            <surname>Sidorova</surname>
          </string-name>
          , “
          <article-title>Semantic approach to the analysis of documents based on the ontology of the subject area</article-title>
          ,
          <source>” International Conference on Computational Linguistics and Intellectual Technologies Dialogue</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.A.</given-names>
            <surname>Gavrilova</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.F.</given-names>
            <surname>Khoroshevsky</surname>
          </string-name>
          , “
          <article-title>Knowledge Base of Intelligent Systems</article-title>
          ,” St. Petersburg: Peter,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hashemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brady</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Casanave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Graves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Grüninger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Levenchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Lucier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Obrst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sriram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vizedom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>West</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Whetzel</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Yim</surname>
          </string-name>
          , “
          <article-title>Ontology for Big Systems,” The Ontology Summit Communiqué</article-title>
          .
          <source>Applied Ontology</source>
          , vol.
          <volume>7</volume>
          , pp.
          <fpage>357</fpage>
          -
          <lpage>371</lpage>
          ,
          <year>2012</year>
          . DOI:
          <volume>10</volume>
          .3233/AO-2012-0111.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Serrano-Guerrero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.A.</given-names>
            <surname>Olivas</surname>
          </string-name>
          , J. de la Mata and
          <string-name>
            <given-names>P.</given-names>
            <surname>Garces</surname>
          </string-name>
          , “Physical and Semantic Relations to Build Ontologies for [15]
          <string-name>
            <surname>Representing</surname>
            <given-names>Documents</given-names>
          </string-name>
          ,” Fuzzy logic,
          <source>Soft Computing and Computational Intelligence (Eleventh International Fuzzy Systems Association World Congress IFSA)</source>
          , Beijing, China, Tsinghua University Press, vol. I, pp.
          <fpage>503</fpage>
          -
          <lpage>508</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Yu.V.</given-names>
            <surname>Vizilter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.S.</given-names>
            <surname>Gorbatsevich</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.Y.</given-names>
            <surname>Zheltov</surname>
          </string-name>
          , “
          <article-title>Structurefunctional analysis and synthesis of deep convolutional neural networks</article-title>
          ,
          <source>” Computer Optics</source>
          , vol.
          <volume>43</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>886</fpage>
          -
          <lpage>900</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2019-43-5-
          <fpage>886</fpage>
          -900.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>N.</given-names>
            <surname>Yarushkina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Filippov</surname>
          </string-name>
          , “
          <article-title>Development of a knowledge base based on context analysis of external information resources</article-title>
          ,
          <source>” Proceedings of the International conference Information Technology and Nanotechnology. Session Data Science</source>
          , Samara, Russia, pp.
          <fpage>328</fpage>
          -
          <lpage>337</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Namestnikov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Filippov</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Avvakumova</surname>
          </string-name>
          ,
          <source>“An OntologyBased Model of Technical Documentation Fuzzy Structuring,” 2nd International Workshop on Soft Computing Applications and Knowledge Discovery (SCAKD)</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18] [19]
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Yarushkina</surname>
          </string-name>
          , “
          <article-title>Modified Knowledge Inference Method Based on Fuzzy Ontology and Base of Cases,” Creativity in Intelligent Technologies and Data Science</article-title>
          , pp.
          <fpage>96</fpage>
          -
          <lpage>108</lpage>
          ,
          <year>2019</year>
          . DOI:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -29750-
          <issue>3</issue>
          _
          <fpage>8</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>