<!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>A Technique for Structuring of Group Expert Judgments Formed Under Complex Forms of Ignorance</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Igor Kovalenko</string-name>
          <email>ihor.kovalenko@chmnu.edu.ua</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yevhen Davydenko</string-name>
          <email>davydenko@chmnu.edu.ua</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alyona Shved</string-name>
          <email>avshved@chmnu.edu.ua</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Petro Mohyla Black Sea National University</institution>
          ,
          <addr-line>68 Desantnykiv street, 10, Mykolaiv, 54003</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>149</fpage>
      <lpage>158</lpage>
      <abstract>
        <p>The main provisions of the technique of structuring the aggregated expert assessments in order to synthesize group opinion, which are formed under the influence of two or more types of ignorance, generated by uncertainty, inaccuracy, inconsistency, contradiction, has been proposed. To synthesize mathematical models for their implementation, the mathematical notation of the theory of evidence (DST) and the theory of plausible and paradoxical reasoning (DSmT) is used. Different quantified measure of uncertainty level in DST has been considered. A procedure for selecting the technique (rule) for aggregation expert judgments formed in the frame of Dempster-Shafer's model, based on quantitative measures of uncertainty, has been proposed. The proposed procedure allows to obtain the aggregated probability masses that provides the lowest achievable uncertainty level.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Information technology</kwd>
        <kwd>ignorance</kwd>
        <kwd>decision-making</kwd>
        <kwd>expert evidence</kwd>
        <kwd>combination rule</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The theory of choice and decision-making investigates mathematical techniques and models for
organize the processes of synthesis of optimal strategic and managerial decisions in social, economic,
technical, organizational and other systems. In practice, making effective decisions is impossible
without the experience and knowledge of specialists (experts).</p>
      <p>Current trends in the development of information technologies, striving to obtain the results of
expert surveys, processing and analysis of expert assessments with a higher quality, while reducing
the time allotted for making a decision, contribute to the complexity of the examination tasks. The
choice and making of optimal and effective decisions for solving complex problems becomes much
more complicated in situation of multi-criteria, multi-alternativeness, especially when solving
semistructured (mixed) and unstructured tasks, i.e. such tasks in which qualitative (not or partially
formalized), little-known, uncertain factors prevail, especially if there is a tendency to increase their
number. The situation is aggravated by the presence of ignorance of various nature, which has a
negative impact on the processes associated with the acquisition and analysis of initial data
(statistical, analytical, expert information). In such situation, a person cannot, at the heuristic level,
guarantee an effective decision-making taking into account all the conflicting factors that affect the
achievement of the goal of the problem under consideration.</p>
      <p>This, in turn, creates the preconditions for the synthesis of a complex of formalized mathematical
models focused on the intellectual support of the decision-making processes under complex forms of
ignorance, multi-criteria and multi-alternativeness.</p>
      <p>The purpose of the research is to present and formalize the main ideas of the technology for
structuring expert knowledge under complex (combined) types of ignorance caused by uncertainty,
inaccuracy, inconsistency or / and contradiction of expert knowledge. The basis of which is the
procedure for identifying different forms of ignorance, their possible combinations, as the basis for
the selection and application of methods for the analysis of expert assessments, which make it
possible to correctly operate with the analyzed set of initial data in the conditions of the revealed type
of ignorance.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Basics of Dempster-Shafer theory and Dezert-Smarandache theory</title>
      <p>
        To solve the problem of group expert assessments structuring under complex (combined) types of
ignorance such as uncertainty, inaccuracy, inconsistency and conflict, effective results can be
obtained by using the DST [
        <xref ref-type="bibr" rid="ref1 ref2 ref22 ref6">1, 2, 6, 22</xref>
        ] and DSmT [
        <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
        ] models and techniques.
      </p>
      <p>The DST techniques allows to handle correctly with expert preferences formed under conditions of
uncertainty, inconsistency (medium level) and allows to correctly operate with possible ways of
intersection and union of expert evidence which can be formed in the processes of identifying and
analyzing of expert date and knowledge. The DSmT is an extension of the notation of the DSmT, and
allows to operate with deeper forms of ignorance, in particular with combinations of uncertainty and
inaccuracy, uncertainty and non-specificity, etc.</p>
      <p>Let a group of experts   {Ej | j  1,t} , evaluating some initial set of objects   {Aj | j  1,m}
