<!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>Using Hybrid Algorithms Based on GMDH-Type Neural Networks for Solving Economic Problems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Olha Moroz</string-name>
          <email>olga_moroz@irtc.org.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Key Terms. MachineIntelligence, Model, Computation, BioInspiredApproach</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>International Research and Training Centre of Information Technologies and Systems of NAS and MES of Ukraine</institution>
          ,
          <addr-line>Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>21</fpage>
      <lpage>24</lpage>
      <abstract>
        <p>This survey deals with up-to-date results in the field of hybrid algorithms development of GMDH-type Neural Networks (GMDH-NN) and other methods of Artificial Intelligence (AI) which are successfully used for solving complex economic problems. Such hybrid algorithms are now only in its early stage of active research. General characteristics and main weaknesses of GMDH-NN are firstly presented. The paper further gives brief information on some AI paradigms such as Swarm Intelligence and Evolutionary Computation. Then known hybridization cases of GMDH-NN and certain methods of these paradigms (Genetic Algorithms, Differential Evolution, Particle Swarm Optimization, and Genetic Programming) are considered eliminating a number of the networks shortcomings. In the future it is worth to study the most promising ways of GMDH-NN hybridization with other methods of AI in order to increase their efficiency and extend applications.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>GMDH-type Neural Networks</kwd>
        <kwd>Hybridization</kwd>
        <kwd>Particle Swarm Optimization</kwd>
        <kwd>Genetic Algorithms</kwd>
        <kwd>Differential Evolution</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Methods of AI have been used successfully in real-world applications, for example,
predicting, data mining, classification, pattern recognition, knowledge discovery,
system identification, clustering, control etc. However, there are many problems of such
complexity that no method of AI can solve them alone.</p>
      <p>The current trend is in developing composition of AI methods to obtain synergic
effect, or hybridization in other words, since no one method is superior to the others
in all situations. In doing so, methods respectively aim to enhance strengths of the
components of the hybrid system and eliminate weaknesses of individual components.
Due to the possibilities of hybrid systems solve many real problems that are
characterized by inaccuracy, unpredictability, uncertainty, high dimension and variable
environment, they attract much attention. Thus, they can be used to solve problems in a
non-standard and promising way.</p>
      <p>- 559</p>
      <p>The Group Method of Data Handling (GMDH) is a powerful method based on the
principles of self-organization. Basic Multilayered Iterative Algorithm MIA GMDH
is an original Polynomial Neural Network of perceptron type. It should be noted that
research in the field of hybridization GMDH-NN with other methods of AI are now in
its early stage. But the first results of these studies indicate already a strong potential,
high efficiency, diversity of applications of hybrid models. For example, GMDH not
suitable for modeling of multi-output systems, while hybrid one with Multi Objective
Genetic Algorithm is able to solve this problem.</p>
      <p>This survey is aimed to analyzing and structuring typical known approaches to
hybridization of GMDH-NN and AI methods as powerful tool for solving complex
problems of economic modeling as well as determining most expedient ways of
developing research in this field.
2</p>
    </sec>
    <sec id="sec-2">
      <title>GMDH as a Specific Type of Neural Network</title>
      <p>
        The GMDH was developed by Ivakhnenko [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] as a multivariate analysis method for
