G02BNF (PDF version)
G02 Chapter Contents
G02 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

G02BNF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

G02BNF computes Kendall and/or Spearman nonparametric rank correlation coefficients for a set of data; the data array is overwritten with the ranks of the observations.

2  Specification

SUBROUTINE G02BNF ( N, M, X, LDX, ITYPE, RR, LDRR, KWORKA, KWORKB, WORK1, WORK2, IFAIL)
INTEGER  N, M, LDX, ITYPE, LDRR, KWORKA(N), KWORKB(N), IFAIL
REAL (KIND=nag_wp)  X(LDX,M), RR(LDRR,M), WORK1(M), WORK2(M)

3  Description

The input data consists of n observations for each of m variables, given as an array
xij,  i=1,2,,n n2,j=1,2,,mm2,
where xij is the ith observation of the jth variable.
The quantities calculated are:
(a) Ranks
For a given variable, j say, each of the n observations, x1j,x2j,,xnj, has associated with it an additional number, the ‘rank’ of the observation, which indicates the magnitude of that observation relative to the magnitudes of the other n-1 observations on that same variable.
The smallest observation for variable j is assigned the rank 1, the second smallest observation for variable j the rank 2, the third smallest the rank 3, and so on until the largest observation for variable j is given the rank n.
If a number of cases all have the same value for the given variable, j, then they are each given an ‘average’ rank, e.g., if in attempting to assign the rank h+1, k observations were found to have the same value, then instead of giving them the ranks
h+1,h+2,,h+k,
all k observations would be assigned the rank
2h+k+12
and the next value in ascending order would be assigned the rank
h+k+ 1.
The process is repeated for each of the m variables.
Let yij be the rank assigned to the observation xij when the jth variable is being ranked. The actual observations xij are replaced by the ranks yij.
(b) Nonparametric rank correlation coefficients
(i) Kendall's tau:
Rjk=h=1ni=1nsignyhj-yijsignyhk-yik nn-1-Tjnn-1-Tk ,  j,k=1,2,,m,
where signu=1 if u>0,
signu=0 if u=0,
signu=-1 if u<0,
and Tj=tjtj-1, where tj is the number of ties of a particular value of variable j, and the summation is over all tied values of variable j.
(ii) Spearman's:
Rjk*=nn2-1-6i=1n yij-yik 2-12Tj*+Tk* nn2-1-Tj*nn2-1-Tk* ,  j,k=1,2,,m,
where Tj*=tjtj2-1, tj being the number of ties of a particular value of variable j, and the summation being over all tied values of variable j.

4  References

Siegel S (1956) Non-parametric Statistics for the Behavioral Sciences McGraw–Hill

5  Parameters

1:     N – INTEGERInput
On entry: n, the number of observations or cases.
Constraint: N2.
2:     M – INTEGERInput
On entry: m, the number of variables.
Constraint: M2.
3:     X(LDX,M) – REAL (KIND=nag_wp) arrayInput/Output
On entry: Xij must be set to xij, the value of the ith observation on the jth variable, for i=1,2,,n and j=1,2,,m.
On exit: Xij contains the rank yij of the observation xij, for i=1,2,,n and j=1,2,,m.
4:     LDX – INTEGERInput
On entry: the first dimension of the array X as declared in the (sub)program from which G02BNF is called.
Constraint: LDXN.
5:     ITYPE – INTEGERInput
On entry: the type of correlation coefficients which are to be calculated.
ITYPE=-1
Only Kendall's tau coefficients are calculated.
ITYPE=0
Both Kendall's tau and Spearman's coefficients are calculated.
ITYPE=1
Only Spearman's coefficients are calculated.
Constraint: ITYPE=-1, 0 or 1.
6:     RR(LDRR,M) – REAL (KIND=nag_wp) arrayOutput
On exit: the requested correlation coefficients.
If only Kendall's tau coefficients are requested (ITYPE=-1), RRjk contains Kendall's tau for the jth and kth variables.
If only Spearman's coefficients are requested (ITYPE=1), RRjk contains Spearman's rank correlation coefficient for the jth and kth variables.
If both Kendall's tau and Spearman's coefficients are requested (ITYPE=0), the upper triangle of RR contains the Spearman coefficients and the lower triangle the Kendall coefficients. That is, for the jth and kth variables, where j is less than k, RRjk contains the Spearman rank correlation coefficient, and RRkj contains Kendall's tau, for j=1,2,,m and k=1,2,,m.
(Diagonal terms, RRjj, are unity for all three values of ITYPE.)
7:     LDRR – INTEGERInput
On entry: the first dimension of the array RR as declared in the (sub)program from which G02BNF is called.
Constraint: LDRRM.
8:     KWORKA(N) – INTEGER arrayWorkspace
9:     KWORKB(N) – INTEGER arrayWorkspace
10:   WORK1(M) – REAL (KIND=nag_wp) arrayWorkspace
11:   WORK2(M) – REAL (KIND=nag_wp) arrayWorkspace
12:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
IFAIL=1
On entry,N<2.
IFAIL=2
On entry,M<2.
IFAIL=3
On entry,LDX<N,
orLDRR<M.
IFAIL=4
On entry,ITYPE<-1,
orITYPE>1.

7  Accuracy

The method used is believed to be stable.

8  Further Comments

The time taken by G02BNF depends on n and m.

9  Example

This example reads in a set of data consisting of nine observations on each of three variables. The program then calculates and prints the rank of each observation, and both Kendall's tau and Spearman's rank correlation coefficients for all three variables.

9.1  Program Text

Program Text (g02bnfe.f90)

9.2  Program Data

Program Data (g02bnfe.d)

9.3  Program Results

Program Results (g02bnfe.r)


G02BNF (PDF version)
G02 Chapter Contents
G02 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012