# Using a Computational Approach for Generalizing a Consensus Measure to Likert Scales of Any Sizen

Authors: Mushtaq Abdal Rahem; Marjorie Darrah
Journal: International Journal of Mathematics and Mathematical Sciences
 (2018)

---

## Abstract

There are many consensus measures that can be computed using Likert data. Although these measures should work with any numbern of choices on the Likert scale, the measurements have been most widely studied and demonstrated forn = 5. One measure of consensus introduced by Akiyama et al. forn = 5 and theoretically generalized to alln depends on both the mean and variance and gives results that can differentiate between some group consensus behavior patterns better than other measures that rely on either just the mean or just the variance separately. However, this measure is more complicated and not easy to apply and understand. This paper addresses these two common problems by introducing a new computational method to find the measure of consensus that works for any number of Likert item choices. The novelty of the approach is that it uses computational methods in n-dimensional space. Numerical examples in three-dimensional (for n=6) and four-dimensional (for n=7) spaces are provided in this paper to assure the agreement of the computational and theoretical approach outputs.


---

## Body

## 1. Introduction

The significance of reaching consensus in a group or among groups can easily be appreciated by anyone who has ever been involved in a group decision-making process. Indeed, some researchers believe that coming to consensus plays a key role in group decision-making [1, 2].The importance of consensus can be further appreciated when we consider the vast number of fields, other than just group decision-making, that use consensus. For example, politics, economics, social choice, and science all use the idea of consensus [3–5]. When you consider the work of Lehrer and Wagner [6], it can even be seen how some level of agreement (or consensus) is necessary for the central concepts of thinking.Since consensus is an important idea in many major areas, there is a demand for an accurate way to measure consensus. The central idea of many researchers working in this field of study concerns how to build consensus (or diminish the disagreement) among all people in one group or in more than one group. Many of these measures have an iterative process to try to come to agreement or build consensus [2, 7–9]. If your task is to build consensus by using a multistage process within a group as in [10] or even for each person individually as in [11], you will need at the end of each stage to have a useful instrument or method to measure consensus.There are several different meanings or definitions in the literature for the term “consensus” or “disagreement.” However, these two concepts are always the compliment of each other. In this paper, we use the term consensus to mean an opinion or belief reached by a group of persons who can agree on Likert scale items, while disagreement refers to a difference of opinion or perception.The research to find a mathematical or statistical measure of consensus (or disagreement) started with simple measures and has progressed over time to more sophisticated techniques. The simplest and most widely used measures of consensus and disagreement are the percent agreement measure and the variance. The percent agreement measure has been used in different cases and has been applied to small group consensus. This measure gives only a percentage of team members who accept a particular opinion [12, 13]. The variance measure, evaluated from Likert items, is usually used to talk about the disagreement (or lack of consensus) [14]. This statistical measurement is significant in precise comparison situations. However, the variance can be useless in cases of comparing different sizes of groups or for groups that have different means [15].Another common approach to calculating the consensus isrWG, introduced in [16] by James et al. This measure is based on the variance and is sometimes called inter-rater reliability. Two other measures of consensus are presented by Kendall [17] and Alcalde-Unzu and Vorsatz [18]. The measure Kendall proposes, usually known as Kendall’s tau (τ), is limited to the status of two individuals and directly calculates the ratio of pairwise comparisons of how two people agree. The second measure, symbolically known as (σ), was introduced by Alcalde-Unzu and Vorsatz. This measure determines, for any pair of alternatives, the absolute value of the difference between the ratio of persons who choose one alternative and the proportion of individuals who choose the other option and then takes the average of these numbers over all possible pairs of alternatives [18]. The concepts, comparisons, and properties of these two measures are well introduced in [19].There are many other more advanced methods presented to measure the consensus within a group of individuals. The method of Beliakov et al. [20] concentrates on structuring a function that can measure the degree of consensus from a set of inputs provided as numbers from the unit interval. In the information theory field, Shannon’s [21] formula for Entropy, or the measure of the degree of disorder of a system [22], is widely used. The formula is ∑‍pilog⁡pi (where pi is the probability of ith event’s outcome). Tastle and Weirman [23, 24] apply Shannon’s formula to Likert scales responses. González-Arteaga [1] provides an approach to consensus measurement based on the Pearson correlation coefficient.Based on what is presented above, there are several ways to define consensus and various ways to measure consensus within and among groups. However, none of these approaches use computational geometry concepts inn-dimensional space as introduced in this paper. In this article, we consider a new method to determine the measure of consensus (or conversely the index of disagreement) presented by Akiyama et al. [25] and generalized by Tsuchiya and Hiramoto [26] with the key to this new method using computational geometry concepts presented in Abdal Rahem and Darrah [27]. The researchers in [25] present the sophisticated index of disagreement, called Φ, and the measure of consensus, Ψ, that use the conditional distribution of the variance for a given mean [28]. The distinction of this index is that it allows the comparison of consensus values of various questions for the same group or the same question for diverse groups, even comparisons of groups with different sizes and the questions with different means. However, the way this index is presented for in [25] forn = 5 and generalized in [26] to alln is difficult to understand and not easy to apply.Consequently, Abdal Rahem and Darrah in [27] provide a straightforward algorithmic method to compute the reliable measure introduced in [25]. The idea of this new approach is much easier to use and understand than the way of calculating the index of disagreement presented in [25]. However, in [27], the approach is shown for only two-dimensional space, which relates to n=5 Likert scale. The aim of the research presented in this article is to break the limitation of working with n=5 Likert scale only. Likert items are used in many disciplines to measure attitudes, preferences, and subjective reactions [14, 29, 30]. For this discussion, a global Likert scale is used, with the integers 1 through n corresponding to the words strongly disagree through strongly agree or any other words the researcher prefers or the question suggests.The rest of the paper is organized as follows. Section2 presents the theoretical foundation of our work and defines the index of disagreement for any number of Likert scale and provides a visual illustration of how the equations in Section 2 look for any dimension. In Section 3 the techniques are applied to n=6. Section 4 provides examples of special cases of sets of probabilities as well as specific means with different variances of each fixed mean. Finally, some concluding remarks and future works are discussed in Section 5.


