<!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>Inductive technology of the target clusterization of enterprise's economic indicators of Ukraine Іrina Lurie 1[0000-0001-8915-728X], Andrii Podlevskyi2[0000-0002-3166-7487] , Natalia Savina2[0000-0001-8339-1219], Maria Voronenko1[0000-0002-5392-5125], Anna Pashnina2[000-0002-1425-1615], Volodymyr Lytvynenko1[0000-0002-1536-</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>shnin</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ymyr Lytvyn</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kherson National Technical University, Department of Informatics &amp; Computing Technology</institution>
          ,
          <addr-line>Kherson</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National University of Water and Environmental Engineering</institution>
          ,
          <addr-line>11, Soborna Street, Rivne, Ukraine, 33000</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article presents an inductive model of objects clustering economic indicators based on the method of arguments group accounting. The basic principles of creating objective clustering inductive model are formed, the ways and prospects for the possible model implementation are shown, the advantages of an objective clustering model compared to traditional data clustering methods are defined.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>inductive modeling</kwd>
        <kwd>economic objects clustering</kwd>
        <kwd>method of arguments group accounting</kwd>
        <kwd>k-means algorithm</kwd>
        <kwd>external balance criterion</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Relevance of the work. The economic objects clustering is currently receiving much
attention. This is primarily due to the increased requirements for the accuracy of the
recognition and identification systems under various conditions for obtaining
information. Currently, there are a large number of diverse clustering algorithms for
economic entities, each of which has its own advantages and disadvantages and is
focused on a specific data type. One of the existing clustering algorithm drawbacks is
their subjectivity, i.e. getting good results of clustering objects on one set does not
guarantee to get similar results on another similar set. One of the ways to improve the
clustering objectivity is the development of hybrid models based on the method of
complex systems inductive modeling, which is a logical continuation of the method of
group accounting of arguments (MGUA) [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. In this regard, the development of
hybrid models and clustering objects methods based on the methods of complex
systems inductive modeling is an important problem from both theoretical and practical
points of view.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Literature review</title>
      <p>The use of a cluster approach is of particular importance for the Ukrainian enterprise's
economic indicators clustering. Cluster policy is aimed at combining the capabilities,
knowledge, and capacities of structures number with the aim of solving joint and
private tasks. The immediate results from solving such problems will form the basis
for the economic, social and technological development of the region.</p>
      <p>Cluster policy is aimed at combining the capabilities of a structures number in
order to solve joint and private tasks. The immediate results from solving such problems
will form the basis for the economic, social and technological development of the
region.</p>
      <p>
        The theory and methodology of creating economic clusters in the regions are
reflected in the writings of many authors. In scientific studies, it is noted that the
successful development of the national economy depends on the development of the local
concentration of specialized industries (industrial districts), which are the basis of the
cluster approach [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This provision was first described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], where the synergistic
effect of a merger of enterprises was first identified and analyzed.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], such areas of knowledge as the new economic geography, business research
of firms, regional studies and innovations that influence the development of cluster
theory in the economy were identified. In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], the authors proposed three clustering
models: classical agglomeration models, industrial complex models, and network
interaction models. In work [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], such five key concepts as externalities, innovative
environment, interfirm struggle, competition of cooperation, dependency path, which
constitute cluster theory, were considered. The authors of this work also focus on the
geographical concentration and specialization of enterprises, the diversity of cluster
participants, the critical mass and life cycle of the cluster, innovation and competition.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], the authors succeeded in systematizing the extensive theoretical and
empirical accumulated earlier, where the advantages of using national competitive
relations in the economy were shown.
      </p>
      <p>
        The authors of [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] believe that the cluster approach in the economy represents the
synthesis of several areas, including local industrial specialization, spatial economic
agglomeration, and regional development, as well as the provisions of strategic and
venture management.
      </p>
      <p>The diversity of the cluster theory indicates the absence of the only correct
approach to its practical operationalization and makes it relevant to use the cluster
approach for clustering the economic indicators of Ukrainian enterprises.</p>
      <p>
        This study proposes inductive models of clustering objects of the economy to
justify their creation at the regional level. The basic concepts of creating an inductive
model of clustering objects based on the method of group accounting of arguments
are described in [
        <xref ref-type="bibr" rid="ref1 ref10 ref2 ref3">1-3, 10</xref>
        ] and further developed in [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref14 ref15 ref16">11-16</xref>
        ]. The authors formulated
