Integer, Intent (In)	::	nvar, ng, nig(ng), ldgmn, nobs, m, isx(m), ldx, ldp
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	iag(nobs)
Real (Kind=nag_wp), Intent (In)	::	gmn(ldgmn,nvar), gc((ng+1)nvar(nvar+1)/2), det(ng), x(ldx,m)
Real (Kind=nag_wp), Intent (Inout)	::	prior(ng), p(ldp,ng), ati(ldp,*)
Real (Kind=nag_wp), Intent (Out)	::	wk(2*nvar)
Logical, Intent (In)	::	atiq
Character (1), Intent (In)	::	typ, equal, priors

C Header Interface

#include <nag.h>

void

g03dcf_ (const char *typ, const char *equal, const char *priors, const Integer *nvar, const Integer *ng, const Integer nig[], const double gmn[], const Integer *ldgmn, const double gc[], const double det[], const Integer *nobs, const Integer *m, const Integer isx[], const double x[], const Integer *ldx, double prior[], double p[], const Integer *ldp, Integer iag[], const logical *atiq, double ati[], double wk[], Integer *ifail, const Charlen length_typ, const Charlen length_equal, const Charlen length_priors)

The routine may be called by the names g03dcf or nagf_mv_discrim_group.

3 Description

Discriminant analysis is concerned with the allocation of observations to groups using information from other observations whose group membership is known,

X_{t}

; these are called the training set. Consider

p

variables observed on

n_{g}

populations or groups. Let

{\bar{x}}_{j}

be the sample mean and

S_{j}

the within-group variance-covariance matrix for the

j

th group; these are calculated from a training set of

n

observations with

n_{j}

observations in the

j

th group, and let

x_{k}

be the

k

th observation from the set of observations to be allocated to the

n_{g}

groups. The observation can be allocated to a group according to a selected rule. The allocation rule or discriminant function will be based on the distance of the observation from an estimate of the location of the groups, usually the group means. A measure of the distance of the observation from the

j

th group mean is given by the Mahalanobis distance,

D_{k j}

D_{k j}^{2} = {(x_{k} - {\bar{x}}_{j})}^{T} S_{j}^{- 1} (x_{k} - {\bar{x}}_{j}) .

(1)

If the pooled estimate of the variance-covariance matrix

S

is used rather than the within-group variance-covariance matrices, then the distance is:

D_{k j}^{2} = {(x_{k} - {\bar{x}}_{j})}^{T} S^{- 1} (x_{k} - {\bar{x}}_{j}) .

(2)

Instead of using the variance-covariance matrices

S

and

S_{j}

, g03dcf uses the upper triangular matrices

R

and

R_{j}

supplied by g03daf such that

S = R^{T} R

and

S_{j} = R_{j}^{T} R_{j}

D_{k j}^{2}

can then be calculated as

z^{T} z

where

{R^{T}}_{j} z = (x_{k} - x_{j})

R^{T} z = (x_{k} - x)

as appropriate.

In addition to the distances, a set of prior probabilities of group membership,

π_{j}

, for

j = 1, 2, \dots, n_{g}

, may be used, with

\sum π_{j} = 1

. The prior probabilities reflect your view as to the likelihood of the observations coming from the different groups. Two common cases for prior probabilities are

π_{1} = π_{2} = \dots = π_{n_{g}}

, that is, equal prior probabilities, and

π_{j} = n_{j} / n

, for

j = 1, 2, \dots, n_{g}

, that is, prior probabilities proportional to the number of observations in the groups in the training set.

g03dcf uses one of four allocation rules. In all four rules the

p

variables are assumed to follow a multivariate Normal distribution with mean

μ_{j}

and variance-covariance matrix

Σ_{j}

if the observation comes from the

j

th group. The different rules depend on whether or not the within-group variance-covariance matrices are assumed equal, i.e.,

Σ_{1} = Σ_{2} = \dots = Σ_{n_{g}}

, and whether a predictive or estimative approach is used. If

p (x_{k} ∣ μ_{j}, Σ_{j})

is the probability of observing the observation

x_{k}

from group

j

, then the posterior probability of belonging to group

j

is:

p (j ∣ x_{k}, μ_{j}, Σ_{j}) \propto p (x_{k} ∣ μ_{j}, Σ_{j}) π_{j} .

(3)

In the estimative approach, the parameters

μ_{j}

and

Σ_{j}

in (3) are replaced by their estimates calculated from

X_{t}

. In the predictive approach, a non-informative prior distribution is used for the parameters and a posterior distribution for the parameters,