## 2. Theoretical Foundations

The main theoretical foundations of the consensus measurement are introduced in Akiyama et al. [25]. We introduce there the idea that variance is always a function of the mean. For any fixed mean, there will be a range of variances that will be possible. Then given a mean m and a variance v, we find the consensus measure for this two numbers by using conditional probability to determine the “ratio of part of the range of variance to the total range of variance.” In the first paper [25], this measurement is computed by a series of analytical steps for n=5. We first algebraically reduce the computation to a set of three equations in two dimensions. Then by finding the areas between pairs of these equations and subtracting these two areas, we were able to find a number that represents the area given a particular mean, m, and variance, v. We used this method to define a function A(v) and integrate this function from the h(minimum v) to the given h(v). Finally, we divide this number by the integration over the total range of variance, h(minimum v) to h(maximum v), to get the index of disagreement Φ. The measure of consensus, Ψ, will then be 1-Φ.In the second paper, Abdal Rahem and Darrah [27], to simplify the calculation of these areas and make it possible to generalize to any n, two algorithms using computational geometry are presented to replace the complicated analytical steps involving calculus. The first algorithm focuses on computing A(v) and the second algorithm is for using numerical methods to compute the ratio of the integration. Also, all the background from computational geometry and conditional probability are located in [27]. The second paper provides a basis for this generalization work to n>5 that follows in the remainder of this manuscript.


### 2.1. Basic Structure for Consensus Measure (Conversely, Index of Disagreement)

