Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox Chapter IntroductionG03 — multivariate methods

## Scope of the Chapter

This chapter is concerned with methods for studying multivariate data. A multivariate dataset consists of several variables recorded on a number of objects or individuals. Multivariate methods can be classified as those that seek to examine the relationships between the variables (e.g., principal components), known as variable-directed methods, and those that seek to examine the relationships between the objects (e.g., cluster analysis), known as individual-directed methods.
Multiple regression is not included in this chapter as it involves the relationship of a single variable, known as the response variable, to the other variables in the dataset, the explanatory variables. Routines for multiple regression are provided in Chapter G02.

## Background to the Problems

### Variable-directed Methods

Let the $n$ by $p$ data matrix consist of $p$ variables, ${x}_{1},{x}_{2},\dots ,{x}_{p}$, observed on $n$ objects or individuals. Variable-directed methods seek to examine the linear relationships between the $p$ variables with the aim of reducing the dimensionality of the problem. There are different methods depending on the structure of the problem. Principal component analysis and factor analysis examine the relationships between all the variables. If the individuals are classified into groups, then canonical variate analysis examines the between group structure. If the variables can be considered as coming from two sets, then canonical correlation analysis examines the relationships between the two sets of variables. All four methods are based on an eigenvalue decomposition or a singular value decomposition (SVD) of an appropriate matrix.
The above methods may reduce the dimensionality of the data from the original $p$ variables to a smaller number, $k$, of derived variables that adequately represent the data. In general, these $k$ derived variables will be unique only up to an orthogonal rotation. Therefore, it may be useful to see if there exists suitable rotations of these variables that lead to a simple interpretation of the new variables in terms of the original variables.

#### Principal component analysis

Principal component analysis finds new variables which are linear combinations of the $p$ observed variables so that they have maximum variation and are orthogonal (uncorrelated).
Let $S$ be the $p$ by $p$ variance-covariance matrix of the $n$ by $p$ data matrix. A vector ${a}_{1}$ of length $p$ is found such that
 $a1TSa1​ is maximized subject to ​a1Ta1=1.$
The variable ${z}_{1}=\sum _{i=1}^{p}{a}_{1i}{x}_{i}$ is known as the first principal component and gives the linear combination of the variables that gives the maximum variation. A second principal component, ${z}_{2}=\sum _{i=1}^{p}{a}_{2i}{x}_{i}$, is found such that
 $a2TSa2​ is maximized subject to ​a2Ta2=1​ and ​a2Ta1=0.$
This gives the linear combination of variables, orthogonal to the first principal component, that gives the maximum variation. Further principal components are derived in a similar way.
The vectors ${a}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,p$, are the eigenvectors of the matrix $S$ and associated with each eigenvector is the eigenvalue, ${\gamma }_{i}^{2}$. The value of ${\gamma }_{i}^{2}/\sum {\gamma }_{i}^{2}$ gives the proportion of variation explained by the $i$th principal component. Alternatively, the ${a}_{i}$ can be considered as the right singular vectors in a SVD of a scaled mean-centred data matrix. The singular values of the SVD are the ${\gamma }_{i}$-values.
Often fewer than $p$ dimensions (principal components) are needed to represent most of the variation in the data. A test on the smaller eigenvalues can be used to investigate the number of dimensions needed.
The values of the principal component variables for the individuals are known as the principal component scores. These can be standardized so that the variance of these scores for each principal component is $1.0$ or equal to the corresponding eigenvalue. The principal component scores correspond to the left-hand singular vectors in the SVD.

#### Factor analysis

Let the $p$ variables have variance-covariance matrix $\Sigma$. The aim of factor analysis is to account for the covariances in these $p$ variables in terms of a smaller number, $k$, of hypothetical variables or factors, ${f}_{1},{f}_{2},\dots ,{f}_{k}$. These are assumed to be independent and to have unit variance. The relationship between the observed variables and the factors is given by the model
 $xi=∑j=1kλijfj+ei, i=1,2,…,p$
where ${\lambda }_{\mathit{i}\mathit{j}}$, for $\mathit{i}=1,2,\dots ,p$ and $\mathit{j}=1,2,\dots ,k$, are the factor loadings and ${e}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,p$, are independent random variables with variances ${\psi }_{i}$. These represent the unique component of the variation of each observed variable. The proportion of variation for each variable accounted for by the factors is known as the communality.
The model for the variance-covariance matrix, $\Sigma$, can then be written as
 $Σ=ΛΛT+Ψ,$