p (μ_{j}, Σ_{j} ∣ X_{t})

, is found. A predictive distribution is then obtained by integrating

p (j ∣ x_{k}, μ_{j}, Σ_{j}) p (μ_{j}, Σ_{j} ∣ X)

over the parameter space. This predictive distribution then replaces

p (x_{k} ∣ μ_{j}, Σ_{j})

in (3). See Aitchison and Dunsmore (1975), Aitchison et al. (1977) and Moran and Murphy (1979) for further details.

The observation is allocated to the group with the highest posterior probability. Denoting the posterior probabilities,

p (j ∣ x_{k}, μ_{j}, Σ_{j})

, by

q_{j}

, the four allocation rules are:

(i)Estimative with equal variance-covariance matrices – Linear Discrimination

$\log q_{j} \propto - \frac{1}{2} D_{k j}^{2} + \log π_{j}$
(ii)Estimative with unequal variance-covariance matrices – Quadratic Discrimination

$\log q_{j} \propto - \frac{1}{2} D_{k j}^{2} + \log π_{j} - \frac{1}{2} \log | S_{j} |$

(iii)Predictive with equal variance-covariance matrices

q_{j}^{- 1} \propto {((n_{j} + 1) / n_{j})}^{p / 2} {1 + [n_{j} / ((n - n_{g}) (n_{j} + 1))] D_{k j}^{2}}^{(n + 1 - n_{g}) / 2}

(iv)Predictive with unequal variance-covariance matrices

q_{j}^{- 1} \propto C {((n_{j}^{2} - 1) / n_{j}) | S_{j} |}^{p / 2} {1 + (n_{j} / (n_{j}^{2} - 1)) D_{k j}^{2}}^{n_{j} / 2},

where

C = \frac{Γ (\frac{1}{2} (n_{j} - p))}{Γ (\frac{1}{2} n_{j})} .

In the above the appropriate value of

D_{k j}^{2}

from (1) or (2) is used. The values of the

q_{j}

are standardized so that,

\sum_{j = 1}^{n_{g}} q_{j} = 1 .

Moran and Murphy (1979) show the similarity between the predictive methods and methods based upon likelihood ratio tests.

In addition to allocating the observation to a group, g03dcf computes an atypicality index,

I_{j} (x_{k})

. The predictive atypicality index is returned, irrespective of the value of the parameter typ. This represents the probability of obtaining an observation more typical of group

j

than the observed

x_{k}

(see Aitchison and Dunsmore (1975) and Aitchison et al. (1977)). The atypicality index is computed for unequal within-group variance-covariance matrices as:

I_{j} (x_{k}) = P (B \leq z : \frac{1}{2} p, \frac{1}{2} (n_{j} - p))

where

P (B \leq β : a, b)

is the lower tail probability from a beta distribution and

z = D_{k j}^{2} / (D_{k j}^{2} + (n_{j}^{2} - 1) / n_{j}),

and for equal within-group variance-covariance matrices as:

I_{j} (x_{k}) = P (B \leq z : \frac{1}{2} p, \frac{1}{2} (n - n_{g} - p + 1)),

with

z = D_{k j}^{2} / (D_{k j}^{2} + (n - n_{g}) (n_{j} + 1) / n_{j}) .

I_{j} (x_{k})

is close to

1

for all groups it indicates that the observation may come from a grouping not represented in the training set. Moran and Murphy (1979) provide a frequentist interpretation of

I_{j} (x_{k})

4 References

Aitchison J and Dunsmore I R (1975) Statistical Prediction Analysis Cambridge

Aitchison J, Habbema J D F and Kay J W (1977) A critical comparison of two methods of statistical discrimination Appl. Statist. 26 15–25

Kendall M G and Stuart A (1976) The Advanced Theory of Statistics (Volume 3) (3rd Edition) Griffin

Krzanowski W J (1990) Principles of Multivariate Analysis Oxford University Press

Moran M A and Murphy B J (1979) A closer look at two alternative methods of statistical discrimination Appl. Statist. 28 223–232

Morrison D F (1967) Multivariate Statistical Methods McGraw–Hill

5 Arguments

1: $typ$ – Character(1) Input

On entry: whether the estimative or predictive approach is used.

$typ ='E'$: The estimative approach is used.
$typ ='P'$: The predictive approach is used.

Constraint:

typ ='E'

'P'

2: $equal$ – Character(1) Input

On entry: indicates whether or not the within-group variance-covariance matrices are assumed to be equal and the pooled variance-covariance matrix used.

