<!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>Defining Potential Academic Expert Groups based on Joint Authorship Networks Using Decision Support Tools</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Information Recording of National Academy of Sciences of Ukraine</institution>
          ,
          <addr-line>Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2091</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>We consider a co-authorship network in “Information security” field. The network is constructed using Scopus data for the Ukrainian affiliated authors. We define the key centrality indicators: centrality degree, betweenness centrality and weighted centrality. We have made rankings of authors by centrality indicators and citations and aggregated this data with decision support methods. We demonstrate the methodology and possibility of defining expert groups and academic schools using the scientific database's content. We propose to use decision support methods to define most communicative and cited scientists within co-authorship networks and demonstrate the way of ordinal factorial analysis usage for defining the relative weights of different centrality indicators within complex networks. Empirical results, obtained in the paper, indicate that there are no strong connection between given author's centrality indicators and the number of citations to the author's works. However, some centrality indicators are more influential and significant than others. The approaches suggested in the paper can be applied to detection of central nodes in complex networks in general.</p>
      </abstract>
      <kwd-group>
        <kwd>Co-authorship Network</kwd>
        <kwd>Scopus</kwd>
        <kwd>Centrality</kwd>
        <kwd>Information Security</kwd>
        <kwd>Decision Support</kwd>
        <kwd>Ranking</kwd>
        <kwd>Ordinal Factorial Analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Subsequent paragraphs, however, are indented. Rapid development and general