complex systems modeling and identification. The main idea of GMDH is to build an
analytical function in a feedforward network based on a quadratic node transfer
function whose coefficients are obtained using regression technique. Its structure is very
similar to that of multilayer feedforward neural networks but the numbers of layers as
well as nodes are objectively defined by an external criterion in accordance with the
incompleteness theorem. To compare and select the best model, external criteria are
used based on dividing the sample into two sets (training and testing), that eliminates
the overfitting problem [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>GMDH is ideal for complex, unstructured systems where the investigator is only
interested in obtaining a high-order input-output relationship. Hence this can be
treated as a good data mining tool where data is transformed into knowledge for decision
making. The most pronounced feature of GMDH is that it can choose the really
significant input variables among dozens of these, thus actually reducing the dimension
of a solved problem.</p>
      <p>
        There are two main problems in GMDH-NN modeling such as training parameters
and selection of an optimal topology, which have a great impact on their performance
and encourage searching more efficient methods for their solution. The mathematical
basis for the vast majority of training algorithms for NNs is to utilize gradient
information to adjust the connection weights between nodes in the network. Its use implies
drawbacks such as slow convergence (training) rates, neglected multiple extremum
points, infinitesimally small step sizes (e.g. learning rates), costly computation, no
guarantee that algorithm converges to an optimum point, entrapped in local minimum
points, necessarily imply a least-mean-squared-error criterion, non-differentiability of
many error function [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>Selection of the optimal topology often has the following problems:
 the search space of possible topologies is infinitely large, complex, multimodal,
and not necessarily differentiable;
 there is little reason to expect that Neural Network can find a uniformly best
algorithm for selecting the weights in a feedforward artificial neural network. At
present, neural network design relies heavily on human experts who have sufficient
knowledge about the different aspects of the network and the problem domain;
 as the complexity of the problem domain increases, manual design becomes more
difficult and unmanageable.</p>
      <p>
        Anastasakis and Mort [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] have carried out a comprehensive study of the
shortcomings of GMDH, the most problematic can be stated such as:
 ill-suited to solve complex problems with many inputs, almost equally important;
 uses local methods to find optimal solutions;
 tends to create complex polynomials for relatively simple systems;
 tends to create highly complex networks (models) when it comes essentially
nonlinear systems, limitations due to its overall structure;
 does not objectively evaluate coefficients by least squares;
 has a fixed structure and determined search character for a better model;
 does not effective in addressing the multi-task.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Methods of Evolutionary</title>
    </sec>
    <sec id="sec-4">
      <title>Intelligence Paradigms</title>
    </sec>
    <sec id="sec-5">
      <title>Computation and</title>
    </sec>
    <sec id="sec-6">
      <title>Swarm</title>
      <p>
        Evolutionary Computation [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is a paradigm in the Artificial Intelligence domain
that aims at benefiting from collective phenomena in adaptive populations of problem
solvers utilizing the iterative progress comprising growth, development, reproduction,
selection, and survival as seen in a population. EC are the most well-known, classical
and established algorithms among nature inspired ones based on the biological
evolution in nature that is being responsible for the design of all living beings on Earth, and
for the strategies they use to interact with each other. EC employ this powerful design
philosophy to find solutions of hard problems. EC are nondeterministic or cost based
optimization algorithms.
      </p>
      <p>Usually grouped under the term EC, the domains of Genetic Algorithm (GA),
Genetic Programming (GP), Differential Evolution (DE), Evolutionary Strategy (ES),
Learning Classifier Systems (LCS), Estimation of Distribution Algorithms (EDA) and
most recent Paddy Field Algorithm (PFA) are founded. They all share a common
conceptual base of simulating the evolution of individual structures and they differ in
the way the problem is represented, processes of selection and the
usage/implementation of reproduction operators. The processes depend on the perceived
performance of the individual structures as defined by the problem.</p>
      <p>
        Swarm Intelligence [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] is a collective behavior of decentralized, self-organized
systems, natural or artificial. The term swarm is used for an aggregation of animals such
as fish schools, bird flocks and insect colonies such as ant, termites and bee colonies
performing collective behavior. The individual agents of a swarm behave without
supervision and each of these agents has a stochastic behavior due to her perception in
the neighborhood. Local rules, without any relation to the global pattern, and
interactions between self-organized agents lead to the emergence of collective intelligence
called swarm intelligence.
      </p>
      <p>Swarm Intelligence can be described by considering five fundamental principles.
Proximity Principle: the population should be able to carry out simple space and time
computations. Quality Principle: the population should be able to respond to quality
factors in the environment. Diverse Response Principle: the population should not
commit its activity along excessively narrow channels. Stability Principle: the
population should not change its mode of behavior every time the environment changes.
Adaptability Principle: the population should be able to change its behavior mode
when it is worth the computational price. The most popular Swarm Intelligence
algorithms are Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO),
Artificial Bee Colony Optimization (ABC), Cuckoo Search (CS), Fiery Algorithm
(FA), Intelligent Water Drops (IWD), Gravitational Search Algorithm (GSA) and
Charged System search (CSS).
4</p>
    </sec>
    <sec id="sec-7">
      <title>Hybrids of GMDH-NN with Some Computation Intelligence</title>
    </sec>
    <sec id="sec-8">
      <title>Methods</title>
      <p>
        Hybrid with DE. In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the hybrid of DE and GMDH systems have created and
clearly showed that this structure is superior to the conventional GMDH approach.
The architecture of model is not predefined but can be self-organized automatically
during the design process. The hybrid Differential Evolution and Singular Value
Decomposition is used for simultaneous parametric and structural design of GMDH
networks used for modeling and prediction of various complex models. The DE-GMDH
approach has been applied to the problem of developing predictive model for
toolwear in turning operations; the exchange rate problem; the Box-Jenkins gas furnace
data; with experimental results clearly demonstrating that the proposed
DE-GMDHtype network outperforms the existing models both in terms of better approximations
capabilities as well as generalization abilities.
      </p>
      <p>
        Hybrid with GP. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] GMDH-based approach to Genetic Programming,
which integrates a GP-based adaptive search of tree structures, and a local parameter
tuning mechanism employing statistical search is presented. In traditional GP,
recombination can cause frequent disruption of building blocks or mutation can cause
abrupt changes in the semantics. To overcome these difficulties, traditional GP with a
local hill climbing search using a parameter tuning procedure is supplemented. More
precisely, the structural search of traditional Genetic Programming with a multiple
regression analysis method and establish adaptive program called "STROGANOFF"
(i.e. Structured Representation On GAs for Nonlinear Function Fitting) is integrated.
The fitness evaluation is based on a "Minimum Description Length (MDL)" criterion,
which effectively controls the tree growth in Genetic Programming. Its effectiveness
by solving several system identification (numerical) problems and compare the
performance of STROGANOFF with traditional GP and another standard technique (i.e.
"radial basis functions") is demonstrated. The effectiveness of this numerical
approach to Genetic Programming is demonstrated by successful application to
computational finances.
      </p>
      <p>
        Hybrid with GA. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] a hybrid of GA and GMDH systems have