$equal ='E'$: The within-group variance-covariance matrices are assumed equal and the matrix $R$ stored in the first $p (p + 1) / 2$ elements of gc is used.
$equal ='U'$: The within-group variance-covariance matrices are assumed to be unequal and the matrices $R_{i}$ , for $i = 1, 2, \dots, n_{g}$ , stored in the remainder of gc are used.

Constraint:

equal ='E'

'U'

3: $priors$ – Character(1) Input

On entry: indicates the form of the prior probabilities to be used.

$priors ='E'$: Equal prior probabilities are used.
$priors ='P'$: Prior probabilities proportional to the group sizes in the training set, $n_{j}$ , are used.
$priors ='I'$: The prior probabilities are input in prior.

Constraint:

priors ='E'

'I'

'P'

4: $nvar$ – Integer Input

On entry:

p

, the number of variables in the variance-covariance matrices.

Constraint:

nvar \geq 1

5: $ng$ – Integer Input

On entry: the number of groups,

n_{g}

Constraint:

ng \geq 2

6: $nig (ng)$ – Integer array Input

On entry: the number of observations in each group in the training set,

n_{j}

Constraints:

if $equal ='E'$ , $nig (j) > 0$ and $\sum_{j = 1}^{n_{g}} nig (j) > ng + nvar$ , for $j = 1, 2, \dots, n_{g}$ ;
if $equal ='U'$ , $nig (j) > nvar$ , for $j = 1, 2, \dots, n_{g}$ .

7: $gmn (ldgmn, nvar)$ – Real (Kind=nag_wp) array Input

On entry: the

j

th row of gmn contains the means of the

p

variables for the

j

th group, for

j = 1, 2, \dots, n_{j}

. These are returned by g03daf.

8: $ldgmn$ – Integer Input

On entry: the first dimension of the array gmn as declared in the (sub)program from which g03dcf is called.

Constraint:

ldgmn \geq ng

9: $gc ((ng + 1) \times nvar \times (nvar + 1) / 2)$ – Real (Kind=nag_wp) array Input

On entry: the first

p (p + 1) / 2

elements of gc should contain the upper triangular matrix

R

and the next

n_{g}

blocks of

p (p + 1) / 2

elements should contain the upper triangular matrices

R_{j}

All matrices must be stored packed by column. These matrices are returned by g03daf. If

equal ='E'

only the first

p (p + 1) / 2

elements are referenced, if

equal ='U'

only the elements

p (p + 1) / 2 + 1

(n_{g} + 1) p (p + 1) / 2

are referenced.

Constraints:

if $equal ='E'$ , the diagonal elements of $R$ must be $\neq 0.0$ ;
if $equal ='U'$ , the diagonal elements of the $R_{j}$ must be $\neq 0.0$ , for $j = 1, 2, \dots, n_{g}$ .

10: $\det (ng)$ – Real (Kind=nag_wp) array Input

On entry: if

equal ='U'

. the logarithms of the determinants of the within-group variance-covariance matrices as returned by g03daf. Otherwise det is not referenced.

11: $nobs$ – Integer Input

On entry: the number of observations in x which are to be allocated.

Constraint:

nobs \geq 1

12: $m$ – Integer Input

On entry: the number of variables in the data array x.

Constraint:

m \geq nvar

13: $isx (m)$ – Integer array Input

On entry:

isx (l)

indicates if the

l

th variable in x is to be included in the distance calculations.

isx (l) > 0

, the

l

th variable is included, for

l = 1, 2, \dots, m

; otherwise the

l

th variable is not referenced.

Constraint:

isx (l) > 0

for nvar values of

l

14: $x (ldx, m)$ – Real (Kind=nag_wp) array Input

On entry:

x (k, l)

must contain the

k

th observation for the

l

th variable, for

k = 1, 2, \dots, nobs

and

l = 1, 2, \dots, m

15: $ldx$ – Integer Input

On entry: the first dimension of the array x as declared in the (sub)program from which g03dcf is called.

Constraint:

ldx \geq nobs

16: $prior (ng)$ – Real (Kind=nag_wp) array Input/Output

On entry: if

priors ='I'

, the prior probabilities for the

n_{g}

groups.

Constraint: if

priors ='I'

prior (j) > 0.0

and

| 1 - \sum_{j = 1}^{n_{g}} prior (j) | \leq 10 \times machine precision

, for

j = 1, 2, \dots, n_{g}

On exit: if

priors ='P'

, the computed prior probabilities in proportion to group sizes for the

n_{g}

groups.

priors ='I'

, the input prior probabilities will be unchanged.

priors ='E'

, prior is not set.