where $\Lambda$ is the matrix of the factor loadings, ${\lambda }_{ij}$, and $\Psi$ is a diagonal matrix of the unique variances ${\psi }_{i}$.
If it is assumed that both the $k$ factors and the ${e}_{i}$ follow independent Normal distributions then the parameters of the model, $\Lambda$ and $\Psi$, can be estimated by maximum likelihood, as described by Lawley and Maxwell (1971). The computation of the maximum likelihood estimates is an iterative procedure which involves computing the eigenvalues and eigenvectors of the matrix
 $S*=Ψ-1/2SΨ-1/2,$
where $S$ is the sample variance-covariance matrix. Alternatively, the SVD of the matrix $R{\Psi }^{-1/2}$ can be used, where ${R}^{\mathrm{T}}R=S$. When convergence has been achieved, the estimates $\stackrel{^}{\Lambda }$, of $\Lambda$, are obtained by scaling the eigenvectors of ${S}^{*}$. The use of maximum likelihood estimation means that likelihood ratio tests can be constructed to test for the number of factors required.
Having found the estimates of the parameters of the model, the estimates of the values of the factors for the individuals, the factor scores, can be computed. These involve the calculation of the factor score coefficients. Two common methods of computing factor score coefficients are the regression method and Bartlett's method. Bartlett's method gives unbiased estimates of the factor scores while the estimates from the regression method are biased but have smaller variance; see Lawley and Maxwell (1971).

#### Canonical variate analysis

If the individuals can be classified into one of $g$ groups, then canonical variate analysis finds the linear combinations of the $p$ variables that maximize the ratio of the between-group variation to the within-group variation. These variables are known as canonical variates. As the canonical variates provide discrimination between the groups, the method is also known as canonical discrimination.
The canonical variates can be calculated from the eigenvectors of the within-group sums of squares and cross-products matrix or from the SVD of the matrix
 $V=QxTQg,$
where ${Q}_{g}$ is an orthogonal matrix that defines the groups and ${Q}_{x}$ is the first $p$ columns of the orthogonal matrix $Q$ from the $QR$ decomposition of the data matrix with the variable means subtracted. If the data matrix is not of full rank, the ${Q}_{x}$ matrix can be obtained from a SVD. If the SVD of $V$ is
 $V=UxΔUgT,$
then the nonzero elements (${\delta }_{i}>0$) of the diagonal matrix $\Delta$ are the canonical correlations. The largest ${\delta }_{i}$ is called the first canonical correlation and associated with it is the first canonical variate.
The eigenvalues, ${\gamma }_{i}^{2}$, of the within-group sums of squares matrix are given by
 $γi2=δi2 1-δi2 .$
The value of ${\pi }_{i}={\gamma }_{i}^{2}/\sum {\gamma }_{i}^{2}$ gives the proportion of variation explained by the $i$th canonical variate. The values of the ${\pi }_{i}$ give an indication as to how many canonical variates are needed to adequately describe the data, i.e., the dimensionality of the problem. The number of dimensions can be investigated by means of a test on the smaller canonical correlations.
The canonical variate loadings and the relationship between the original variables and the canonical variates are calculated from the matrix ${U}_{x}$. This matrix is scaled so that the canonical variates have unit variance.

#### Canonical correlation analysis

If the $p$ variables can be considered as coming from two sets then canonical correlation analysis finds linear combinations of the variables in each set, known as canonical variates, such that the correlations between corresponding canonical variates for the two sets are maximized. Let the two sets of variables be denoted by $x$ and $y$, with ${p}_{x}$ and ${p}_{y}$ variables in each set respectively. Let the variance-covariance of the dataset be
 $S= Sxx Sxy Syx Syy$
and let
 $Σ=Syy -1SyxSxx -1Sxy,$
then the canonical correlations can be calculated from the eigenvalues of the matrix $\Sigma$. Alternatively, the canonical correlations can be calculated by means of a SVD of the matrix
 $V=QxTQy,$