Let us start by introducing the notation for the two main variables we will work with. Supposem and v refer to the mean and the variance computed from the survey wherein the respondents are asked to pick out exactly one answer from the items: 1,2,…,n.Other common notations used throughout are the probabilitiespi, i=1,2,…,n, which means all points pi will first satisfy 0≤pi≤1. Moreover, A(v) refer to a set of points (x1,x2,…,xn-3) in Rn-3 space and f(x1,x2,…,xn-3) is a function from Rn-3 space to R.As utilized in [25], the basic equations for the foundation to compute the index of disagreement are the sum of all probabilities equal to one, the equation for computing the mean, and the equation derived from computing the variance of random variables. Mathematically, we can write the system of equations as follows:(1)p1,p2,p3…,pn≥0.p1+p2+p3⋯+pn=1.p1+2p2+3p3⋯+npn=m.p1+4p2+9p3⋯+n2pn=m2+v.Using the notionx1=p4, x2=p5,…xn-3=pn, we can solve (1) for p1,p2,p3 in terms of x1,x2,…,xn-3 as below:(2)p1,p2,p3,…,pn≥0.p1=12v+m2-5m+6-f1x1,x2,…,xn-3.p2=-v+m2-4m+3+f2x1,x2,…,xn-3.p3=12v+m2-3m+2-f3x1,x2,…,xn-3wheref1,f2, and f3 are functions of n-3 variables. Since we have all the probabilities greater than zero (p1≥0,p2≥0,p3≥0), we can rewrite the system above as follows:(3)p1,p2,p3,…,pn-3≥0.12v+m2-5m+6-f1x1,x2,…,xn-3≥0.-v+m2-4m+3+f2x1,x2,…,xn-3≥0.12v+m2-3m+2-f3x1,x2,…,xn-3≥0or equivalently(4)x1,x2,…,xn-3≥0.f1x1,x2,…,xn-3≤12v+m2-5m+6.f2x1,x2,…,xn-3≥v+m2-4m+3.f3x1,x2,…,xn-3≤12v+m2-3m+2.In order to simplify (4), let us define t and a function hm(v) as below:(5)t=hmv=12v+m2-3m+2wherem is our fixed mean and v is any variance in the range with respect to that mean. Therefore, (4) will be(6)x1,x2,…,xn-3≥0.f1x1,x2,…,xn-3≤t-m+2.f2x1,x2,…,xn-3≥2t-m+1.f3x1,x2,…,xn-3≤t.A ( v ) can be defined as the set of all pairs (x1,x2,…,xn-3) in the (n-3)-dimensional space that satisfy (6). Due to the symmetry of the mean with respect to the midpoint, in the subsequent discussions we will restrict the range of the mean to 1≤m≤n+1/2. The remaining portion n+1/2≤m≤n can be treated as the symmetric reflection of 1≤m≤n+1/2.In order to find minimumt (min⁡t) and the maximum t (max⁡t), substitute the minimum v (min⁡v) and maximum v (max⁡v), for a given mean m, respectively, in hm. Consequently, t=hm(v) is a linear (one-to-one) mapping of the interval [min⁡v,max⁡v] onto [min⁡t,max⁡t]. The inverse of t=hm(v) is also a linear mapping of [min⁡t,max⁡t] onto [min⁡v,max⁡v] given by v=hm-1(t)=2t-m2+3m-2.For purposes of finding the areaA(v) for fixed m, we derive three equations from (6) to get three lines, planes, or hyperplanes in Rn-3 space; say gi(x1,x2,…,xn-4) where i=1,2,3 that subdivided the Rn-3 space. For example, in R2 we have(7)g1x=t-m+23-x3g2x=2t-m+18-3x8.g3x=t6-x2.And inR3 we get(8)g1x,y=t-m+26-x+3y6g2x,y=2t-m+115-3x+8y15.g3x,y=t10-3x+6y10.We setf3(x1,x2,…,xn-3)≤t which leads to defining g3(x1,x2,…,xn-4), so we compare g1(x1,x2,…,xn-4) and g2(x1,x2,…,xn-4) to g3(x1,x2,…,xn-4). If we only compare g1(x1,x2,…,xn-4) and g2(x1,x2,…,xn-4) to find an area between them (if it exists), this will not give us any information related to t. Hence, we define A(v) as follows:(9)Av=A1v-A2vwhere(10)A1v=x1,…,xn-3∣g2x1,…,xn-4≤xn-3≤g3x1,…,xn-4and(11)A2v=x1,…,xn-3∣g1x1,…,xn-4≤xn-3≤g3x1,…,xn-4.Note that allxi are probabilities, so we restrict 0≤x1,x2,…,xn-4≤1.Now that we have presented all the equations required for restricting the target area, the next step is to compute these areas in any dimension.