17: $p (ldp, ng)$ – Real (Kind=nag_wp) array Output

On exit:

p (k, j)

contains the posterior probability

p_{k j}

for allocating the

k

th observation to the

j

th group, for

k = 1, 2, \dots, nobs

and

j = 1, 2, \dots, n_{g}

18: $ldp$ – Integer Input

On entry: the first dimension of the array ati and the first dimension of the array p as declared in the (sub)program from which g03dcf is called.

Constraint:

ldp \geq nobs

19: $iag (nobs)$ – Integer array Output

On exit: the groups to which the observations have been allocated.

20: $atiq$ – Logical Input

On entry: atiq must be .TRUE. if atypicality indices are required. If atiq is .FALSE. the array ati is not set.

21: $ati (ldp, *)$ – Real (Kind=nag_wp) array Output

Note: the second dimension of the array ati must be at least

ng

atiq = .TRUE.

, and at least

1

otherwise.

On exit: if atiq is .TRUE.,

ati (k, j)

will contain the predictive atypicality index for the

k

th observation with respect to the

j

th group, for

k = 1, 2, \dots, nobs

and

j = 1, 2, \dots, n_{g}

If atiq is .FALSE., ati is not set.

22: $wk (2 \times nvar)$ – Real (Kind=nag_wp) array Workspace

23: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. 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

−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, $equal = ⟨ value ⟩$ .
Constraint: $equal ='E'$ or $'U'$ .

On entry, $ldgmn = ⟨ value ⟩$ and $ng = ⟨ value ⟩$ .
Constraint: $ldgmn \geq ng$ .

On entry, $ldp = ⟨ value ⟩$ and $nobs = ⟨ value ⟩$ .
Constraint: $ldp \geq nobs$ .

On entry, $ldx = ⟨ value ⟩$ and $nobs = ⟨ value ⟩$ .
Constraint: $ldx \geq nobs$ .

On entry, $m = ⟨ value ⟩$ and $nvar = ⟨ value ⟩$ .
Constraint: $m \geq nvar$ .

On entry, $ng = ⟨ value ⟩$ .
Constraint: $ng \geq 2$ .

On entry, $nobs = ⟨ value ⟩$ .
Constraint: $nobs \geq 1$ .

On entry, $nvar = ⟨ value ⟩$ .
Constraint: $nvar \geq 1$ .

On entry, $priors = ⟨ value ⟩$ .
Constraint: $priors ='E'$ , $'I'$ or $'P'$ .

On entry, $typ = ⟨ value ⟩$ .
Constraint: $typ ='E'$ or $'P'$ .

$ifail = 2$: On entry, $i = ⟨ value ⟩$ , $nig (i) = ⟨ value ⟩$ and $nvar = ⟨ value ⟩$ .
Constraint: $nig (i) < nvar$ .

On entry, $i = ⟨ value ⟩$ and $nig (i) = ⟨ value ⟩$ .
Constraint: $nig (i) > 0$ .

On entry, $nvar = ⟨ value ⟩$ and $⟨ value ⟩$ values of $isx > 0$ .
Constraint: exactly nvar elements of $isx > 0$ .

On entry, $\sum_{i} nig (i) \leq ng + nvar$ .

$ifail = 3$: On entry, $j = ⟨ value ⟩$ and $prior (j) = ⟨ value ⟩$ .
Constraint: $prior (j) > 0$ .

On entry, $\sum_{j} prior (j) \neq 1.0$ .

$ifail = 4$: On entry, a diagonal element of $R$ or $R_{j}$ is zero.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

The accuracy of the returned posterior probabilities will depend on the accuracy of the input

R

R_{j}

matrices. The atypicality index should be accurate to four significant places.

8 Parallelism and Performance

g03dcf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The distances

D_{k j}^{2}

can be computed using g03dbf if other forms of discrimination are required.

10 Example

The data, taken from Aitchison and Dunsmore (1975), is concerned with the diagnosis of three ‘types’ of Cushing's syndrome. The variables are the logarithms of the urinary excretion rates (mg/24hr) of two steroid metabolites. Observations for a total of

21

patients are input and the group means and

R

matrices are computed by g03daf. A further six observations of unknown type are input and allocations made using the predictive approach and under the assumption that the within-group covariance matrices are not equal. The posterior probabilities of group membership,

q_{j}

, and the atypicality index are printed along with the allocated group. The atypicality index shows that observations

5

and

6

do not seem to be typical of the three types present in the initial

21

observations.

g03dc: FL CL CPP AD

NAG FL Interfaceg03dcf (discrim_​group)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
g03dcf (discrim_group)