where ${Q}_{x}$ is the first ${p}_{x}$ columns of the orthogonal matrix $Q$ from the $QR$ decomposition of the $x$-variables in the data matrix, and ${Q}_{y}$ is the first ${p}_{y}$ columns of the $Q$ matrix of the $QR$ decomposition of the $y$-variables in the data matrix. In both cases, the variable means are subtracted before the $QR$ decomposition is computed. If either set of variables is not of full rank, an SVD can be used instead of the $QR$ decomposition. If the SVD of $V$ is
 $V=UxΔUyT,$
then the nonzero elements (${\delta }_{i}>0$) of the diagonal matrix $\Delta$ are the canonical correlations. The largest ${\delta }_{i}$ is called the first canonical correlation and associated with it is the first canonical variate. The eigenvalues, ${\gamma }_{i}^{2}$, of the matrix $\Sigma$ are given by
 $γi2=δi2 1+δi2 .$
The value of ${\pi }_{i}={\gamma }_{i}^{2}/\sum {\gamma }_{i}^{2}$ gives the proportion of variation explained by the $i$th canonical variate. The values of the ${\pi }_{i}$ give an indication as to how many canonical variates are needed to adequately describe the data, i.e., the dimensionality of the problem; this can also be investigated by means of a test on the smaller values of the ${\gamma }_{i}^{2}$.
The relationship between the canonical variables and the original variables, the canonical variate loadings, can be computed from the ${U}_{x}$ and ${U}_{y}$ matrices.

#### Rotations

There are two principal reasons for using rotations: either
 (a) simplifying the structure to aid interpretation of derived variables, or (b) comparing two or more datasets or sets of derived variables.
The most common type of rotations used for (a) are orthogonal rotations. If $\Lambda$ is the $p$ by $k$ loading matrix from a variable-directed multivariate method, then the rotations are selected such that the elements, ${\lambda }_{ij}^{*}$, of the rotated loading matrix, ${\Lambda }^{*}$, are either relatively large or small. The rotations may be found by minimizing the criterion
 $V=∑j=1k∑i=1p λij* 4-γp∑j=1k ∑i=1p λij* 2 2$
where the constant, $\gamma$, gives a family of rotations, with $\gamma =1$ giving varimax rotations and $\gamma =0$ giving quartimax rotations.
Given an orthogonal rotation matrix $X$, a solution may be further simplified by removing the orthogonality restriction with an oblique ProMax rotation. Let $Y$ denote the matrix defined by a power transformation of $X$, designed to increase high values in $X$ and decrease low values. Then the ProMax solution is based on a least squares fit of $X$ to $Y$.
For (b) Procrustes rotations are used. Let $A$ and $B$ be two $l$ by $m$ matrices, which can be considered as representing $l$ points in $m$ dimensions. One example is if $A$ is the loading matrix from a variable-directed multivariate method and $B$ is a hypothesised pattern matrix. In order to try to match the points in $A$ and $B$ there are three steps:
 (i) translate so that centroids of both matrices are at the origin, (ii) find a rotation that minimizes the sum of squared distances between corresponding points of the matrices, (iii) scale the matrices.
For a more detailed description, see Krzanowski (1990).

### Individual-directed Methods

While dealing with the same $n$ by $p$ data matrix as variable-directed methods, the emphasis is the $n$ objects or individuals rather than the $p$ variables. The methods are generally based on an $n$ by $n$ distance or dissimilarity matrix such that the ($k,j$)th element gives a measure of how ‘far apart’ the individuals $k$ and $j$ are. Alternatively, a similarity matrix can be used which measures how ‘close’ individuals are. The form of the measure of distance or similarity will depend upon the form of the $p$ variables. For continuous variables it is usually assumed that some form of Euclidean distance is suitable. That is, for ${x}_{ki}$ and ${x}_{ji}$ measured for individuals $k$ and $j$ on variable $i$ respectively, the contribution to distance between individuals $k$ and $j$ from variable $i$ is given by
 $xki-xji 2.$
Often there will be a need to scale the variables to produce satisfactory distances. For discrete variables, there are various measures of similarity or distance that can easily be computed. For example, for binary data a measure of similarity could be
• $1$ – if the individuals take the same value,
• $0$ – otherwise.
Given a measure of distance between individuals, there are three basic tasks that can be performed.
 (i) Group the individuals; that is, collect the individuals into groups so that those within a group are closer to each other than they are to members of another group. (ii) Classify individuals; that is, if some individuals are known to come from certain groups, allocate individuals whose group membership is unknown, to the nearest group. (iii) Map the individuals; that is, produce a multidimensional diagram in which the distances on the diagram represent the distances between the individuals.