### 2.2. Determine the Index of Disagreement

Although mathematicians may prefer an analytical process to get an exact solution, in many cases it is extremely hard or even impossible to find one. The way of finding the areaA(v) introduced in Akiyama et al. [25] for n=5 uses an analytical method to find the exact solution; however, it has many cases that must be considered. Therefore, the new computational approach presented in this paper finds a very good solution (as good as is required) and can be generalized to any n≥5.To examine what it means to determine these areas or volumes inn-dimensional space, we can first look at the problem in 2-dimensional space. The equations gi(x) are line segments and so the intersections are points. To find the desired area, we simply find the area bounded between two lines and that satisfies 0≤x≤1 and 0≤y≤1, since x and y are probabilities. In this case, there are two ways to compute the area, analytically [25] and by using the computational geometry concepts [27]. See Figure 1 for an example.Figure 1
Example of the areaA1(v) and A2(v) in R2.
(a)
A 1 ( x ) (b)
A 2 ( x )By adding one more probability, the volume is then in three dimensions. In this case, the equationsgi(x,y) are planes. This means the intersections are lines instead of points. Moreover, for n=7, The work will be in four dimensions. Thus, the equations gi(x,y,z) are hyperplanes and the intersection of any two hyperplanes is a 3-dimensional object, and so on. See Figure 2 for an example.Figure 2
Example of the areaA1(v) and A2(v) in R3.
(a)
A 1 ( v ) (b)
A 2 ( v )Consequently and since the region has such a strange shape in general, calculating its area or volume proves to be very difficult with analytical methods, especially as we go to higher dimensions, but calculating the area of rectangles or cubes is simple. We will use this method to simplify our calculations by subdividing the region into small rectangles or cubes, as is a common method for approximating an area or volume. One of the popular approaches to finding the area under a curve numerically is using theRiemann sum. Employing the same idea as the Riemann sum, with some modification to make it more accurate and fit with our problem, we can determine the area or volume of the required region.Before presenting the steps of the algorithms, recall that the area for anyn is bounded by [0,1] (i.e., 0≤xi≤1 for any xi∈Rn-3).Algorithm(1)
Divide the interval[0,1] for every xi-axis into N subintervals of length Δ, (Δ=1/N), where N is a positive integer (2)
Fori1=1 to N
Fori2=1 to N
⋮ Forin-3=1 to N
s j = s i 1 , i 2 , … , i n - 3. (3)
Ifsj satisfy (10) then A1=A1+Δn-3 Ifsj satisfy (11) then A2=A2+Δn-3 and avoid all others. (4)
A ( v ) = A 1 - A 2.Note that in this approach of finding the area, the larger theN (i.e., the smaller Δ) is, the closer the estimate gets to the exact area.Once you getA(v), you can use the same algorithm for determining the integration as we presented in [27] to compute the index of disagreement and the consensus value.


## 2.1. Basic Structure for Consensus Measure (Conversely, Index of Disagreement)