frame of discernment), have formed profiles of expert preferences   {Bj | j  1,t}, each
Bj  {Xl | l 1, s}, X l   , reflects the preferences (choice) of the expert Ej and satisfies one of the
following systems of rules.</p>
      <p>1. The initial data set A is a set of the mutual exclusion and exhaustive elements (DS model).</p>
      <p>
        In this case, Bj is a 2А-dimensional vector, each element of which is obeyed the next
system of rules [
        <xref ref-type="bibr" rid="ref1 ref2 ref22 ref6">1, 2, 6, 22</xref>
        ]:
1. X l  {} ;
2. X l  {Ai};
3. Xl  {Ai | i  1, k} , k &lt; n;
4. Xl    {Ai | i  1, n}.
2. The initial data set A is a set of the mutual exhaustive elements (DSm model). In this case,
Bj is a DА-dimensional vector, each element of which is obeyed the next system of rules
[
        <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
        ]:
1. Conditions, that match (1).
      </p>
      <p>2. If Xl , Xk  D , than Xl  Xk  D and Xl  Xk  D.</p>
      <p>For each Bj, j  1,t , a vector m j  {ml | l  1, s} will be obtained whose elements (basic
(1)
(2)
(3)
probability assignment, bpa) satisfy the conditions:</p>
      <p>0  m( Xl )  1, ( Xl  ), m()  0,
where Λ corresponds to 2А, or DА respectively.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Measures of uncertainty in DST</title>
      <p> m( X j )  1,
Xl</p>
      <p>There are two main types of uncertainty: non-specificity or imprecision, and conflict in the theory
of evidence.</p>
      <p>The first of them (non-specificity) allows to determine how the bpa’s of corresponding focal
elements are imprecise, and is directly related to the cardinality of the formed focal elements. The
non-specificity manifests itself in a situation when several elements of the frame of discernment are
not defined (not specified).</p>
      <p>
        Hartley's weighted entropy allows to quantify the degree of non-specificity [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]:
      </p>
      <p>m( X j ) log2  X j  , 0  N(m)  log 2    .</p>
      <p>N (m)   (4)</p>
      <p>X j ,X j </p>
      <p>
        F. Smarandache, A. Martin and C. Osswald [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] are introduced the concept of the "degree of
specificity" S (m) [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ] :
S (m)  1 d(m, mS ) , m d(m, mX )  d(m, mY ), m(X )  m(Y ) ,
(5)
where as a metric d (m, mS ) can be used any measure that characterizes the distance between the
selected groups of evidence; the values of ms satisfy the conditions:
      </p>
      <p> m( X ) 
mS ( X max)  1, X max  arg max   , X  2A , X   (6)</p>
      <p> X </p>
      <p>The second type of uncertainty (conflict) allows to identify and quantify the discrepancy
(contradiction) both within the group of evidence and between several groups of evidence.</p>
      <p>
        There are two types of conflict in DST: internal or auto-conflict and general or global conflict.
Auto-conflict is a type of conflict that occurs only within a group of evidence [
        <xref ref-type="bibr" rid="ref20 ref8">8, 20</xref>
        ]. Global conflict
indicates inconsistency among selected groups of evidence (represented by m1 and m2), and includes
both inconsistency within individual evidence (related to individual m-functions) and inconsistency
between selected groups of evidence (between m1 and m2) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        Conflict is characterized by differences in the selection and evaluation of the elements of the frame
of discernment, and may be the result of the confusion, dissonance, discord and strife [
        <xref ref-type="bibr" rid="ref10 ref14 ref15 ref31">10, 14, 15, 31</xref>
        ]:
(7)
Conf (m)    m( X j ) log2  f ( X j ) ,
      </p>
      <p>X j2
where the function f(Xj) can take the values of the functions Bel(C)   m( X j ) , Pl(C)   m( X j ) ,
X j C, X j2 X j C, X j2
betP(C) </p>
      <p>
X j2 ,X j 
 C  X j</p>
      <p>X j  m( X j ) , or Con( X j )   m( X i )</p>
      <p>Xi2</p>
      <p>X j</p>
      <p>
        Global uncertainty by G. Klir and B. Parviz [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] is the sum of its components: conflict and
nonspecificity:
      </p>
      <p>T (m)  Conf (m)  N(m) , (8)
where N(m) is Hartley's weighted entropy (4); Conf(m) is a conflict measure (7).</p>
      <p>
        The contradiction of the group of evidence can be defined as a weighted contradiction of all focal
elements of the group of evidence [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], Contrm  [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ] :
X j  X
      </p>
      <p>i .</p>
      <p>Contrm   m( X j )d (m, mX j ) ,</p>
      <p>X j2