In the above, (i) leads to cluster analysis, (ii) leads to discriminant analysis and (iii) leads to scaling methods.

#### Hierarchical cluster analysis

Approaches for cluster analysis can be classified into two types: hierarchical and non-hierarchical. Hierarchical cluster analysis produces a series of overlapping groups or clusters ranging from separate individuals to one single cluster. For example, five individuals could be hierarchically clustered as follows.
 Step 1 $\left(1\right)$ $\left(2\right)$ $\left(3\right)$ $\left(4\right)$ $\left(5\right)$ Step 2 $\left(1,2\right)$ $\left(3\right)$ $\left(4\right)$ $\left(5\right)$ Step 3 $\left(1,2\right)$ $\left(3,4\right)$ $\left(5\right)$ Step 4 $\left(1,2\right)$ $\left(3,4,5\right)$ Step 5 $\left(1,2,3,4,5\right)$
The clusters at a level are constructed from the clusters at a previous level. There are two basic approaches to hierarchical cluster analysis: agglomerative methods which build up clusters starting from individuals until there is only one cluster, or divisive methods which start with a single cluster and split clusters until the individual level is reached. This chapter contains the more common agglomerative methods.
The stages in a hierarchical cluster analysis are usually as follows.
 (i) form a distance matrix; (ii) use selected criterion to form hierarchy; (iii) print cluster information in the form of a dendrogram or use information to form a set of clusters.
These three stages will be considered in turn.
(i) Form a distance matrix
For the $n$ by $p$ data matrix $X$, a general measure of the distance between object $j$ and object $k$, ${d}_{jk}$, is
 $djk= ∑i=1pDxji/si,xki/si α,$
where ${x}_{ji}$ and ${x}_{ki}$ are the $\left(j,i\right)$th and $\left(k,i\right)$th elements of $X$, ${s}_{i}$ is a standardization for the $i$th variable and $D\left(u,v\right)$ is a suitable function. Three common distances for continuous variables are:
 (a) Euclidean distance: $D\left(u,v\right)={\left(u-v\right)}^{2}$ and $\alpha =\frac{1}{2}$. (b) Euclidean squared distance: $D\left(u,v\right)={\left(u-v\right)}^{2}$ and $\alpha =1$. (c) Absolute distance (city block metric): $D\left(u,v\right)=\left|u-v\right|$ and $\alpha =1$.
The common standardizations are the standard deviation and the range. For dichotomous variables there are a number of different measures (see Krzanowski (1990) and Everitt (1974)); these are usually easy to compute. If the individuals in a cluster analysis are themselves variables, then a suitable distance measure will be based on the correlation coefficient for continuous variables and contingency table statistics for discrete data.
(ii) Form Hierarchy
Given a distance matrix for the $n$ individuals, an agglomerative clustering method produces a hierarchical tree by starting with $n$ clusters, each with a single individual and then at each of $n-1$ stages, merging two clusters to form a larger cluster until all individuals are in a single cluster. At each stage, the two clusters that are nearest are merged to form a new cluster and a new distance matrix is computed for the reduced number of clusters.
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}_{ij}$, ${d}_{ik}$ and ${d}_{jk}$ be the distances between the clusters. If clusters $j$ and $k$, are to be merged to give cluster $jk$, then the distance from cluster $i$ to cluster $jk$, ${d}_{i.jk}$, can be computed in the following ways.
 (a) Single link or nearest neighbour: ${d}_{i.jk}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({d}_{ij},{d}_{ik}\right)$. (b) Complete link or furthest neighbour: ${d}_{i.jk}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({d}_{ij},{d}_{ik}\right)$. (c) Group average: ${d}_{i.jk}=\frac{{n}_{j}}{{n}_{j}+{n}_{k}}{d}_{ij}+\frac{{n}_{k}}{{n}_{j}+{n}_{k}}{d}_{ik}$. (d) Centroid: ${d}_{i.jk}=\frac{{n}_{j}}{{n}_{j}+{n}_{k}}{d}_{ij}+\frac{{n}_{k}}{{n}_{j}+{n}_{k}}{d}_{ik}-\frac{{n}_{j}{n}_{k}}{{\left({n}_{j}+{n}_{k}\right)}^{2}}{d}_{jk}$. (e) Median: ${d}_{i.jk}=\frac{1}{2}{d}_{ij}+\frac{1}{2}{d}_{ik}-\frac{1}{4}{d}_{jk}$. (f) Minimum variance: ${d}_{i.jk}=\left[\left({n}_{i}+{n}_{j}\right){d}_{ij}+\left({n}_{i}+{n}_{k}\right){d}_{ik}-{n}_{i}{d}_{jk}\right]/\left({n}_{i}+{n}_{j}+{n}_{k}\right)$.