Let us start by introducing the notation for the two main variables we will work with. Supposem and v refer to the mean and the variance computed from the survey wherein the respondents are asked to pick out exactly one answer from the items: 1,2,…,n.Other common notations used throughout are the probabilitiespi, i=1,2,…,n, which means all points pi will first satisfy 0≤pi≤1. Moreover, A(v) refer to a set of points (x1,x2,…,xn-3) in Rn-3 space and f(x1,x2,…,xn-3) is a function from Rn-3 space to R.As utilized in [25], the basic equations for the foundation to compute the index of disagreement are the sum of all probabilities equal to one, the equation for computing the mean, and the equation derived from computing the variance of random variables. Mathematically, we can write the system of equations as follows:(1)p1,p2,p3…,pn≥0.p1+p2+p3⋯+pn=1.p1+2p2+3p3⋯+npn=m.p1+4p2+9p3⋯+n2pn=m2+v.Using the notionx1=p4, x2=p5,…xn-3=pn, we can solve (1) for p1,p2,p3 in terms of x1,x2,…,xn-3 as below:(2)p1,p2,p3,…,pn≥0.p1=12v+m2-5m+6-f1x1,x2,…,xn-3.p2=-v+m2-4m+3+f2x1,x2,…,xn-3.p3=12v+m2-3m+2-f3x1,x2,…,xn-3wheref1,f2, and f3 are functions of n-3 variables. Since we have all the probabilities greater than zero (p1≥0,p2≥0,p3≥0), we can rewrite the system above as follows:(3)p1,p2,p3,…,pn-3≥0.12v+m2-5m+6-f1x1,x2,…,xn-3≥0.-v+m2-4m+3+f2x1,x2,…,xn-3≥0.12v+m2-3m+2-f3x1,x2,…,xn-3≥0or equivalently(4)x1,x2,…,xn-3≥0.f1x1,x2,…,xn-3≤12v+m2-5m+6.f2x1,x2,…,xn-3≥v+m2-4m+3.f3x1,x2,…,xn-3≤12v+m2-3m+2.In order to simplify (4), let us define t and a function hm(v) as below:(5)t=hmv=12v+m2-3m+2wherem is our fixed mean and v is any variance in the range with respect to that mean. Therefore, (4) will be(6)x1,x2,…,xn-3≥0.f1x1,x2,…,xn-3≤t-m+2.f2x1,x2,…,xn-3≥2t-m+1.f3x1,x2,…,xn-3≤t.A ( v ) can be defined as the set of all pairs (x1,x2,…,xn-3) in the (n-3)-dimensional space that satisfy (6). Due to the symmetry of the mean with respect to the midpoint, in the subsequent discussions we will restrict the range of the mean to 1≤m≤n+1/2. The remaining portion n+1/2≤m≤n can be treated as the symmetric reflection of 1≤m≤n+1/2.In order to find minimumt (min⁡t) and the maximum t (max⁡t), substitute the minimum v (min⁡v) and maximum v (max⁡v), for a given mean m, respectively, in hm. Consequently, t=hm(v) is a linear (one-to-one) mapping of the interval [min⁡v,max⁡v] onto [min⁡t,max⁡t]. The inverse of t=hm(v) is also a linear mapping of [min⁡t,max⁡t] onto [min⁡v,max⁡v] given by v=hm-1(t)=2t-m2+3m-2.For purposes of finding the areaA(v) for fixed m, we derive three equations from (6) to get three lines, planes, or hyperplanes in Rn-3 space; say gi(x1,x2,…,xn-4) where i=1,2,3 that subdivided the Rn-3 space. For example, in R2 we have(7)g1x=t-m+23-x3g2x=2t-m+18-3x8.g3x=t6-x2.And inR3 we get(8)g1x,y=t-m+26-x+3y6g2x,y=2t-m+115-3x+8y15.g3x,y=t10-3x+6y10.We setf3(x1,x2,…,xn-3)≤t which leads to defining g3(x1,x2,…,xn-4), so we compare g1(x1,x2,…,xn-4) and g2(x1,x2,…,xn-4) to g3(x1,x2,…,xn-4). If we only compare g1(x1,x2,…,xn-4) and g2(x1,x2,…,xn-4) to find an area between them (if it exists), this will not give us any information related to t. Hence, we define A(v) as follows:(9)Av=A1v-A2vwhere(10)A1v=x1,…,xn-3∣g2x1,…,xn-4≤xn-3≤g3x1,…,xn-4and(11)A2v=x1,…,xn-3∣g1x1,…,xn-4≤xn-3≤g3x1,…,xn-4.Note that allxi are probabilities, so we restrict 0≤x1,x2,…,xn-4≤1.Now that we have presented all the equations required for restricting the target area, the next step is to compute these areas in any dimension.