(9)
1, i  j,i  1, k;
where Xi , X j   : mX j ( Xi )  </p>
      <p>0, i  j.</p>
    </sec>
    <sec id="sec-4">
      <title>4. The technique of structuring the aggregated expert assessments formed under complex forms of ignorance</title>
      <p>The proposed technology is designed to solve the problem of analysis (ranking, clustering, ranking
clusters) of group expert assessments under multi-criteria, multi-alternativeness and complex forms of
ignorance (uncertainty, inaccuracy, inconsistency, conflict) in order to synthesis a final (aggregated)
expert assessment.</p>
      <p>The generalized scheme of the proposed information technology of structuring the expert date and
knowledge in the context of complex forms of ignorance and synthesis of group decisions is shown in
Fig. 1.</p>
      <p>Let's consider the main ideas of the proposed technology. Let   {Ai | i  1, n} be a set of
alternatives, on which certain limitations can be imposed: mutually exclusive and / or mutually
exhaustive elements, which determines the type of model in frame of which expert evidence will be
formed.</p>
      <p>Let a group of experts</p>
      <p>  {E j | j  1, t} have formed profiles of expert preferences
  {B j | j  1, t} on the set   {Ai | i  1, n} . The profile Bj formed by the expert Ej reflects his
preferences regarding all analyzed elements of the set A, and corresponds to one of the systems of
rules (1) or (2), respectively (depending on the chosen analysis model).</p>
      <p>For each expert the same instruction has been presented, which prescribes what they should do
with the set A. The instruction contains information about a scale measurement type, within which
experts express their preferences, which in turn affects the information received from experts (words,
conditional gradations, numbers, rankings, binary relations or other objects of non-numerical nature).</p>
      <p>The profile Bj formed by the expert Ej reflects his preferences, expressed within a given scale, with
respect to the elements of the set A. The expert himself decides which elements (or selected groups of
elements) of the set A will be evaluated. Thus, the profile of preferences Bj formed by Ej may contain:
estimates expressed with respect to all elements of the set A; the assessments expressed regarding the
preferred elements of the set A; the estimates expressed regarding the selected groups of preferred
elements of the set A.</p>
      <p>Next, the set of expert assessments   {Bi | i  1, n} is fed to the input of the block of ignorance
nfi identification, nfi  NF , in this case we are talking about such types of ignorance nfi as
uncertainty, inaccuracy, inconsistency, conflict or their combinations that can be simultaneously
present in the knowledge system. In the ignorance identification block, a system of identification
criteria Ci  {c(ji) | j  1, z}, i  1, p , of the analyzed forms of ignorance NF  {nfi | i  1, p} is formed.
On the basis of formed Ci  {c(ji) | j  1, z} a system of decision rules SRi  {Rl(i) | l  1, h} for nfi
identification is developed. For nfi identification it can be used one or combination of features, which
allows to unambiguously establish the presence of nfi in the initial data (knowledge) set. The absence
of nfi is recognized if for all set of proposed ignorance identification criteria Ci confirmed absence of
nfi ( j : c(ji)  absence of nfi ; ); the presence of nfi is recognized if there is at least 1 criterion c(ji)
(from a given set Ci) signals the presence of nfi ( j : c(ji)  nfi ).</p>
      <p>First, it is necessary to form a set of criteria Ci  {c(ji) | j  1, z} , which, in turn, are considered as
indicators of the presence of ignorance in the analyzed data (knowledge) set.</p>
      <p>For identification the above forms of ignorance (and their combinations), it is proposed to use the
following features:
1. The structure of expert evidence.
2. The level of conflict.
3. Indicators of the quality of the received evidence: level of auto-conflict; the degree of
specificity of the generated evidence, etc.
4. The degree of inconsistency of the formed expert evidence.</p>
      <p>5. Limitations which are imposed on the frame of discernment A.</p>
      <p>The next step is to form a system of decision rules SRi  {Rl(i) | l  1, h} for analyzed forms of
ignorance identification.</p>
      <p>Based on the formed decision rules Rl(i) , a rule for choosing a method for modeling the above
forms of ignorance (and their combinations) can be obtained:</p>
      <p>Bj  P1, if
P2 , if
l : Rl(i)  absence nfi ;
l : Rl(i)  nfi ;
where P indicates that expert evidence are no contradict, have a high (acceptable) quality, and
1
consistent; P2 indicates that expert evidence have a high (not acceptable) level of conflict.</p>
      <p>If B j  P1 , then it is assumed that the expert evidence are consistent (they are characterized by
close evidence, the presence of a low / insignificant level of conflict), and may indicate a high
(acceptable) quality of expert evidence.</p>
      <p>
        In this case, combination techniques (rules) can be used to find the aggregated expert judgments