created which is superior to the conventional GMDH method. These papers present
specific encoding schemes to genetically design GMDH-NNs based on using hybrid GAs
and Singular Value Decomposition to design the coefficients as well as the
connectivity configuration of GMDH-NNs used for modeling and prediction of various
complex models in both single and multi-objective Pareto based optimization processes.
Such generalization of network's topology provides near optimal networks in terms of
hidden layers and/or number of neurons and their connectivity configuration, so that a
polynomial expression for dependent variable of the process can be achieved
consequently.
      </p>
      <p>
        Hybrid with PSO. Such algorithms have been proposed in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. The principal
approach to modeling of PSO-GMDH and traditional GMDH is more or less same. In
PSO the whole population (of constant size) of swarm particles progresses iteratively
until the optimum solution is found. Iterative process of Particle Swarm Optimization
can be compared with layered approach of GMDH where swarm particles search for
better position in each iteration as GMDH nodes look for better solution in each layer.
The proposed hybrid PSO-GMDH uses a heuristic search process which makes it
more attractive for efficiently searching large and complex search spaces. It is likely
that solution found by traditional GMDH is trapped into local minimum whereas
PSO's domain of search space is infinitely large and it has its internal mechanism to
position is used for simultaneous parametric and structural design of GMDH networks
used for modeling and prediction of various complex models.
      </p>
      <p>Group of Adaptive Model Evolution (GAME). P. Kordik [17] created the GAME as
a hybrid GMDH-based self-organizing modeling system which uses neurons (units)
with several possible types of transfer functions (linear, polynomial, sigmoid,
harmonic perceptron network, etc.). The GAME is an original data mining method. It can
generate models for classification, prediction, identification or regression purposes. It
works with both continuous and discrete variables. The topology of GAME models
adapts to the nature of a data set supplied. The GAME is highly resistant to irrelevant
and redundant features, suitable for short and noisy data samples. The GAME engine
further develops the MIA GMDH algorithm. A GAME model has more degrees of
freedom (units with more inputs, interlayer connections, transfer functions etc.) than
MIA GMDH models. GAME engine also use genetic search to optimize the topology
of models and also the configuration and shapes of transfer functions within their
units.</p>
      <p>Drawbacks of the up-to-date hybrids. The hybrid structures developed by researchers