## 2.2. Determine the Index of Disagreement

Although mathematicians may prefer an analytical process to get an exact solution, in many cases it is extremely hard or even impossible to find one. The way of finding the areaA(v) introduced in Akiyama et al. [25] for n=5 uses an analytical method to find the exact solution; however, it has many cases that must be considered. Therefore, the new computational approach presented in this paper finds a very good solution (as good as is required) and can be generalized to any n≥5.To examine what it means to determine these areas or volumes inn-dimensional space, we can first look at the problem in 2-dimensional space. The equations gi(x) are line segments and so the intersections are points. To find the desired area, we simply find the area bounded between two lines and that satisfies 0≤x≤1 and 0≤y≤1, since x and y are probabilities. In this case, there are two ways to compute the area, analytically [25] and by using the computational geometry concepts [27]. See Figure 1 for an example.Figure 1
Example of the areaA1(v) and A2(v) in R2.
(a)
A 1 ( x ) (b)
A 2 ( x )By adding one more probability, the volume is then in three dimensions. In this case, the equationsgi(x,y) are planes. This means the intersections are lines instead of points. Moreover, for n=7, The work will be in four dimensions. Thus, the equations gi(x,y,z) are hyperplanes and the intersection of any two hyperplanes is a 3-dimensional object, and so on. See Figure 2 for an example.Figure 2
Example of the areaA1(v) and A2(v) in R3.
(a)
A 1 ( v ) (b)
A 2 ( v )Consequently and since the region has such a strange shape in general, calculating its area or volume proves to be very difficult with analytical methods, especially as we go to higher dimensions, but calculating the area of rectangles or cubes is simple. We will use this method to simplify our calculations by subdividing the region into small rectangles or cubes, as is a common method for approximating an area or volume. One of the popular approaches to finding the area under a curve numerically is using theRiemann sum. Employing the same idea as the Riemann sum, with some modification to make it more accurate and fit with our problem, we can determine the area or volume of the required region.Before presenting the steps of the algorithms, recall that the area for anyn is bounded by [0,1] (i.e., 0≤xi≤1 for any xi∈Rn-3).Algorithm(1)
Divide the interval[0,1] for every xi-axis into N subintervals of length Δ, (Δ=1/N), where N is a positive integer (2)
Fori1=1 to N
Fori2=1 to N
⋮ Forin-3=1 to N
s j = s i 1 , i 2 , … , i n - 3. (3)
Ifsj satisfy (10) then A1=A1+Δn-3 Ifsj satisfy (11) then A2=A2+Δn-3 and avoid all others. (4)
A ( v ) = A 1 - A 2.Note that in this approach of finding the area, the larger theN (i.e., the smaller Δ) is, the closer the estimate gets to the exact area.Once you getA(v), you can use the same algorithm for determining the integration as we presented in [27] to compute the index of disagreement and the consensus value.


## 3. Index of Disagreement in 3D

In order to ensure that the methods described above produce acceptable results, they are applied to different cases. Forn=5, you can find the examples with details in Akiyama et al. [25] or Abdal Rahem and Darrah [27].Forn=6, our example is in 3-dimensional space, and the equations fi(x,y,z),i=1,2,3 are as follows:(12)f1x,y,z=x+3y+6z.f2x,y,z=3x+8y+15zf3x,y,z=3x+6y+10zwhich means that the system of inequities in (6) becomes(13)x,y,z≥0.x+3y+6z≤t-m+2.3x+8y+15z≥2t-m+1.3x+6y+10z≤t.For determining the volume restricted by two planes and thez-axis, apply the algorithm above. This will find the volume by adding each small cube when sj satisfies one of the systems of equations to get A1 and A2 and then use those to find A(v).