formed in frame of DST or DSmT data-model [
        <xref ref-type="bibr" rid="ref1 ref13 ref19 ref21 ref24 ref25 ref26 ref27 ref29 ref32 ref33">1, 13, 19, 21, 24-27, 29, 32, 33</xref>
        ]. The algorithm for the
complex use of the combination techniques (rules) for finding group solution by combining expert
assessments formed in frame of DST model has been proposed. A schematic generalized algorithm
for choosing a combination rule is shown in Fig. 2.
P  , mcombP  mi P m j , that minimizes the value of the total uncertainty of the combined bpa’s
min T (mcombP) . Formally, the procedure for choosing a combination rule can be represented as next
successive stages. At the first stage, from the set of available combination rules   {Pi | i  1, k} , a
subset    is selected that satisfies a set of specified criteria С  {сi | i  1, q} .
      </p>
      <p>
        The data model (DST or DSmT model), expert’s competence coefficients, conflict level
information, ignorance level, degree of interaction and the structure of expert evidence can be
considered as criteria for the choice of combination techniques. Recommendations for the choice of
combination rules based on the analysis of a number of criteria are given in [
        <xref ref-type="bibr" rid="ref1 ref21 ref24 ref25">1, 21, 24, 25</xref>
        ]. As a
result, the initial set   {Pi | i  1, k} will be narrowed down to subset   {Pi | i  1, z} , z  k , that
obtained by excluding from the set P, rules that do not satisfy the formed set of criteria
      </p>
      <p>The choosing the combination rule based on the analysis of quantitative characteristics of
uncertainty has done on the second stage.</p>
      <p>At first, the combination rule Pl   is selected that maximizes the value of measure (5) that
reflects the degree of specificity of the combination result max( S (mi Pl m j ) ),. S (mi Pl m j )  1.</p>
      <p>Next, the combination rule Pr   is selected that minimizes the value of the measure (9) that
reflects the degree of contradiction of the combination result
min( Contr(mi Pr m j ) ), Contr(mi Pr m j )  0 .</p>
      <p>If Pl  Pr , then a combination rule is selected that satisfies the following condition:
P  Pl , T mi Pl m j   T mi Pr m j ; (10)</p>
      <p>Pr , T mi Pl m j   T mi Pr m j .
where T is a measure of global uncertainty calculated by eq. (8).</p>
      <p>If Bj  P2 , then it was revealed that there is inconsistency (conflict) of expert evidence, which
indicates the presence of several subgroups of experts with similar assessments, or the presence of
socalled dissident experts (one or more experts with estimates significantly different from those of the
main group).</p>
      <p>As a result, three tasks arise:
1. Identification and exclusion of conflicting (contradictory) evidence (experts).
2. Partitioning (clustering) of the original set of expert evidence into homogeneous (with an
acceptable conflict level) subgroups.</p>
      <p>3. Aggregation of conflicting (contradictory) evidence in order to find a group assessment.</p>
      <p>
        The solution to the first task lies in the use of different approaches (techniques, measures) allowing
to quantify similarities and differences of expert opinions. These techniques use different distance
metrics [
        <xref ref-type="bibr" rid="ref11 ref12 ref3 ref30 ref4">3, 4, 11, 12, 30</xref>
        ] and allow to calculate the level of conflict between the focal elements of
several groups of evidence [
        <xref ref-type="bibr" rid="ref10 ref14 ref15 ref20 ref31 ref8 ref9">8-10, 14, 15, 20, 31</xref>
        ], for example, the degree of conflict between an