For further details, see Everitt (1974) or Krzanowski (1990).
(iii) Produce Dendrogram and Clusters
Hierarchical cluster analysis can be represented by a tree that shows at which distance the clusters merge. Such a tree is known as a dendrogram; see Everitt (1974) and Krzanowski (1990).
A simple example is
Figure 1
The end points of the dendrogram represent the individuals that have been clustered.
Alternatively, the information from the tree can be used to produce either a chosen number of clusters or the clusters that exist at a given distance. The latter is equivalent to taking the dendrogram and drawing a line across at a given distance to produce clusters.

#### Non-hierarchical clustering

Non-hierarchical cluster analysis usually forms a given number of clusters from the data. There is no requirement that if first $k-1$ and then $k$ clusters were requested then the $k-1$ clusters would be formed from the $k$ clusters.
Most non-hierarchical methods of cluster analysis seek to partition the set of individuals into a number of clusters so as to optimize a criterion. The number of clusters is usually specified prior to the analysis. One commonly used criterion is the within-cluster sum of squares. Given $n$ individuals with $p$ variables measured on each individual, ${x}_{\mathit{i}\mathit{j}}$, for $\mathit{i}=1,2,\dots ,n$ and $\mathit{j}=1,2,\dots ,p$, the within-cluster sum of squares for $K$ clusters is
 $SSc=∑k=1K∑i∈Sk ∑j=1p xij-x-kj 2,$
where ${S}_{k}$ is the set of objects in the $k$th cluster and ${\stackrel{-}{x}}_{kj}$ is the mean for the variable $j$ over cluster $k$. Starting with an initial allocation of individuals to clusters, the method then seeks to minimize ${\mathrm{SS}}_{c}$ by a series of re-allocations. This is often known as $K$-means clustering.
In the $K$-means case individuals belong to a single cluster and are excluded from all remaining clusters. Alternatively, probabilities of cluster membership can be estimated and each cluster can have its own distributional properties. For example, given an initial set of probabilities, the Normal (Gaussian) mixture model uses the E–M method of Dempster et al. (1977) to maximize the sum of log-likelihoods over $K$ clusters for a given covariance model ranging from pooled variance to individual covariance matrices.

#### Discriminant analysis

Discriminant analysis is concerned with the allocation of objects to ${n}_{g}$ groups on the basis of observations on those objects using an allocation rule. This rule is computed from observations coming from a training set in which group membership is known. The allocation rule is based on the distance between the object and an estimate of the location of the groups. If $p$ variables are observed and the vector of means for the $j$th group in the training set are ${\stackrel{-}{x}}_{j}$ then the usual measure of the distance of an observation, ${x}_{k}$, from the $j$th group mean is given by Mahalanobis squared distance
 $Dkj2=xk-x-jTS*-1xk-x-j,$
where ${S}_{*}$ is either the within-group variance-covariance matrix, ${S}_{j}$, for the ${n}_{j}$ objects in the $j$th group, or a pooled variance-covariance matrix, $S$, computed from all $n$ objects from all groups where
 $S=∑j=1ngnj-1Sj n-ng .$
If the within-group variance-covariance matrices can be assumed to be equal then the pooled variance-covariance matrix can be used. This assumption can be tested using the test statistic
 $G=C n-nglogS-∑j= 1ngnj- 1logSj ,$
where
 $C=1-2p2+3p-1 6p+1ng-1 ∑j=1ng1 nj-1 -1 n-ng .$
