The rank correlation coefficient (r), Mathematics

The Rank Correlation Coefficient (R)

Also identified as the spearman rank correlation coefficient, its reasons is to establish whether there is any form of association among two variables where the variables arranged in a ranked form.

R = 1 – {(6Σd2)/(n(n2 -1))}

 

Whereas d = difference among the pairs of ranked values.

                  n = numbers of pairs of rankings

Illustration

A group of 8 accountancy students are tested in Quantitative Techniques and Law II.  Their rankings in the two tests were as:

Student

Q. T. ranking

Law II ranking

d

d2

A

2

3

-1

1

B

7

6

1

1

C

6

4

2

4

D

1

2

-1

1

E

4

5

-1

1

F

3

1

2

4

G

5

8

-3

9

H

8

7

1

1

Σd2 = 22

d = Q. T. ranking - Law II ranking

R = 1 - {(6Σd2)/(n(n2 -1))}

1 -{(6(22))/(8(82 -1))} = 0.74

Hence we conclude that there is a reasonable agreement among student's performances in the two types of tests.

NOTE: in this illustration, if we are given the actual marks then we find r.  R varies between -1 and +1.

Posted Date: 2/18/2013 5:06:49 AM | Location : United States







Related Discussions:- The rank correlation coefficient (r), Assignment Help, Ask Question on The rank correlation coefficient (r), Get Answer, Expert's Help, The rank correlation coefficient (r) Discussions

Write discussion on The rank correlation coefficient (r)
Your posts are moderated
Related Questions
At times we consider only the magnitude of the number without attaching much importance to its direction. Under these circumstances the sign attached with the num

The freshman class is participating in a fundraiser. Their target is to raise $5,000. After the first two days of the fundraiser, they have raised 32 percent of their goal. How man





Prove that the intercept of a tangent between two parallel tangents to a circle subtends a right angle at the centre. Since Δ ADF ≅ Δ DFC ∠ADF = ∠CDF ∴ ∠ADC = 2 ∠CDF

convert 5000ml to liters

You are required to implement Kruskal's algorithm for finding a Minimum Spanning Tree of Graph.  This will require implementing : A Graph Data Type (including a display meth

Example of addition of Fractions: 105/64 + 15/32 + 1/6 =____ would require the denominator to be equal to 64 x 32 x 6 = 12,288. This type of number is very hard to use.