the basic principles of creating an inductive model of objective clustering, showed
ways and prospects for a possible implementation of the model, determined the
advantages of the model of objective clustering compared with traditional methods of
data clustering. However, it should be noted that, despite the achievements achieved
in this subject area, the inductive model of objective clustering currently has no
practical implementation.
      </p>
      <p>
        In the paper [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ] an inductive model of objective clustering of objects based
on the k-medium clustering algorithm was developed, an estimation of the stability of
the model to the noise component was made, ways of further improvement of the
proposed model with purpose of increasing the objectivity of the clustering of the
studied data. Approbation of the work of the proposed model was performed using the
data “Compound” and “Aggregation” of the database of the computer school of the
East Finnish University. It is presented studies to assess the stability of the model to
the noise component using data "Seeds".
      </p>
      <p>
        In this paper, a more improved version of the k-means inductive clustering
algorithm is used. In contrast to [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], the centers of masses of the clusters are not
calculated, and the Silhouette, Entropy, Dunn’s index and Calinski-Harabasz index are
used as an internal criterion for the quality of clustering (in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] uses only the
Calinski-Harabasz index).
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Formal problem statement</title>
      <p>The unresolved parts of a common problem include:
• efficient algorithms lack for extracting equal-power subsets from the initial data
set;
• lack of research on the influence of external and internal criteria on the clustering
quality;
• insufficient implementation of the objective clustering inductive model in
various areas of society, especially economic.</p>
      <p>The aim of the article is to develop and study the influence of internal and external
criteria on the quality of the objective clustering inductive model of objects based on
the k-means clustering algorithm in the study of the enterprise's different types
economic data in Ukraine.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Method Description</title>
      <p>Let A  xij  , i  1,..., n; j  1,..., m – the matrix of the objects features under study,
where n is the number of rows or observed objects, m is the number of features
characterizing the object. The clustering task is reduced to splitting the set of objects into
non-empty subsets of disjoint clusters, and the plane separating the clusters can take
any form:</p>
      <p>K  Ks  , s  1,..., k; K1  K2  ...  Kk  A;
Ki  K j  , i  j; i, j  1,..., k
(1)
where k – the number of clusters.</p>
      <p>The methodology of complex systems inductive modeling is based on three
fundamental principles borrowed from various scientific fields:
1. The principle of heuristic self-organization, the i.e. search of applicants various
models with a choice of the best from the point of view of the relativity external
criterion, the value of which is determined on two equally powerful data sets;
2. the external addition principle, the idea of which is the need for objective
verification of the model using additional “fresh” information;
3. The inconclusive decisions principle, i.e. generation of certain solutions set with
the optimal variant subsequent choice.</p>
      <p>The implementation of these principles in the framework of an inductive objective
clustering model implies the following steps:</p>
      <p>• normalization of the studied objects signs, i.e. bringing them to the same range
with the same median of the attribute space attributes;
• splitting the original objects set into two equally powerful submultiples;
• determination of an external criterion or relevance criteria group for choosing the
optimal clustering on two equally powerful subsets;</p>
      <p>• selection or development of a basic clustering algorithm used as a component in
an objective clustering inductive model of objects.</p>
      <p>Data normalization was performed according to the signs in accordance with the
formula:
xij </p>
      <p>xij  med j
max  xij  med j 
where xij – the value of attribute i in the column j , xij – normalized value of this
feature, med j – column median j . The choice of this normalization method was
determined by the fact that as a result, the data features set in all columns had the same
median with a maximum variation attributes range from -1 to 1, while the data
volume for each column falling into the inter-quantile distance (50%) is the largest
compared to other normalization methods.</p>
      <p>
        Algorithm for the separation of the original objects set  to 2 equipotent disjoint
subsets  A and  B consists of the following steps [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]:
      </p>
      <p>1. calculation n   n 1 pairwise distances between objects in the original data
sample;
2. selection of objects pair X s , X p , the distance between which is minimal:
d  X s , X p   mii,nj d  X i , X j 
3. object distribution X s into a subset  A , and object X p into a subset  B ;
4. repetition steps 2–3 for the remaining objects. If the objects number is odd, the
last object is distributed into both subsets.</p>
      <p>As internal criteria (IC) for the quality of clustering used:</p>
      <p>
        Silhouette [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]
      </p>
      <p>SWC 