For large $n$, $G$ is approximately distributed as a ${\chi }^{2}$ variable with $\frac{1}{2}p\left(p+1\right)\left({n}_{g}-1\right)$ degrees of freedom; see Morrison (1967).
In addition to the distances, a set of prior probabilities of group membership, ${\pi }_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,{n}_{g}$, may be used. The prior probabilities reflect your view as to the likelihood of the objects coming from the different groups.
It is generally assumed that the $p$ variables follow a multivariate Normal distribution with, for the $j$th group, mean ${\mu }_{j}$ and variance-covariance matrix ${\Sigma }_{j}$. If $p\left({x}_{k}\mid {\mu }_{j},{\Sigma }_{j}\right)$ is the probability of observing the observation ${x}_{k}$ from group $j$, then the posterior probability of belonging to group $j$ is
 $p j∣xk,μj,Σj∝ p xk∣ μj ,Σj πj .$
An observation is allocated to the group with the highest posterior probability.
In the estimative approach to discrimination, the parameters ${\mu }_{j}$ and ${\Sigma }_{j}$ in $p\left(j\mid {x}_{k},{\mu }_{j},{\Sigma }_{j}\right)$ are replaced by their estimates calculated from the training set. If it is assumed that the within-group variance-covariance matrices are equal then the linear discriminant function is obtained; otherwise if it is assumed that the variance-covariance matrices are unequal then the quadratic discriminant function is obtained.
In the Bayesian predictive approach, a non-informative prior distribution is used for the parameters giving the posterior distribution for the parameters from the training set, ${X}_{t}$, of, $p\left({\mu }_{j},{\Sigma }_{j}\mid {X}_{t}\right)$. A predictive distribution is then obtained by integrating $p\left(j\mid {x}_{k},{\mu }_{j},{\Sigma }_{j}\right)p\left({\mu }_{j},{\Sigma }_{j}\mid X\right)$ over the parameter space. This predictive distribution, $p\left({x}_{k}\mid {X}_{t}\right)$, then replaces $p\left({x}_{k}\mid {\mu }_{j},{\Sigma }_{j}\right)$ to give
 $p j∣xk,μj,Σj∝ p xk∣ Xt πj .$
In addition to allocating the objects to groups, an atypicality index for each object and for each group can be computed. This represents the probability of obtaining an observation more typical of the group than that observed. A high value of the atypicality index for all groups indicates that the observation may in fact come from a group not represented in the training set.
Alternative approaches to discrimination are the use of canonical variates and logistic discrimination. Canonical variate analysis is described above and as it seeks to find the directions that best discriminate between groups these directions can also be used to allocate further observations. This can be viewed as an extension of Fisher's linear discriminant function. This approach does not assume that the data is Normally distributed, but Fisher's linear discriminant function may not perform well on non-Normal data. In the case of two groups, logistic regression can be performed with the response variable indicating the group allocation and the variables in the discriminant analysis being the explanatory variables. Allocation can then be made on the basis of the fitted response value. This is known as logistic discrimination and can be shown to be valid for a wide range of distributional assumptions.

#### Scaling methods

Scaling methods seek to represent the observed dissimilarities or distances between objects as distances between points in Euclidean space. For example if the distances between objects A, B and C were $3$, $4$ and $5$, the distances could be represented exactly by three points in two-dimensional space. Only their relative positions would be important, the whole configuration of points could be rotated or shifted without effecting the distances between the points. If a one-dimensional representation was required, the ‘best’ representation might give distances of $2\frac{1}{3},3\frac{1}{3}$ and $5\frac{2}{3}$, which may be an adequate representation. If the distances were $3$, $4$ and $8$ then these distances could not be exactly represented in Euclidean space, even in two dimensions, the best representation being the three points in a straight line giving distances $3$, $4$ and $7$.
In practice, the use of scaling methods has to decide upon the number of dimensions in which the data is to be represented. The smaller the number the easier it will be to assimilate the information. The chosen number of dimensions needs to give an adequate representation of the data but will often not give an exact representation because either the number of chosen dimensions is too small or the data cannot be represented in Euclidean space.
Two basic methods are available depending on the nature of the dissimilarities or distances being analysed. If the distances can be assumed to satisfy the metric inequality
 $dij≤dik+dkj,$