evolution of science, as well as increase of the number of publications of all kinds led to
the necessity of complex consideration and organization of a system for statistical
analysis of document information stream [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Scientometrics, being a conceptually
new development stage of analytical processing of documentation and
scientificstatistical information, is targeted at resolution of such issues as the most rational
selection of effective information, methodology of its evaluation, and efficient ways
of its analysis. Necessary conditions of adequate functioning and development
indicate extreme relevance of the problem of scientifically grounded, balanced, and
efficient state policy in this area [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Scientometrics finds practical application in
qualitative evaluation of academic publications and definition of development dynamics of
both separate academic directions and science in general.
      </p>
      <p>
        Interaction of academics from different research areas, particularly, within
coauthorship networks, is an important and essential part of research process. In
academic cooperation studies (in addition to bibliometrics and scientometrics) social
network research and expert estimation methods are used [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Particularly, one of the
most common methods is based on co-authorship network usage, where the nodes
represent the authors while edges represent co-authorship links, proportional to the
number of joint authorships (publications) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Co-authorship network represents a
tool for defining the functional structure of scientific research as a whole, helps us
understand and forecast the ways of scientific information dissemination and
evolution of academic schools, as well as define the relevance degree of specific research
areas. Study of respective networks allows us to define the key publications, research
fields, and authorship clusters [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
      </p>
      <p>
        Academic co-authorship networks represent an example of complex networks; they
can be analyzed using respective quantitative topological indicators, and further
interpreted from content viewpoint [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ]. For instance, defined co-authorship clusters can
represent expert groups and academic schools [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The relevance of expert group
definition is beyond any doubt, because only professional expert examination can
provide thorough and objective estimate of research results, while scientometric
indicators in this case will be only the tools of decision-making support [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        Academic schools, in their turn, are an essential developmental component of
scientific cognition and educational processes. In spite of this important key role of an
academic school, it is not acknowledged at state level (at least, in Ukraine), as there
are no registration mechanisms and ways of legal certification of an academic
partnership between supervisors, their students and associates. These factors have a
negative imact upon authority, image, and reputation of academic schools [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. As we can
see, definition of academic schools is essential for optimization of joint academic
research activity, particularly, for structuring of collegial intellectual creative process,
targeted at obtaining and application of conceptually innovative, original knowledge,
significant for respective scientific fields.
      </p>
      <p>
        During search for expert groups and academic schools, certain “important” nodes
will be located in the “centre” of respective clusters [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Thus, defining potential
coauthorship network centre is the necessary condition for definition of respective
expert groups and academic schools.
      </p>
      <p>
        Detection of academic communities is a relevant task while choosing experts for
evaluation of scientific research works, solving topical problems in certain areas, and
searching for partners to cooperate with. Besides that, in scientometrics it is important
to understand the processes that take place during academic collaboration. Academic
community structure, intensity of interaction in it, its leaders: these and other aspects
led to emergence of a whole new research area – the Science of Team Science
(SciTS) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. In order to study the key trends of academic cooperation and detect
“rich people’s clubs” as well as the most highly communicative academics,
coauthorship networks are used [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Usage of social networks featuring specialists’
profiles, such as ResearchGate (https://www.researchgate.net/) and LinkedIn
(https://www.linkedin.com/), simplifies the task of looking up specific researchers
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Scientific profiles can be found in Google scholar, Scopus, Web of science, and
other databases. Besides that, there are resources for unification of information on
academics from different databases, such as ORCID (https://orcid.org/),
“Bibliometrics of Ukrainian science” (http://www.nbuviap.gov.ua/bpnu/), “Scientists of
Ukraine” (http://irbis-nbuv.gov.ua), AMiner (https://aminer.org/), and others.
Academic publication databases represent the most thorough resource to look for
academic research groups.
2
      </p>
      <p>
        Basic centrality indicators of a co-authorship network
Potential expert groups of academics are defined based on centrality indicators of
coauthorship networks. In complex network theory there are several types of such
coefficients, defined as the level of their centrality in a graph. Some of the concepts were
based on complex network theory, while others were derived from sociological
research results. There are several basic types of centrality, which are widely used in
network analysis: centrality degree, betweenness (mediation) centrality, eigenvector
centrality, and others [
        <xref ref-type="bibr" rid="ref16 ref17 ref18">16–18</xref>
        ].
      </p>
      <p>
        Centrality degree defines the number of other network agents a certain person
(agent, individual) is connected to; in co-authorship networks it can be interpreted as
the degree of academic interaction. In the simplest case this is the degree of a certain
node, which characterizes an author’s communicability and can be used to forecast
this author’s productivity. According to research data, this characteristic does not
correlate with average citation level and cannot completely represent all the aspects of
authors’ communicability [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. The disadvantage of this indicator for communicative
property definition is its inability to take the weights of graph edges (i.e. the number
of joint publications of authors) into account.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] the weighted degree of centrality is proposed. It is suggested to calculate
centrality in a weighted graph for a specific node as follows:
(1)
CωDα (i) = ki(1−α )sαi
      </p>
      <p>N
ki =  mij
j=1</p>
      <p>, i.e. the sum of links to other nodes and
The indicator includes</p>
      <p>N
si = ω ij
j=1
, i.e., the sum of weights of respective connections, while α
is a
coefficient, adjusted for each specific case.</p>
      <p>
        Centrality in the context of mediation (betweenness centrality) defines a node,
connecting sub-graphs to each other. In the context of academic cooperation,
mediation or betweenness allows us to define authors that connect academic schools:
CB (i) =  g jk (i)
j&lt;k
where g jk (i) is the number of the shortest ways in a graph, which pass through node
number i; i ≠ j, k [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>
        While defining the importance of network nodes, we should consider
communicability, significance of adjacent nodes, but we should not lose the information on the
general productivity of authors, as the number of co-authors does not directly
influence the efficiency of their work [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Definition of important nodes is a relevant
problem, calling for in-depth study of research subject, as there are many measures,
reflecting vertex (node) characteristics of different nature, while the adequacy of their
usage is based on their correspondence to the respective experiment purposes.
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Defining the centers of co-authorship networks for “information security” section of Scopus database</title>
      <p>We propose to use decision support methods to define potential academic expert
groups and academic research schools in co-authorship networks, and demonstrate the
application of “ordinal factorial analysis-based” approach to calculation of relative
weights of different centrality indicators of complex networks. For this purpose we
use data from Scopus. We consider an example of unification of rankings of centrality
and citation measures for researchers in the area of information security. Additionally,
the approach allows us to verify the degree of dependence between different centrality
measures among themselves and in comparison with citation indicators.</p>
      <p>
        Scopus is one of the largest and most reputable abstract databases in the world. In
Ukraine there is a demand for publishing papers cited in the database, particularly,
such publications are necessary for obtaining of academic degrees and titles.
Scientometric analysis of information security abstracts could show the development of this
field in Ukraine in comparison with other countries. Authors of the paper [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] made
scientometric research of the “Information security” area in Scopus. Number of
published papers by year, countries’ ranking by published papers, and other information
are presented in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>Data from Scopus where gathered by the following keywords: information
security, data security, cyber security, network security, cryptography, information
assurance, data encryption, computer security. The search query is: (TITLE-ABS-KEY
(information AND security) OR TITLE-ABS-KEY (data AND security) OR
TITLEABS-KEY (security AND of AND data) OR TITLE-ABS-KEY (cybersecurity) OR
TITLE-ABS-KEY (network AND security) OR TITLE-ABS-KEY (cryptography)
OR TITLE-ABS-KEY (information AND assurance) OR TITLE-ABS-KEY (data
AND encryption) OR TITLE-ABS-KEY (computer AND security) AND (
LIMITTO ( AFFILCOUNTRY , "Ukraine" ) ). 1261 documents were obtained by the query
for Ukrainian affiliated authors in comparison with 492395 documents by selected
keywords for all countries. The number of papers has increased in recent years as a
result of legislation change, but it still amounts to just 0.26 % of the word output.
VOSviewer and Pajek software were used for analyzing obtained data. Co-word
network is shown on Fig.1. Categories of Scopus subject area where defined as
Computer Science (832), Engineering (572), Mathematics (247), Physics and Astronomy
(154), Energy (120), Social Sciences (110) and others.
We assume that there are authors’ profiles in Scopus and authors have to organize
their profiles themselves. Ukrainian rules for translating surnames into English
changed several times, so spelling of surnames and names, namesake names may add
inaccuracies to the data. On Fig.2 we can see that co-authored network is loosely
connected. And on Fig.3 a large network fragement is presented. Existence of
academic schools in “Information security” area can be witnessed based on “cliques”,
which include a productive author with multiple joint publications and a considerable
number of “smaller” nodes – “students”. Fig. 3 illustrates a fragment of co-authorship
network, “built around” Kharchenko V., Sachenko A., Gnatyuk S., and others. The
size of a node is proportional to the number of its connections (see Table 1).
Concentration of co-authorship links around one or several leaders can indicate the
emergence of separate academic schools. Papers of Ukrainian affiliated authors are written
in coauthorship with authors from Poland (102), Kazakhstan (48), United States (47),
Russian Federation (31), United Kingdom (28), China (25), Germany (25), Slovakia
(20), Czech Republic (19), and others.
Surnames of authors with maximum numbers of connections and joint publications
are listed in Table 1. Rankings of authors according to the number of connections and
weighted centrality degree are different, because during initial processing of
information from the database the weights of connections are defined as proportionally
distributed among all authors of each publication. The weighted centrality degree (i.e.
the number of papers published in collaboration) reflects the volume of an author’s
work, while the number of connections characterizes the circle of co-authors of a
specific author.</p>
      <p>Fig. 3. A large fragment of co-authorship network of Ukrainian affiliated authors: papers on</p>
      <p>Information security.</p>
      <p>Table 1 show that the author ranks changed according to selected centrality indicator.
Authors with high centrality indicators are linked with their colleges and form
separate groups or academic schools weakly connected to each other. The lists of authors
from Table 1, sorted by weighted centrality degrees, betweenness centrality and
degree consist of mostly same persons. Each centrality indicator reflects a certain aspect
of the authors’ communicability.</p>
      <p>Also we can define the most productive and cited authors: Table 2 shows authors
ranking by number of papers of each author, number of citations, and h-index of
selected papers.</p>
      <p>
        We can apply one or several indicators, and combine them with other approaches
according to a task. We propose to use decision support methods for integration of
several indicators. Decision support methods are currently used for priority setting in
different areas, particularly, in weakly structured domains. Calculation of relative
criterion weights is an essential component of such processes as strategic planning
and resource allocation [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Areas of application of these methods range from
sustainable development and industry development strategies [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] to information security
[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>
        Application of decision support methods to defining the
central nodes of co-authorship networks
In the context of our current problem, in order to get some information about relative
significance of the two criteria, listed in Table 1 (weighted centrality and
betweenness), we can try to calculate their weights based on ordinal factorial analysis methods
[
        <xref ref-type="bibr" rid="ref23 ref24 ref25">23-25</xref>
        ]. One of the reasons why we are switching to rankings from actual values is
because they differ very significantly across different authors (especially,
betweenness and citation number, that we are going to use a global criterion below). For
instance, betweenness indicator of N.Kussul is below 0.000001, while the same
indicator for Y.Gorbenko is 0.151355. In order to apply the approach [
        <xref ref-type="bibr" rid="ref23 ref24 ref25">23-25</xref>
        ], we need
some global ranking of alternatives, i.e. authors. To get the ranking, we can ask one or
several specialists from the respective field (in our case, information security), to
name the leading authors, and rank the authors accordingly. Using these data and data
from Table 1, it is possible to calculate the weights of the two criteria. This will allow
us to get a rough estimate of their significance, i.e., how important they are for the
authors’ reputation (reflected in the global ranking based on expert references).
      </p>
      <p>Let us consider a hypothetical example: during an interview, the expert was asked
to name up to 10 top specialists in information security area. He placed the authors in
the following order: …, Kharchenko, V., …, Gnatyuk, S., …, Sachenko, A., …,
Lakhno, V., …, Kussul, N., …, Oliynykov, R., … (see last column of Table 3).</p>
      <p>Authors
Kharchenko, V.</p>
      <p>Gnatyuk, S.</p>
      <p>Sachenko, A.</p>
      <p>Lakhno, V.</p>
      <p>Kussul, N.</p>
      <p>Oliynykov, R.</p>
      <p>
        We use the approach described in [
        <xref ref-type="bibr" rid="ref23 ref24 ref25">23-25</xref>
        ]. For calculation the criterion weights, we
should build the respective system of inequalities. The searched weights are the
“centers of mass” of the part of the simplex, delimitated by the solution region of the
system of inequalities. Strict problem statement and step-by-step solution algorithms can
be found in [
        <xref ref-type="bibr" rid="ref23 ref24 ref25">23-25</xref>
        ].
      </p>
      <p>Based on data from Table 3, we can obtain the following criterion weights:
weighted centrality (i.e. number of links) – 0.417; betweenness – 0.583. That is, for
our hypothetical expert, the number of papers, published jointly with other authors (or
number of links to other authors) is a bit less important than an author’s role in
mediation between academic schools.</p>
      <p>
        We can also use information from Scopus database to obtain objective ranking of
authors. Particularly, we can build a ranking based on citation statistics of each author
[
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. So, we can define, whether different aspects of an author’s centrality actually
influence his or her international rating. Let us rank several authors from Table 1
according to the number of citations in Scopus database and define their ratings
according to several centrality aspects, such as weighted centrality degree and
betweenness centrality (Table 4). It would be problematic to rank authors by ordinary
centrality degree (first column of Table 1), because many authors have equal values of this
indicator. That is why we focus on the other two centrality measures (second and third
columns of Table 1). Let us rank 6 authors, featured in both the second and the third
columns of Table 1 by weighted centrality and betweenness, as well as by their
respective numbers of citations (see Table 4).
      </p>
      <p>
        Academics with the largest number of papers in their research fields have large
centrality indicators and big number of citations [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. However, we cannot say there
is a direct dependence between these factors. If we try to find the weights of centrality
indicators according to the algorithm described in [
        <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
        ], then the solution area
turns out to be empty. If we perform a minimal permutation within the ranking (a real
expert or rater might agree to perform it) – place author Bykovy in front of Gnatyuk
in the global ranking – then the weights are: weighted centrality degree – 0.367;
betweenness centrality – 0.633.
2
1
5
4
6
3
      </p>
      <p>Authors
Kharchenko V.
These results (weights) can be interpreted as follows. Empty solution area means that,
centrality does not strongly influence the number of citations. That is, the number of
references to an author’s work only loosely depends on the number of his publication
collaborations and on his academic mediation. Moreover, we should keep in mind,
that we are only analyzing authors’ centrality in one particular topic, i.e. information
security, while citations cover all the topics authors publish articles on. If we still
compare relative weights of the two centrality factors (although, the dependence is
very weak in general), then it turns out that the number of joint publications in Scopus
(which is reflected by weighted centrality degree) is less significant (weight equals
0.367) than author’s mediation role (weight equals 0.633).</p>
      <p>
        Thus, in addition to separate centrality aspects, we can define some generalized
centrality indicator of an author. It can be calculated as arithmetic mean, geometric
mean, or weighted sum of normalized ratings of an author according to criteria from
Table 1. This approach to aggregation of data on several objects (in our case –
authors) is described in [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and can be applied, because criteria are preferentially
independent (which is a necessary and sufficient condition of linear convolution
applicability [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ])).
5
      </p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>The search of authors with high centrality levels and their respective co-authors
allows detecting of academic schools and expert groups. However, for detailed study
we should also use textual (linguistic) analysis of paper abstracts and expert estimates.
These approaches would also allow us to outline academic fields more precisely, and
assess their development.</p>
      <p>We have demonstrated the ranking of publications’ authors in the field of
"Information security" according to several indicators. All the indicators provide versatile
object characteristics. We proposed to create an overall ranking of scientists using
whole number of citations per author, weighted centrality and betweeness centrality.
We have applied decision support methods for detection of potential expert groups of
academics and academic schools with co-authorship networks. The results of final
ranking detect simultaneously scientists with wide communication network and high
Hirsch-index, who could lead a team or be an reputable expert.</p>
      <p>Approaches developed for elicitation of co-authorship networks and elaborated in
the paper can and should be used for detection of important nodes in other complex
networks.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohn</surname>
          </string-name>
          , R.: Scientometrics. Book on Demand, Berlin (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Penkova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Scientometrical and bibliometrical research in library and bibliographic theory and practice</article-title>
          .
          <source>Thesis</source>
          abstract (in Russian). Krasnodar state university of culture and arts,
          <source>Krasnodar</source>
          (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Alireza</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liaquat</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leydersdorff</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Betweenness centrality as a driver of preferential attachment in the evolution of research collaboration networks</article-title>
          .
          <source>Journal of Informetrics</source>
          ,
          <volume>6</volume>
          (
          <issue>3</issue>
          ),
          <fpage>403</fpage>
          -
          <lpage>412</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Scientometric research of co-authorship networks by “Ukrainika naukova” database (in Ukrainian)</article-title>
          .
          <source>Data recording, storage, and processing</source>
          ,
          <volume>14</volume>
          (
          <issue>4</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>51</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Scientific collaboration and endorsement: Network analysis of coauthorship and citation networks</article-title>
          .
          <source>Journal of Informetrics</source>
          ,
          <volume>5</volume>
          (
          <issue>1</issue>
          ),
          <fpage>187</fpage>
          -
          <lpage>203</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milojevic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sugimoto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Topics in dynamic research communities: An exploratory study for the field of information retrieval</article-title>
          .
          <source>Journal of Informetrics</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ),
          <fpage>140</fpage>
          -
          <lpage>153</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Newman</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The structure of scientific collaboration networks</article-title>
          .
          <source>Proc. Natl. Acad. Sci. USA</source>
          ,
          <volume>98</volume>
          ,
          <fpage>404</fpage>
          -
          <lpage>409</lpage>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Snarsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bezsudnov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Internetica: Navigation in complex networks: models and algorithms (in Russian)</article-title>
          .
          <source>Librocom (Editorial URSS)</source>
          , Moscow (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>Co-authorship networks, according to “Ukrainika naukova” database (in Russian)</article-title>
          .
          <source>In: Applied linguistics and linguistic technologies:</source>
          Megaling-2012:
          <article-title>Collection of research works. NAS of Ukraine, language</article-title>
          and information foundation, ed. Shirokov, V., pp.
          <fpage>155</fpage>
          -
          <lpage>163</lpage>
          , ULIF,
          <string-name>
            <surname>Kyiv</surname>
          </string-name>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Tchebotaryov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Scientometrics</surname>
          </string-name>
          <article-title>: how to cure and not to mutilate with it? (in Russian)</article-title>
          .
          <source>Management of large systems</source>
          ,
          <volume>44</volume>
          ,
          <fpage>14</fpage>
          -
          <lpage>31</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kozubtsov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Substantiation of choice of principle for building of a scientific picture of the world of knowledge (in Ukrainian)</article-title>
          .
          <article-title>Scientific-theoretical and socio-political almanac “Grani” (“</article-title>
          <source>Edges”)</source>
          ,
          <volume>99</volume>
          (
          <issue>7</issue>
          ),
          <fpage>45</fpage>
          -
          <lpage>48</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorbov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Studying parameters of node importance in networks of co-authors (in Ukrainian)</article-title>
          .
          <source>Data recording, storage, and processing</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ),
          <fpage>45</fpage>
          -
          <lpage>52</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Sciabolazza</surname>
            ,
            <given-names>V.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vacca</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kennelly</given-names>
            <surname>Okraku</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>McCarty</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Detecting and analyzing research communities in longitudinal scientific networks</article-title>
          .
          <source>PLOS one, August</source>
          <volume>10</volume>
          ,
          <year>2017</year>
          , https://doi.org/10.1371/journal.pone.
          <volume>0182516</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Defining expert groups through analysis of reference database «Ukrainika naukova (in Ukrainian)</article-title>
          .
          <source>Data recording, storage, and processing</source>
          ,
          <volume>17</volume>
          (
          <issue>3</issue>
          ),
          <fpage>75</fpage>
          -
          <lpage>82</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>C. Wei</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>An</surname>
          </string-name>
          , and W. Yeh:
          <article-title>Finding experts in online forums for enhancing knowledge sharing and accessibility</article-title>
          .
          <source>Computers in Human Behavior</source>
          ,
          <volume>51</volume>
          ,
          <fpage>325</fpage>
          -
          <lpage>335</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Opsahl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agneessens</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skvoretz</surname>
          </string-name>
          , J.:
          <article-title>Node centrality in weighted networks: Generalizing degree and shortest paths</article-title>
          .
          <source>Social Networks</source>
          ,
          <volume>32</volume>
          (
          <issue>3</issue>
          ),
          <fpage>245</fpage>
          -
          <lpage>251</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorbov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Characteristics of networks of co-authors in medical sciences (in Russian)</article-title>
          .
          <source>Clinical informatics and telemedicine</source>
          ,
          <volume>9</volume>
          (
          <issue>10</issue>
          ),
          <fpage>141</fpage>
          -
          <lpage>144</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Lande</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Studying co-authorship networks in legal science according to “Ukrainika naukova” database</article-title>
          . Legal informatics,
          <volume>36</volume>
          (
          <issue>4</issue>
          ),
          <fpage>50</fpage>
          -
          <lpage>57</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Liao</surname>
          </string-name>
          , Ch.,
          <string-name>
            <surname>Yen</surname>
          </string-name>
          , H.:
          <article-title>Quantifying the degree of research collaboration: A comparative study of collaborative measures</article-title>
          .
          <source>Journal of Informetrics</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ),
          <fpage>27</fpage>
          -
          <lpage>33</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Somayeh</surname>
            <given-names>Parvin</given-names>
          </string-name>
          , Farahnaz Sadoughi, Arman Karimi,
          <source>Masoud Mohammadi &amp; Farzaneh Aminpour. Information Securityfrom a Scientometric Perspective.Webology</source>
          ,
          <volume>16</volume>
          (
          <issue>1</issue>
          ),
          <fpage>196</fpage>
          -
          <lpage>209</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Tsyganok</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andriichuk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roik</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Usage of multicriteria decisionmaking support arsenal for strategic planning in environmental protection sphere</article-title>
          .
          <source>Journal of Multi-criteria Decision Analysis</source>
          ,
          <volume>24</volume>
          (
          <issue>5-6</issue>
          ),
          <fpage>227</fpage>
          -
          <lpage>238</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Prospects and Potential of Expert Decision-making Support Techniques Implementation in Information Security Area</article-title>
          .
          <source>In CEUR Workshop Proceedings</source>
          . Vol-
          <volume>1813</volume>
          , pp.
          <fpage>8</fpage>
          -
          <lpage>14</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Defining the relative weights of alternative estimation criteria based on clear and fuzzy rankings</article-title>
          .
          <source>Journal of Automation and Information Sciences</source>
          ,
          <volume>45</volume>
          (
          <issue>2</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>49</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Personnel-related decision making using ordinal expert estimates</article-title>
          .
          <source>In: OR52 Keynotes and Extended Abstracts - 52nd Conference of the Operational Research Society</source>
          , pp.
          <fpage>177</fpage>
          -
          <lpage>183</lpage>
          , Royal Holloway University, London (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Kadenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Determination of parameters of criteria of “tree” type hierarchy on the basis of ordinal estimates</article-title>
          .
          <source>Journal of Automation and Information Sciences</source>
          ,
          <volume>40</volume>
          (
          <issue>8</issue>
          ),
          <fpage>7</fpage>
          -
          <lpage>15</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26. Scopus database, http://www.scopus.com,
          <source>last accessed</source>
          <year>2019</year>
          /11/15.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Balagura</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Researching the reference database “Ukrainika naukova” as to detection of connection between authors' citations and their academic cooperation (in Ukrainian)</article-title>
          .
          <source>In: Proceedings of the annual summary conference “Data recording, storage and processing”</source>
          , pp.
          <fpage>210</fpage>
          -
          <lpage>214</lpage>
          .
          <article-title>Institute for information recording of the NAS of Ukraine</article-title>
          , Kyiv (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Totsenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Decision support methods and systems: algorithmic aspect (in Russian)</article-title>
          .
          <source>Naukova dumka</source>
          ,
          <source>Kyiv</source>
          (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Keeney</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raiffa</surname>
          </string-name>
          , H.:
          <article-title>Decisions with Multiple Objectives: Preferences and Value Tradeoffs. 2nd edn</article-title>
          . Cambridge University Press, New York (
          <year>1993</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>