Integer, Intent (In)	::	method, n
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	ilc(n-1), iuc(n-1), iord(n), iwk(2*n)
Real (Kind=nag_wp), Intent (Inout)	::	d(n*(n-1)/2)
Real (Kind=nag_wp), Intent (Out)	::	cd(n-1), dord(n)

C Header Interface

#include nagmk26.h

void	g03ecf_ ( const Integer method, const Integer n, double d[], Integer ilc[], Integer iuc[], double cd[], Integer iord[], double dord[], Integer iwk[], Integer *ifail)

3

Description

Given a distance or dissimilarity matrix for

n

objects (see g03eaf), cluster analysis aims to group the

n

objects into a number of more or less homogeneous groups or clusters. With agglomerative clustering methods, a hierarchical tree is produced by starting with

n

clusters, each with a single object and then at each of

n - 1

stages, merging two clusters to form a larger cluster, until all objects are in a single cluster. This process may be represented by a dendrogram (see g03ehf).

At each stage, the clusters that are nearest are merged, methods differ as to how the distances between the new cluster and other clusters are computed. For three clusters

i

j

and

k

let

n_{i}

n_{j}

and

n_{k}

be the number of objects in each cluster and let

d_{i j}

d_{i k}

and

d_{j k}

be the distances between the clusters. Let clusters

j

and

k

be merged to give cluster

j k

, then the distance from cluster

i

to cluster

j k

d_{i . j k}

can be computed in the following ways.

1.	Single link or nearest neighbour : $d_{i . j k} = \min (d_{i j}, d_{i k})$ .
2.	Complete link or furthest neighbour : $d_{i . j k} = \max (d_{i j}, d_{i k})$ .
3.	Group average : $d_{i . j k} = \frac{n_{j}}{n_{j} + n_{k}} d_{i j} + \frac{n_{k}}{n_{j} + n_{k}} d_{i k}$ .
4.	Centroid : $d_{i . j k} = \frac{n_{j}}{n_{j} + n_{k}} d_{i j} + \frac{n_{k}}{n_{j} + n_{k}} d_{i k} - \frac{n_{j} n_{k}}{{(n_{j} + n_{k})}^{2}} d_{j k}$ .
5.	Median : $d_{i . j k} = \frac{1}{2} d_{i j} + \frac{1}{2} d_{i k} - \frac{1}{4} d_{j k}$ .
6.	Minimum variance : $d_{i . j k} = \{(n_{i} + n_{j}) d_{i j} + (n_{i} + n_{k}) d_{i k} - n_{i} d_{j k}\} / (n_{i} + n_{j} + n_{k})$ .

For further details see Everitt (1974) or Krzanowski (1990).

If the clusters are numbered

1, 2, \dots, n

then, for convenience, if clusters

j

and

k

j < k

, merge then the new cluster will be referred to as cluster

j

. Information on the clustering history is given by the values of

j

k

and

d_{j k}

for each of the

n - 1

clustering steps. In order to produce a dendrogram, the ordering of the objects such that the clusters that merge are adjacent is required. This ordering is computed so that the first element is

1

. The associated distances with this ordering are also computed.

4

References

Everitt B S (1974) Cluster Analysis Heinemann

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

5

Arguments

1: $method$ – IntegerInput

On entry: indicates which clustering method is used.

$method = 1$: Single link.
$method = 2$: Complete link.
$method = 3$: Group average.
$method = 4$: Centroid.
$method = 5$: Median.
$method = 6$: Minimum variance.

Constraint:

method = 1

2

3

4

5

6

2: $n$ – IntegerInput

On entry:

n

, the number of objects.

Constraint:

n \geq 2

3: $d (n \times (n - 1) / 2)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the strictly lower triangle of the distance matrix.

D

must be stored packed by rows, i.e.,

d ((i - 1) (i - 2) / 2 + j)

i > j

must contain

d_{i j}

On exit: is overwritten.

Constraint:

d (i) \geq 0.0

, for

i = 1, 2, \dots, n (n - 1) / 2

4: $ilc (n - 1)$ – Integer arrayOutput

On exit:

ilc (l)

contains the number,

j

, of the cluster merged with cluster

k

(see iuc),

j < k

, at step

l

, for

l = 1, 2, \dots, n - 1

5: $iuc (n - 1)$ – Integer arrayOutput

On exit:

iuc (l)

contains the number,

k

, of the cluster merged with cluster

j

j < k

, at step

l

, for

l = 1, 2, \dots, n - 1

6: $cd (n - 1)$ – Real (Kind=nag_wp) arrayOutput

On exit:

cd (l)

contains the distance

d_{j k}

, between clusters

j

and

k

j < k

, merged at step

l

, for

l = 1, 2, \dots, n - 1

7: $iord (n)$ – Integer arrayOutput

On exit: the objects in dendrogram order.

8: $dord (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the clustering distances corresponding to the order in iord.

dord (l)

contains the distance at which cluster

iord (l)

and

iord (l + 1)

merge, for

l = 1, 2, \dots, n - 1

dord (n)

contains the maximum distance.

9: $iwk (2 \times n)$ – Integer arrayWorkspace

10: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation 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 argument, 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

- 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,	$method \neq 1$ , $2$ , $3$ , $4$ , $5$ or $6$ ,
or	$n < 2$ .

$ifail = 2$

On entry,

d (i) < 0.0

for some

i = 1, 2, \dots, n (n - 1) / 2

$ifail = 3$: A true dendrogram cannot be formed because the distances at which clusters have merged are not increasing for all steps, i.e., $cd (l) < cd (l - 1)$ for some $l = 2, 3, \dots, n - 1$ . This can occur for the median and centroid methods.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

For

method \geq 3

slight rounding errors may occur in the calculations of the updated distances. These would not normally significantly affect the results, however there may be an effect if distances are (almost) equal.

If at a stage, two distances

d_{i j}

and

d_{k l}

, (

i < k

) or (

i = k

), and

j < l

, are equal then clusters

k

and

l

will be merged rather than clusters

i

and

j

. For single link clustering this choice will only affect the order of the objects in the dendrogram. However, for other methods the choice of

k l

rather than

i j

may affect the shape of the dendrogram. If either of the distances

d_{i j}

and

d_{k l}

is affected by rounding errors then their equality, and hence the dendrogram, may be affected.

8

Parallelism and Performance

g03ecf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

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 dendrogram may be formed using g03ehf. Groupings based on the clusters formed at a given distance can be computed using g03ejf.

10

Example

Data consisting of three variables on five objects are read in. Euclidean squared distances based on two variables are computed using g03eaf, the objects are clustered using g03ecf and the dendrogram computed using g03ehf. The dendrogram is then printed.

NAG Library Routine Document

g03ecf (cluster_hier)

▸▿ 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

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