then the distances can be represented exactly by points in Euclidean space and the technique known as metric scaling, classical scaling or principal coordinate analysis can be used. This technique involves the computing of the eigenvalues of a matrix derived from the distance matrix. The eigenvectors corresponding to the $k$ largest positive eigenvalues gives the best $k$ dimensions in which to represent the objects. If there are negative eigenvalues then the distance matrix cannot be represented in Euclidean space.
Instead of the above approach of requiring the distances from the points to match the distances from the objects as closely as possible, sometimes only a rank order equivalence is required. That is, the $i$th largest distance between objects should, as far as possible, be represented by the $i$th largest distance between points. This would be appropriate when the dissimilarities are based on subjective rankings. For example, if the objects were foods then a number of judges rank the foods for different qualities such as taste and texture, the resulting distances would not necessarily obey the metric inequality, but the rank order would be significant. Alternatively, by relaxing the requirement from matching distances to rank order equivalence only, the number of dimensions required to represent the distance matrix may be decreased. The requirement of rank order equivalence leads to non-metric or ordinal multidimensional scaling. The criterion used to measure the closeness of the fitted distance matrix to the observed distance matrix is known as STRESS, which is given by
 $∑i=1n∑j=1 i-1 dij^-dij~ 2 ∑i=1n∑j=1 i-1dij2^ ,$
where $\stackrel{^}{{d}_{ij}^{2}}$ is the Euclidean squared distance between the computed points $i$ and $j$, and $\stackrel{~}{{d}_{ij}}$ is the fitted distance obtained when $\stackrel{^}{{d}_{ij}}$ is monotonically regressed on the observed distances ${d}_{ij}$; that is, $\stackrel{~}{{d}_{ij}}$ is monotonic relative to ${d}_{ij}$ and is obtained from $\stackrel{^}{{d}_{ij}}$ with the smallest number of changes. Thus STRESS is a measure of by how much the set of points preserve the order of the distances in the original distance matrix, and non-metric multidimensional scaling seeks to find the set of points that minimize the STRESS.

## Recommendations on Choice and Use of Available Functions

See Functionality Index for a list of functions available in this Chapter.
Note also that nag_correg_glm_binomial (g02gb) will fit a logistic regression model and can be used for logistic discrimination.

## Functionality Index

 Canonical variate analysis nag_mv_canon_var (g03ac)
 Cluster Analysis,
 compute distance matrix nag_mv_distance_mat (g03ea)
 construct clusters following nag_mv_cluster_hier (g03ec) nag_mv_cluster_hier_indicator (g03ej)
 construct dendrogram following nag_mv_cluster_hier (g03ec) nag_mv_cluster_hier_dendrogram (g03eh)
 Gaussian mixture model nag_mv_gaussian_mixture (g03ga)
 hierarchical nag_mv_cluster_hier (g03ec)
 K-means nag_mv_cluster_kmeans (g03ef)
 Discriminant Analysis,
 allocation of observations to groups, following nag_mv_discrim (g03da) nag_mv_discrim_group (g03dc)
 Mahalanobis squared distances, following nag_mv_discrim (g03da) nag_mv_discrim_mahal (g03db)
 test for equality of within-group covariance matrices nag_mv_discrim (g03da)
 Factor Analysis,
 factor score coefficients, following nag_mv_factor (g03ca) nag_mv_factor_score (g03cc)
 maximum likelihood estimates of parameters nag_mv_factor (g03ca)
 Principal component analysis nag_mv_prin_comp (g03aa)
 Rotations,
 Procustes rotations nag_mv_rot_procrustes (g03bc)
 ProMax rotations nag_mv_rot_promax (g03bd)
 Scaling Methods,
 multidimensional scaling nag_mv_multidimscal_ordinal (g03fc)
 principal coordinate analysis nag_mv_multidimscal_metric (g03fa)
 Standardize values of a data matrix nag_mv_z_scores (g03za)

## References

Chatfield C and Collins A J (1980) Introduction to Multivariate Analysis Chapman and Hall
Dempster A P, Laird N M and Rubin D B (1977) Maximum likelihood from incomplete data via the $EM$ algorithm (with discussion) J. Roy. Statist. Soc. Ser. B 39 1–38
Everitt B S (1974) Cluster Analysis Heinemann
Gnanadesikan R (1977) Methods for Statistical Data Analysis of Multivariate Observations Wiley
Hammarling S (1985) The singular value decomposition in multivariate statistics SIGNUM Newsl. 20(3) 2–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
Lawley D N and Maxwell A E (1971) Factor Analysis as a Statistical Method (2nd Edition) Butterworths
Morrison D F (1967) Multivariate Statistical Methods McGraw–Hill