## 4. Numerical Example

Now we can look at some examples to see if the method produces the desired results. First, we consider some special cases of sets of probabilities. We use the probabilities to determine the mean and the variance. We apply the algorithms above to get the consensus values for these special cases to show that they make sense.The first case we consider is the case when all the respondents have chosen the same response. In other words, when one of the probabilities, sayp6, is one and all others are zeros. This case gives us m=6 and v=0, and therefore the ratio of the index is Φn=6=0/0.000443=0 which gives the consensus value of one.The second case is when the responses are evenly distributed at opposite ends of the scale. For example, probabilities are0.5 for p1 and p6, and all others are zeros. This time we will get the mean m=3.5 and the variance v=6.25. These values of the mean and variance lead to full disagreement (i.e., Φ=1) since the ratio is Φ=0.0052/0.0052=1, which then means the consensus is zero. Notice that the result in these two cases is exactly what we would expect and also what we got for n=5 with the original method.Before looking at the different values for the mean and variance, we will look at one more special case. Now, suppose all probabilities are equal. Symbolically,pi=1/6, i=1,2,…,6. The mean in this case is m=3.5 and the variance is v=2.92. These two values for mean and variance imply Φ=0.0034/0.0052=0.6538. Subsequently, the consensus Ψ=1-0.6538=0.3462 compared to Φ=0.6666 and Ψ=0.3334 for n=5.For selected values ofm and v, Table 1 shows the different cases of index of disagreement, for n=6, Φ, and the consensus Ψ.Table 1
The Index of disagreementΦ and the consensus Ψ for selected values of m and v.
Mean Variance (v) Φ n = 6 Ψ n = 6 1.1 0.09 0.0000 1.0000  0.1 0.0238 0.9762  0.2 0.3562 0.6435  0.3 0.755 0.245  0.39 0.9595 0.0405  0.49 0.0000 1.0000  1.2 0.16 0.0000 1.0000  0.2 0.0134 0.9866  0.3 0.0874 0.9126  0.4 0.2609 0.7391  0.5 0.5275 0.4725  0.6 0.7736 0.2264  0.7 0.9374 0.0626  0.76 0.9899 0.0101  0.96 1.0000 0.0000The results of all examples above are reasonable and acceptable especially if we compare the results with the same cases for two dimensions,n=5, in [27].


## 5. Conclusions and Future Work

A new approach for generalizing the consensus measure (or index of disagreement) presented in Akiyama et al. [25] has been developed to work for Likert scales with any number of choices. By using computational geometry and n-dimensional space concepts, this paper not only has been able to generalize all the work constructed in [25, 27] but also shows comparable results to those obtained in the last two articles. The difference of this approach compared to the other consensus measures, which also work for any Likert items, is that this measure considers the conditional distribution of the variance for a given mean. In other words, this method provides more information than others that are only based on just the mean or just the variance.Another distinguishing feature of this new method is that it is easy to understand and apply. In fact, we can summarize this work as easy as A, B, C. (A) Set up the equations gi, (B) determine the areas, and (C) calculate the integrations and then the index of disagreement. Additionally, by using these simple steps in an Excel spreadsheet, you can get all the variables defined above, and for (B) and (C), all you need to do is to enter the algorithms into any software you prefer. For instance, all the examples in this paper were computed using Microsoft Excel spreadsheet and Matlab.In future studies, we plan to develop the same ideas to compute the consensus measure for continuous scales. We also plan to continue looking for easier and faster methods to find the areas and volumes described in the paper by using advanced computation geometry and high-dimensional statistics concepts [31, 32].



---

*Source: 5726436-2018-07-02.xml*