abroad Ukraine are typically based on classical MIA GMDH algorithm. Those
researchers generally do not take into account the fact that during last decades in
Ukraine there was developed and widely used another types of GMDH algorithms,
namely combinatorial COMBI [18] and relaxational-iterative RIA [19] ones.
Moreover, recently it was shown that hybrids of these three types of GMDH algorithms
generate new, more effective GMDH structures named generalized iterative algorithm
GIA [20]. Accordingly, these new developments can be used to create more powerful
hybrid structures with various types of Computation Intelligence paradigms.</p>
    </sec>
    <sec id="sec-9">
      <title>Some Examples of Successful Use of Hybrid Structures for</title>
    </sec>
    <sec id="sec-10">
      <title>Solving Complex Economic Problems</title>
      <p>Example 1. The cement industry is one of the most important and profitable industries
in every developed country and great content of financial resources are investing in
this sector yearly. In [21] GMDH-type neural network and genetic algorithm is
developed for stock price prediction of cement sector in Iran. Genetic algorithm is arranged
in a new approach to design the whole architecture of the GMDH-type-NNs. It
provides the optimal number of neurons in each hidden layer and their connectivity
configuration to find the optimal set of appropriate coefficients of quadratic expressions
to model stock prices. The results are very encouraging and congruent with the
experimental results.</p>
      <p>Example 2. The prediction of stock price is an important task in investment and
financial decision-making since stock prices/indices are inherently noisy and
nonstationary. In [22] a GMDH type-neural network based on Genetic algorithm is used
to predict stock price index of petrochemical industry in Iran. The results obtained by
using GMDH type neural network are in excellent agreement with the experimental
results and has high performance in stock price prediction.</p>
      <p>Example 3. Forecasting of short-term water demand is useful in planning and
management of water and wastewater facilities such as pump scheduling, control of
reservoirs volume, pressure management and water conservation program. This helps
network managers to decrease vulnerability of the system and consumers and to increase
network reliability. In [23] two types of neural networks: Multi Layered
FeedForward with backpropagation learning algorithm and GMDH with genetic learning
algorithm were investigated to model the water demand forecast in Tehran city. The
comparison reveals that the GMDH neural network with GA produces results that are
close to the actual data.</p>
      <p>Example 4. Wheat is the chief carbohydrate source which is taken to be human’s
food too. Considering the irregular population augmentation in the world the
provision of food stuffs is a predicament of intense significance. Prediction of wheat yield
using different quantity microelements is an important issue as a key parameter in
increase of wheat production. In [24] wheat yield in Iran is modeled and predicted
using GMDH-type neural networks based on some experimental data. The aim of
such modeling is to show how wheat yield change with the variation of levels of
fertilizers (Zinc &amp; Iron). In this way, GA are deployed in a new approach to design the
whole architecture of the GMDH-type neural networks, i.e., the number of neurons in
each hidden layer and their connectivity configuration, in combination with using
regression method to find optimal set of appropriate coefficients of quadratic
expressions for modeling and prediction of wheat yield.</p>
      <p>Example 5. Accurate forecasting of electricity load is one of the most important
issues in the electricity industry, economic and reliable power systems operation such
as unit commitment, reducing spinning reserve, maintenance scheduling, etc. It is
essential part of an efficient power system planning and operation. Short-term load
forecasting (STLF) is a difficult task because the accuracy of forecasting is influenced
by many unpredicted factors such as economic, temperature, etc. whose relationships
are commonly complex, implicit and nonlinear. The modified locally weighted group
method of data handling (M-LWGMDH) based on genetic algorithm is proposed in
[25] to solve the STLF problem. The GA is used to design the whole architecture of
M-LWGMDH network.
6</p>
    </sec>
    <sec id="sec-11">
      <title>Conclusion</title>
      <p>Hybridization of GMDH-NNs and methods of Artificial Intelligence is a new field of