expert and the rest of t-1 experts [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. In this case, both the nature of the selected subsets of frame of
discernment (including singletons) and the values of the obtained bpa’s are taken into account.
      </p>
      <p>For example, let   {a,b,c, d} be a frame of discernment, thus
Case 1: the evidence of experts</p>
      <p>E : m{a}  0.1; m{b}  0.9 ;</p>
      <p>1</p>
      <p>E2 : m{a}  0.9 ; m{b}  0.1;
are contradictory (the same elements of the frame of discernment are evaluated, but they are assigned
conflicting bpa’s);
Case 2: the evidence of experts</p>
      <p>E : m{a}  0.4 ; m{b}  0.6 ;</p>
      <p>1</p>
      <p>E2 : m{c}  0.6 ; m{d}  0.4 ;
are also contradictory (there are no common assessed elements of frame of discernment; when the
evidence is combined, their intersections will give ).</p>
      <p>
        To solve the second task in [
        <xref ref-type="bibr" rid="ref16 ref17 ref23">16, 17, 23</xref>
        ] has been proposed a procedure for structuring group
experts evidence formed under uncertainty and inconsistency, which allows to split the original set of
experts evidence into subgroups E  {G1}, {G2} ,…, {Gq}, …, {Gp} (Gq  E, {Gq} = {E1,…,Er},
t ≥ r ≥ 1, t ≥ p ≥ 1), which are characterized by agreed expert evidence. And determine such Ej that do
not belong to any group (Ej  Gq, provided that |Gq| = 1). The judgments of such experts Ej are
significantly different from those of the main group. Further, within each of the formed subgroups,
aggregate group estimates can be obtained. Provided that p = 1 (and, as a consequence, t = r), the
opinions of the entire group E are considered consistent. If a tendency pt and r1 arises, further
analysis is inappropriate.
      </p>
      <p>
        To solve the third task, it is suggested to use one of the proportional conflict redistribution rules.
Each of which (depending on the rule) is based on different approaches aimed at redistributing the
local or general mass of bpa’s on the subsets involved in the conflict. Thus, providing mechanisms for
combining evidence with a very high level of conflict. In [
        <xref ref-type="bibr" rid="ref24 ref25 ref26 ref27">24-27</xref>
        ] notes that PCR5 is the only rule
whereby the shares of each local conflict bpa’s are redistributed to the subsets involved in the conflict
in proportion to the relevant bpa’s for these subsets. This technique makes it possible to achieve the
most correct redistribution of the local conflict bpa’s, but it entails certain computational difficulties.
      </p>
      <p>The next step is the choice of the mathematical formalism for structuring expert data and
knowledge formed under identified type of ignorance. If the absence of ignorance nfi is confirmed,
then the task of expert judgments structuring is reduced to solving the problem of finding the
aggregated (generalized) expert judgments. If the analysis reveals the presence of nfi (in this case the
initial data set is characterized by inconsistency), then the task of expert judgments structuring is
reduced to solving the problem of partition the initial data set into several clusters of experts with
close (agreed, consistent, homogenous) evidence, for their subsequent analysis and search for an
aggregated estimate within each of the selected subgroups.</p>
      <p>In the case when the selection of subgroups of experts and the search for aggregated assessments
within the selected subgroups is not acceptable, it is advisable to determine the reason for the spread
of expert assessments, identify experts whose assessments violate the consistency of the general set of
evidence, and conduct a second survey (possibly with adjustments to the composition of the expert
group, changing the expert survey procedure, etc.) in order to obtain high quality expert evidence.</p>
      <p>The result of the processes occurring in this block is the information prepared (structured) for
decision making, which meets the set goals of the analysis.</p>
      <p>The final stage is the interpretation of the results of structuring and the development of a group
solution.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The main ideas of the technology of structuring the aggregated expert assessments formed under
multi-criteria, multi-alternativeness and specific types of ignorance (caused by uncertainty,
inaccuracy, inconsistency, conflict / contradiction) has been proposed.</p>
      <p>The proposed technology is a set of systematized techniques and methods of intellectual support of
decision making processes in various spheres of human activity.</p>
      <p>This creates the basis for the development of integrated information technologies for intellectual
support of the decision-making process, which allow solving typical decision-making problems in
various subject areas, taking into account the type of expert measurements scale, the method of
modeling the revealed type of ignorance, the form of presentation of expert judgments (crisp, interval,
fuzzy) and the complex of modeled types of ignorance.</p>
      <p>A procedure for evidence combination rule selection has been proposed. For each pair of
combined expert judgments a rule is selected that minimizes the value of the degree of inconsistency
and maximizes the value of the degree of specificity of the result of combination.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgements</title>
      <p>The proposed mathematical models and approaches were obtained as a result of research supported
by the state research project: “Development of modern information and communication technologies
for the management of intellectual resources to decision-making support of operational management”
(research project no. 0121U107831, financed by the Government of Ukraine).</p>
    </sec>
    <sec id="sec-7">
      <title>7. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K. K.</given-names>
            <surname>Annamdas</surname>
          </string-name>
          ,
          <article-title>Evidence based uncertainty models and particles swarm optimization for multiobjective optimization of engineering systems</article-title>
          ,
          <source>Ph.D. thesis</source>
          , University of Miami, Coral Gables, Florida,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Beynon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Curry</surname>
          </string-name>
          , P. Morgan,
          <article-title>The Dempster-Shafer theory of evidence: an alternative approach to milticriteria decision modeling</article-title>
          .
          <source>Omega 28. 1</source>
          (
          <issue>2000</issue>
          ), pp.
          <fpage>37</fpage>
          -
          <lpage>50</lpage>
          . DOI:
          <volume>10</volume>
          .1016/S0305-
          <volume>0483</volume>
          (
          <issue>99</issue>
          )
          <fpage>00033</fpage>
          -
          <lpage>X</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhattacharyya</surname>
          </string-name>
          ,
          <article-title>On a measure of divergence between two statistical populations defined by their probability distribution</article-title>
          .
          <source>Bulletin of the Calcutta Mathematical Society</source>
          <volume>35</volume>
          (
          <year>1943</year>
          ), pp.
          <fpage>99</fpage>
          -
          <lpage>110</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cuzzolin</surname>
          </string-name>
          ,
          <article-title>A geometric approach to the theory of evidence</article-title>
          .
          <source>Transactions on Systems, Man, and Cybernetics</source>
          . Part C:
          <article-title>Applications</article-title>
          and Reviews 38. 4 (
          <issue>2007</issue>
          ), pp.
          <fpage>522</fpage>
          -
          <lpage>534</lpage>
          . DOI:
          <volume>10</volume>
          .1109/TSMCC.
          <year>2008</year>
          .
          <volume>919174</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kovalenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shved</surname>
          </string-name>
          ,
          <article-title>The basic concepts of the normative theory of the synthesis of information technologies for decision support</article-title>
          ,
          <source>in: Proceedings of the 15th International conference "Computer sciences and Information technologies"</source>
          ,
          <source>CSIT</source>
          <year>2020</year>
          , Zbarazh, Ukraine,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Dempster</surname>
          </string-name>
          ,
          <article-title>Upper and lower probabilities induced by a multivalued mapping</article-title>
          .
          <source>Annals of Mathematical Statistics 38. 2</source>
          (
          <issue>1967</issue>
          ), pp.
          <fpage>325</fpage>
          -
          <lpage>339</lpage>
          . DOI:
          <volume>10</volume>
          .1214/aoms/1177698950.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Dubois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prade</surname>
          </string-name>
          ,
          <article-title>A note on measures of specificity for fuzzy sets</article-title>
          .
          <source>International Journal of General Systems 10. 4</source>
          (
          <issue>1985</issue>
          ), pp.
          <fpage>279</fpage>
          -
          <lpage>283</lpage>
          . DOI:
          <volume>10</volume>
          .1080/03081078508934893.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>George</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <article-title>Quantification of conflict in Dempster-Shafer framework: a new approach</article-title>
          .
          <source>International Journal Of General System 24. 4</source>
          (
          <issue>1996</issue>
          ), pp.
          <fpage>407</fpage>
          -
          <lpage>423</lpage>
          . DOI:
          <volume>10</volume>
          .1080/03081079608945130.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>Uncertainty quantification and data fusion based on Dempster-Shafer theory</article-title>
          ,
          <source>Ph.D. thesis</source>
          , Florida State University, Tallahassee, Florida,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>U.</given-names>
            <surname>Hohle</surname>
          </string-name>
          ,
          <article-title>Entropy with respect to plausibility measures</article-title>
          ,
          <source>in: Proceedings of 12th IEEE International Symposium on Multiple-Valued Logic, MVL 82</source>
          , Paris, France,
          <year>1982</year>
          , pp.
          <fpage>167</fpage>
          -
          <lpage>169</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Jousselme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Grenier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Boss</surname>
          </string-name>
          <article-title>´e, A new distance between two bodies of evidence</article-title>
          .
          <source>Information Fusion 2</source>
          . 2 (
          <issue>2001</issue>
          ), pp.
          <fpage>91</fpage>
          -
          <lpage>101</lpage>
          . DOI:
          <volume>10</volume>
          .1016/S1566-
          <volume>2535</volume>
          (
          <issue>01</issue>
          )
          <fpage>00026</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Jousselme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Grenier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Boss</surname>
          </string-name>
          <article-title>´e, Analyzing approximation algorithms in the theory of evidence. Sensor Fusion: Architecture, Algorithms</article-title>
          and Applications VI.
          <volume>4731</volume>
          (
          <year>2002</year>
          ):
          <fpage>65</fpage>
          -
          <lpage>74</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Inagaki</surname>
          </string-name>
          ,
          <article-title>Interdepence between safety-control policy and multiple-sensor schemes via Dempster-Shafer theory</article-title>
          .
          <source>Transaction on Reliability 40. 2</source>
          (
          <issue>1991</issue>
          ), pp.
          <fpage>182</fpage>
          -
          <lpage>188</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Klir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parviz</surname>
          </string-name>
          ,
          <article-title>A note on measure of discord</article-title>
          ,
          <source>in: Proceedings of the 8th Conference on Uncertainty in Artificial Intelligence</source>
          , UAI'92, Stanford, CA, USA,
          <year>1992</year>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>141</lpage>
          . DOI:
          <volume>10</volume>
          .1016/B978-1
          <source>-4832-8287-9</source>
          .
          <fpage>50023</fpage>
          -
          <lpage>2</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Klir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramer</surname>
          </string-name>
          ,
          <article-title>Uncertainty in the Dempster-Shafer theory: a critical re-examination</article-title>
          .
          <source>International Journal of General System 18. 2</source>
          (
          <issue>1990</issue>
          ), pp.
          <fpage>155</fpage>
          -
          <lpage>166</lpage>
          . DOI:
          <volume>10</volume>
          .1080/03081079008935135.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>I. I.</given-names>
            <surname>Kovalenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Shved</surname>
          </string-name>
          ,
          <article-title>Clustering of group expert estimates based on measures in the theory of evidence</article-title>
          .
          <source>Naukovyi Visnyk Natsionalnoho Hirnychoho Universytetu</source>
          <volume>4</volume>
          . 154 (
          <year>2016</year>
          ), pp.
          <fpage>71</fpage>
          -
          <lpage>78</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kovalenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shved</surname>
          </string-name>
          ,
          <article-title>Formation of consistent groups of expert evidences based on dissimilarity measures in evidence theory</article-title>
          ,
          <source>in: Proceedings of the 14th International conference "Computer sciences and Information technologies"</source>
          ,
          <source>CSIT</source>
          <year>2019</year>
          , Lviv, Ukraine,
          <year>2019</year>
          , pp.
          <fpage>113</fpage>
          -
          <lpage>116</lpage>
          . DOI:
          <volume>10</volume>
          .1109/STC-CSIT.
          <year>2019</year>
          .8929858
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kovalenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shved</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Antipova</surname>
          </string-name>
          ,
          <article-title>Methodology for the synthesis of information technologies for ignorance modeling: the key concepts</article-title>
          ,
          <source>in: Proceedings of the 1st International Workshop "Information-Communication Technologies &amp; Embedded Systems", ICT&amp;ES</source>
          <year>2019</year>
          , Mykolaiv, Ukraine,
          <year>2019</year>
          , pp.
          <fpage>233</fpage>
          -
          <lpage>240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kovalenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shved</surname>
          </string-name>
          ,
          <article-title>Searching for Pareto-optimal solutions</article-title>
          , in: N.
          <string-name>
            <surname>Shakhovska</surname>
          </string-name>
          , M. Medykovskyy (Eds.),
          <source>Advances in Intelligent Systems and Computing IV, CCSIT 2019, Advances in Intelligent Systems and Computing 1080</source>
          , Springer, Cham,
          <year>2020</year>
          , pp.
          <fpage>121</fpage>
          -
          <lpage>138</lpage>
          . DOI:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -33695-0_
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Jousselme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Osswald</surname>
          </string-name>
          ,
          <article-title>Conflict measure for the discounting operation on belief functions</article-title>
          ,
          <source>in: Proceedings of the 11th International Conference on Information Fusion, FUSION</source>
          <year>2008</year>
          , Cologne, Germany,
          <year>2008</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sentz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferson</surname>
          </string-name>
          ,
          <article-title>Combination of evidence in Dempster-Shafer theory</article-title>
          ,
          <source>Technical Report SAND</source>
          <year>2002</year>
          -
          <volume>0835</volume>
          , Sandia National Laboratories, Albuquerque,
          <string-name>
            <surname>NM</surname>
          </string-name>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>G.</given-names>
            <surname>Shafer</surname>
          </string-name>
          ,
          <source>A mathematical theory of evidence</source>
          , Princeton University Press, Princeton,
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>A.</given-names>
            <surname>Shved</surname>
          </string-name>
          , I. Kovalenko,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <article-title>Method of detection the consistent subgroups of expert assessments in a group based on measures of dissimilarity in evidence theory</article-title>
          , in: N.
          <string-name>
            <surname>Shakhovska</surname>
          </string-name>
          , M. Medykovskyy (Eds.),
          <source>Advances in Intelligent Systems and Computing IV, CCSIT 2019, Advances in Intelligent Systems and Computing 1080</source>
          , Springer, Cham,
          <year>2020</year>
          , pp.
          <fpage>36</fpage>
          -
          <lpage>53</lpage>
          . DOI:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -33695-
          <issue>0</issue>
          _
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Smarandache</surname>
          </string-name>
          ,
          <article-title>An in-depth look at information fusion rules and the unification of fusion theories. Computing Research Repository (CoRR) cs</article-title>
          .
          <source>OH/0410033</source>
          (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>F.</given-names>
            <surname>Smarandache</surname>
          </string-name>
          ,
          <article-title>Unification of Fusion Theories (UFT)</article-title>
          .
          <source>International Journal of Applied Mathematics and Statistics</source>
          <volume>2</volume>
          (
          <year>2004</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>F.</given-names>
            <surname>Smarandache</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dezert</surname>
          </string-name>
          , Representation of DSmT, in: Advances and
          <article-title>Applications of DSmT for Information Fusion</article-title>
          , volume
          <volume>1</volume>
          , American Research Press, Rehoboth,
          <year>2004</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>F.</given-names>
            <surname>Smarandache</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dezert</surname>
          </string-name>
          ,
          <article-title>Advances and applications of DSmT for information fusion</article-title>
          .
          <source>Collected works</source>
          , volume
          <volume>2</volume>
          , American Research Press, Rehoboth,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>F.</given-names>
            <surname>Smarandache</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Osswald</surname>
          </string-name>
          ,
          <article-title>Contradiction measures and specificity degrees of basic belief assignments</article-title>
          ,
          <source>in: Proceedings of the 14th International Conference on Information Fusion, FUSION</source>
          <year>2011</year>
          , Chicago, USA,
          <year>2011</year>
          , pp.
          <fpage>475</fpage>
          -
          <lpage>482</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Ph</surname>
          </string-name>
          .
          <article-title>Smets, The combination of evidence in the transferable belief model</article-title>
          .
          <source>Pattern analysis and Machine Intelligence</source>
          <volume>12</volume>
          . 5 (
          <issue>1990</issue>
          ), pp.
          <fpage>447</fpage>
          -
          <lpage>458</lpage>
          . DOI:
          <volume>10</volume>
          .1109/34.55104.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>B.</given-names>
            <surname>Tessem</surname>
          </string-name>
          ,
          <article-title>Approximations for efficient computation in the theory of evidence</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>61</volume>
          (
          <year>1993</year>
          ), pp.
          <fpage>315</fpage>
          -
          <lpage>329</lpage>
          . DOI:
          <volume>10</volume>
          .1016/
          <fpage>0004</fpage>
          -
          <lpage>3702</lpage>
          (
          <issue>93</issue>
          )
          <fpage>90072</fpage>
          -
          <lpage>J</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Yager</surname>
          </string-name>
          ,
          <article-title>Entropy and specificity in a mathematical theory of evidence</article-title>
          .
          <source>International Journal of General Systems 9. 4</source>
          (
          <issue>1983</issue>
          ), pp.
          <fpage>249</fpage>
          -
          <lpage>260</lpage>
          . DOI:
          <volume>10</volume>
          .1080/03081078308960825.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Yager</surname>
          </string-name>
          ,
          <article-title>On the Dempster-Shafer framework and new combination rules</article-title>
          .
          <source>Information Science 41. 2</source>
          (
          <issue>1987</issue>
          ), pp.
          <fpage>93</fpage>
          -
          <lpage>137</lpage>
          . DOI:
          <volume>10</volume>
          .1016/
          <fpage>0020</fpage>
          -
          <lpage>0255</lpage>
          (
          <issue>87</issue>
          )
          <fpage>90007</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Representation, independence
          <article-title>and combination of evidence in the Dempster-Shafer Theory of Evidence</article-title>
          , in: M.
          <string-name>
            <surname>Fedrizzi</surname>
          </string-name>
          (Ed.),
          <source>Advances in the Dempster-Shafer Theory of Evidence</source>
          , John Wiley &amp; Sons, New York,
          <year>1994</year>
          , pp.
          <fpage>51</fpage>
          -
          <lpage>69</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>