1 K</p>
      <p>K j1 Sx j
where K - number of clusters, Sxj - the "best" element belonging x j to cluster p .
(2)
(3)
(4)</p>
      <p>The best partition is characterized by the maximum SWC, which is achieved when
the distance inside the cluster is small, and the distance between the elements of the
neighboring clusters is large.</p>
      <p>
        2. Dunn’s index [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
      </p>
      <p>Compares intercluster distance with cluster diameter. The higher the index value,
the better the clustering.</p>
      <p>(5)
(6)
(8)
DI  k   min</p>
      <p>ik
3.</p>
      <p>
        Calinski – Harabasz index [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
      </p>
      <p>QCB   N  K 
QCCH </p>
      <p>QCW   K 1
 max
where N - number of objects, K - number of clusters. The maximum index value
corresponds to the optimal cluster structure.</p>
      <p>
        4. Entropy [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]
 Q K 
   ln uqk  
PE  q1 k 1 , PE  0, ln Kk  (7)
 Q 
 
 
      </p>
      <p>
        Entropy is known as the numerical expression of the system orderliness. The
entropy of the partition reaches a minimum with the highest orderliness in the system (in
the case of a clear partition, the entropy is zero). That is, the greater the belonging
degree of an element to one cluster (and the smaller the belonging degree to all other
clusters), the smaller the entropy value and the more qualitatively clustering is
performed. The main disadvantage of these methods is that their computation becomes
more and more complex, both with an increase in the clusters number k and with an
increase in the objects number included in the data. To calculate the external criterion
of balance, the approach taken from [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] was taken as a basis. In this paper, the
external criterion of balance (ECB) of controlled clustering is defined as the normalized
optimal value of the sum of squared deviations between the values of the internal
criteria of clustering quality (4) – (7):
      </p>
      <p>ECB 
IC A  ICB 2
IC A  ICB 2</p>
      <p> opt</p>
      <p>To create equal clustering conditions on subsets and using the k-average clustering
algorithm, an initial number of clusters is determined at the initialization stage, and
the initial value of criterion (8) is zero. The experiment showed that at subsequent
iterations the criterion value at the first step increases, then monotonously changes
until it reaches saturation, which corresponds to stable clustering on two equally
powerful subsets. The block diagram of the inductive clustering model based on the
kmeans algorithm is shown in Fig. 1.</p>
      <p>Fig. 1. Block diagram of an inductive model of objective clustering based on the
kmeans algorithm
The implementation of the algorithm requires the following steps:
Step 1. Start</p>
      <p>Step 2. Formation of the initial set  of objects under study. Data preprocessing
(filtering, normalization, analysis for missing values). Representation of data in the
form of a matrix n m , where n - the number of rows or the number of objects
studied, m - the number of columns or the number of signs characterizing the objects.</p>
      <p>Step 3. The division  into two equally powerful subsets in accordance with the
above algorithm. The resulting subsets  A and  B formally can be represented as
follows:
 A  xiAj, B  xiBj , j  1,..., m
i  1,..., nA  nB , nA  nB  n
(9)
Step 4. Configure the k-means clustering algorithm.</p>
      <p>For each equally powerful subset:
Step 5. Select the number of clusters.</p>
      <p>Step 6. Sequential clustering and cluster fixing
Step 7. Calculation of the internal criterion of clustering quality.</p>
      <p>Step 8. Calculation of the external balance criterion in accordance with formula
(8).</p>
      <p>Step 9. If the value of the balance criterion reaches the optimum, then:
Step 10 Fixation of the received clustering is performed.
otherwise, the number of clusters is increased by 1 and repeated Step 5-9
Step 11. Determining the optimal number of clusters.</p>
      <p>Step 12. Clustering data (sets  of objects under study), fixing clusters.</p>
      <p>Step 13. End
5
5.1</p>
    </sec>
    <sec id="sec-5">
      <title>Characteristics of the data used</title>
    </sec>
    <sec id="sec-6">
      <title>Analysis of the ratio of small, medium and large enterprises, and</title>
      <p>their importance for economic development in the regions of</p>
    </sec>
    <sec id="sec-7">
      <title>Ukraine</title>
      <p>For Ukraine, unbalanced, resource-intensive, with significant territorial-branch
disproportions is a model of a national economic complex that requires significant
financial and organizational efforts to remedy the situation. Small, medium and large
enterprises play an important role in the Ukrainian economy and have well-known
advantages and disadvantages. To strengthen the benefits and reduce the impact of
shortcomings for each group of companies in the context of accelerated
socioeconomic national development can be considered a system of production cooperation
state regulation, which has its own characteristics in the sectoral and regional
dimension.</p>
      <p>Therefore, it is important to study the main indicators of large, medium and small
businesses of Ukraine with the help of cluster analysis tools, which will reveal certain
differences in the functioning of entrepreneurship in a regional dimension and offer
more effective and flexible mechanisms of regions socio-economic development.</p>
      <p>The matrix of the objects under study contained 26 rows (objects) and 18 columns
(signs characterizing the objects). In accordance with the goals of the problem to be
solved, clustering was carried out according to signs, i.e. after transformation, the data
matrix under investigation had a dimension of 18 × 26. When dividing this set into
two closed subsets in accordance with the algorithm described above, we get two
subsets with dimensions 9 × 13 (9).
6</p>
    </sec>
    <sec id="sec-8">
      <title>Clustering Results</title>
      <p>Using the NbClust package from the programming language and the environment for
developing, analyzing data and statistical calculations R, we construct a diagram that
shows the dependence of the clusters number on the NbClust criteria (Fig. 2).</p>
      <p>Analysis of the chart allows us to conclude that, from the point of view of the
criteria used, it is optimal to divide the test signs into two, three or seven groups.
However, since, in accordance with the goals set, the division of the features set into a
large clusters number is inexpedient, we consider the most optimal clustering when
dividing objects into three groups. The results of the work of objective clustering
inductive models based on the above algorithm are presented in Table 1. Analyzing
the values of the criteria, it is clear that splitting into three clusters shows the best
results for the values of Silhouette, Dunn index and Calinski-Harabasz index. The
minimum Entropy value is achieved when split into two clusters.</p>
      <p>Economic interpretation of the results
2-cluster model. The results of such clustering can clearly identify 2 clusters with
clear socio-economic characteristics. The first cluster contains Ukraine regions, which
traditionally are centers of economic Ukraine macro-regions (Dnipropetrovsk,
Donetsk, Lviv, Odessa, Kharkiv, Kyiv and Kyiv). This cluster can also be positioned as
industrial since in these regions, the main industries are concentrated and the
historically concentrated largest share of large enterprises, which also interact with a
significant number of small and medium enterprises. Accordingly, this cluster is more
productive in socio-economic terms.</p>
      <p>The second cluster focuses on the remaining Ukraine regions with greater
economic diversification of enterprises various types (mostly medium and small) and
relatively lower economic indicators of regional development.</p>
      <p>3-cluster model. The main results are duplicated by the above-mentioned model,
the main difference is the isolation of the Ukraine capital -- the city of Kiev - as a
separate cluster, given its significant socio-economic potential.</p>
      <p>
        7-cluster model. In our opinion, this model is more relevant in interpreting the
impact of enterprises different types on the Ukrainian regions economic development.
To a large extent, such a division is correlated with studies of Ukraine regions by the
integrated indicator of specialization [
        <xref ref-type="bibr" rid="ref19 ref20">19,20</xref>
        ]. In the first cluster, only Kyiv is
represented, because according to the main indicators of social and economic development,
and as the capital of Ukraine, it is positioned as a separate cluster.
      </p>
      <p>1
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
2
+
+
+
+
+
+
+</p>
      <p>The second cluster (Vinnitsa, Zaporozhia, Poltava, Cherkassk) contains fairly
balanced enterprises (small, medium and large) and their indicators of the region, and is
characterized mainly by industrial and agricultural profile.</p>
      <p>The third cluster (Zhytomyr, Rivne, Sumy, Khmelnytsky, Chernivtsi) has a more
pronounced agrarian profile with significant influence of the economic potential of
small and medium enterprises.</p>
      <p>The fourth cluster (Lviv, Odessa, Kharkiv) is represented primarily by regions in
which all types of enterprises are harmoniously represented. In addition, significant
developments in these areas of information industries and high-tech industries can be
2
+
+
+
+
3
+
+
+
+
+
4
+
+
+
5
+
+
+
7
6
+
+
+
+
+
+
+
7
+
+
noted, indicating their informational and post-industrial profile.</p>
      <p>The fifth cluster (Dnipropetrovsk, Donetsk, Kiev) has the largest number of large
enterprises (from 45 to 61) and is characterized by significant industrial potential.</p>
      <p>The sixth cluster (Zakarpattia, Ivano-Frankivsk, Kirovograd, Luhansk, Mykolayiv,
Kherson, Chernihiv) contains areas with a well-developed small and medium business
and a widespread service area. They can be attributed equally to the industrial and
agricultural profile, and to the agrarian-industrial.</p>
      <p>The seventh cluster (Volyn, Ternopil) is represented by regions with lower
socioeconomic development and agronomic indicators than the average in Ukraine and the
dominance of small and medium-sized enterprises of a non-industrial type.
8</p>
    </sec>
    <sec id="sec-9">
      <title>Conclusions</title>
      <p>The results of the model work showed the high efficiency of the developed clustering
models on the novel inductive method of simulation of complex systems.</p>
      <p>In this paper, the k-medium algorithm was used as the basic algorithm, while the
effect of four internal criteria (Silhouette, Dunn’s index, Calinski-Harabasz index,
Entropy) on the quality of clustering was studied. This choice was determined by the
simplicity of its implementation. The advantage of the proposed model lies in its
stability, which is determined by using an external balance criterion on two coherent
samples.</p>
      <p>It should be noted that the use of inductive simulation methods does not eliminate
the main disadvantage of the k-mean algorithm: the result of clustering depends on
the selection of the source centers of the clusters, but with other things being equal,
the proposed model gave better clustering results compared to the traditional
kmedium algorithm implemented in the software environment R.</p>
      <p>Interpreting the results of clustering using an inductive model showed a significant
effect of using such a methodology to identify the degree of influence of small,
medium and large enterprises on the socio-economic development of regions, which is
largely confirmed by the results of other studies. However, some of the detected
clusters (for instance 6) contain ambiguous characteristics that do not allow them to be
clearly interpreted. This indicates the need to use a larger array of output data or to
combine this technique with other approaches to provide the most rational and
reliable result that could be the subject of further scientific research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ivakhnenko</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          :
          <article-title>Group method of data handling - a competitor of stochastic approximation</article-title>
          method // Automatics,
          <year>1968</year>
          . -
          <fpage>№</fpage>
          3. - P.
          <fpage>58</fpage>
          -
          <lpage>72</lpage>
          . [In Ukraine] (
          <year>1968</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ivakhnenko</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          :
          <article-title>Inductive method for self-organization of complex systems models</article-title>
          .− Kiev: Scientific Thought,
          <year>1982</year>
          .− 296 p. [In Russian] (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ivakhnenko</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          :
          <article-title>Objective self-organization based on the theory of self-organization models</article-title>
          // Automatics,
          <year>1987</year>
          . -
          <fpage>№</fpage>
          5. - P.
          <fpage>6</fpage>
          -
          <lpage>15</lpage>
          . [In Russian] (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bergman</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feser</surname>
            ,
            <given-names>E.J.</given-names>
          </string-name>
          :
          <source>Industrial and Regional Clusters: Concepts</source>
          and
          <string-name>
            <given-names>Comparative</given-names>
            <surname>Applications</surname>
          </string-name>
          , Regional Research Institute, WVU (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Marshal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Principles of Economics. London: Macmillan</source>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Humphrey</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmitz</surname>
            <given-names>H.</given-names>
          </string-name>
          :
          <article-title>Governance and upgrading: linking industrial clusters and global value chain research</article-title>
          .
          <source>IDS Working Paper 120. Institute of Development Studies</source>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gordon</surname>
            ,
            <given-names>I. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCann</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Industrial Clusters: Complexes, Agglomeration and/or Social Networks?
          <source>Urban Studies</source>
          ,
          <volume>37</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>513</fpage>
          -
          <lpage>532</lpage>
          (
          <year>2000</year>
          ) https://doi.org/10.1080/0042098002096.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Andersson</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwaag-Serger</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sorvik</surname>
          </string-name>
          , J.:
          <source>Emily Wise Hansson. The Cluster Policies Whitebook</source>
          ,
          <string-name>
            <surname>IKED</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Porter</surname>
            ,
            <given-names>M. E.</given-names>
          </string-name>
          :
          <article-title>The Competitive Advantage of Nations</article-title>
          . New York: Free Press,
          <year>1990</year>
          .
          <article-title>(Republished with a new introduction</article-title>
          ,
          <year>1998</year>
          .) (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Madala</surname>
            ,
            <given-names>H.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ivakhnenko</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          :
          <article-title>Inductive Learning Algorithms for Complex Systems Modeling</article-title>
          .− CRC Press,
          <year>1994</year>
          . - 365 p (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Stepashko</surname>
            ,
            <given-names>V.S.</given-names>
          </string-name>
          :
          <article-title>Theoretical aspects of GMDH as a method of inductive modeling // Managing Systems</article-title>
          and Machines,
          <year>2003</year>
          . -
          <fpage>№</fpage>
          2. - P.
          <fpage>31</fpage>
          -
          <lpage>38</lpage>
          . [In Russian] (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Stepashko</surname>
            ,
            <given-names>V.S.:</given-names>
          </string-name>
          <article-title>Elements of the inductive modeling theory / State and prospects of informatics development in Ukraine: Monograph / Team of authors</article-title>
          . - Kiev: Scientific Thought,
          <year>2010</year>
          . - 1008 p. - P.
          <fpage>471</fpage>
          -
          <lpage>486</lpage>
          . [In Ukraine] (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Osypenko</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          :
          <article-title>Two approaches to solving the problem of clustering in the broad sense from the standpoint of inductive modeling // Power</article-title>
          and Automation,
          <year>2014</year>
          . -
          <fpage>№</fpage>
          1. - P.
          <fpage>83</fpage>
          -
          <lpage>97</lpage>
          . [In Ukraine](
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Osypenko</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reshetjuk</surname>
            ,
            <given-names>V.M.:</given-names>
          </string-name>
          <article-title>The Methodology of Inductive System Analysis as a Tool of Engineering Researches Analytical Planning /</article-title>
          V.V.
          <string-name>
            <surname>Osypenko</surname>
          </string-name>
          , V.M. Reshetjuk // Ann. Warsaw Univ. Life Sci. - SGGW. - №
          <volume>58</volume>
          ,
          <year>2011</year>
          . - P.
          <fpage>67</fpage>
          -
          <lpage>71</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Sarycheva</surname>
            ,
            <given-names>L.V.</given-names>
          </string-name>
          :
          <article-title>Objective cluster analysis of the data on the basis of the Group Method of Data Handling // Problem of Management</article-title>
          and Informatics,
          <year>2008</year>
          . -
          <fpage>№</fpage>
          2. - P.
          <fpage>86</fpage>
          -
          <lpage>104</lpage>
          . [In Russian] (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Babichev</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lytvynenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taif</surname>
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Estimation of the inductive model of objects clustering stability based on the k-means algorithm for different evels of data noise // Radio electronics</article-title>
          , informatics, management. - Zaporizhzhya, ZNTU. -
          <year>2016</year>
          .
          <article-title>- №4, С</article-title>
          .
          <fpage>55</fpage>
          -
          <lpage>60</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Reid</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schein</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Wilson, H.:
          <article-title>Industrial Clusters in Jackson</article-title>
          and
          <string-name>
            <given-names>Josephine</given-names>
            <surname>Counties</surname>
          </string-name>
          . - School of Business Southern Oregon University, November 30,
          <year>2006</year>
          . URL: http://www.ashland.or.us/files/SOU_IndustrialClustersReport.pdf (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kaufman</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>Rousseeuw</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Finding Groups in Data. An Introduction to Cluster Analysis</article-title>
          . Wiley (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Bezdek</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dunn</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>Optimal fuzzy partitions: A heuristic for estimating the parameters in a mixture of normal dustrubutions /</article-title>
          / IEEE Transactions on Computers,
          <fpage>835</fpage>
          -
          <lpage>838pp</lpage>
          (
          <year>1975</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Calinski</surname>
            ,
            <given-names>R.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harabasz</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A dendrite method for cluster analysis // Comm</article-title>
          . in Statistics,
          <volume>3</volume>
          :
          <fpage>1</fpage>
          .27 (
          <year>1974</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Sripada</surname>
            ,
            <given-names>S. Ch.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rao</surname>
            ,
            <given-names>M. S.</given-names>
          </string-name>
          :
          <article-title>Comparison of purity and entropy of k-means clustering and fuzzy c means clustering</article-title>
          ,
          <source>Indian journal of computer science and engineering;</source>
          Vol 2 no.
          <issue>3 June 2011</issue>
          ; ISSN:
          <fpage>0976</fpage>
          -
          <lpage>5166</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>