investigation that is actively developed by researchers around the world. As a main
result of this paper, it may be pointed out that the most promising ways of research
activities in the field of modeling structures hybridization are the followings:
 creating new hybrid structures based on other types of GMDH algorithms and
methods of Artificial Intelligence which have not yet been used for hybridization;
 exploring which kinds of hybrids are more successful when solving a specific class
of applied problems.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bezgin</surname>
            ,
            <given-names>K. S.:</given-names>
          </string-name>
          <article-title>Quality management of business processes in the enterprise</article-title>
          .
          <source>Manuscript</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Kozenkov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Business Processes Planning as the Basis of the Creation Enterprise Architecture</article-title>
          .
          <source>The Visnyk of the SSU 3</source>
          .
          <fpage>126</fpage>
          --
          <lpage>136</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Harrington</surname>
            ,
            <given-names>H. J</given-names>
          </string-name>
          ,.
          <string-name>
            <surname>Esseling</surname>
            , E. K.C.,
            <given-names>van Nimwegen. H.</given-names>
          </string-name>
          :
          <article-title>Business Process Improvement Workbook: Documentation, Analysis, Design, and Management of Business Process Improvement</article-title>
          . London:
          <string-name>
            <surname>McGraw-Hill</surname>
          </string-name>
          ,
          <year>1996</year>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fedorov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Modeling business processes in BPMN 2.0 notation</article-title>
          . M.,
          <string-name>
            <surname>MESI</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Davenport</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Process Innovation: Reengeneering Work through Information Technology</article-title>
          ., Boston, MA.: Harvard Business School Press (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Druchenko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Implementation of Business Processes Modeling and Optimization in the Local Government</article-title>
          .
          <source>Public Administration: Theory and Practice</source>
          <volume>1</volume>
          (
          <issue>3</issue>
          ) (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ponomarenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minuhin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Znahur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Theory and Practice of Business Process Modeling: Monograph</article-title>
          . Simon Kuznets Kharkiv National University of Economics (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Manganelli</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The Reengineering Handbook: A Step-By-Step Guide to Business Transformation</article-title>
          . New York: Amacom (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hammer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Champy</surname>
          </string-name>
          , J.:
          <article-title>Reengeneering the Corporation: A Manifesto for Business Revolution</article-title>
          . London : Nicholas Brealey Publishing (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Taranyuk</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaporozhchenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <source>Organizational Principles of Reengineering Business Processes of Enterprises. Mechanism of Economic Regulation</source>
          <volume>4</volume>
          ,
          <fpage>122</fpage>
          --
          <lpage>131</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kuzmin</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sidorov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Achievements and Problems of Evolutionary Economics: Monograph</article-title>
          . Publishing House of Lviv Polytechnic National University (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Reilly</surname>
            ,
            <given-names>J. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Creaner</surname>
            ,
            <given-names>M. J.: NGOSS</given-names>
          </string-name>
          <string-name>
            <surname>Distilled</surname>
          </string-name>
          ,
          <article-title>The Lean Corporation (</article-title>
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Kalyanov</surname>
          </string-name>
          , G.:
          <article-title>Business Processes Modeling, Analysis, Reorganization and Automation</article-title>
          . Finance and Statistics (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Melnikov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Bases of Business Organization. Center of educational literature (</article-title>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Korzachenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>The concept of business processes modeling and optimization of telecommunications companies</article-title>
          .
          <source>Scientific and theoretical journal Khmelnitsky University of Economics "Science and Economics"</source>
          <volume>4</volume>
          (
          <issue>32</issue>
          ),
          <fpage>247</fpage>
          --
          <lpage>253</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Gruber</surname>
          </string-name>
          , T.:
          <article-title>A Translation Approach to Portable Ontologies</article-title>
          .
          <source>Knowledge Acquisition</source>
          ,
          <volume>5</volume>
          (
          <issue>2</issue>
          ),
          <fpage>199</fpage>
          --
          <lpage>220</lpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>