naginterfaces.library.mv.multidimscal_​metric

naginterfaces.library.mv.multidimscal_metric(roots, n, d, ndim)

multidimscal_metric performs a principal coordinate analysis also known as classical metric scaling.

For full information please refer to the NAG Library document for g03fa

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/g03/g03faf.html

Parameters

rootsstr, length 1

Indicates if all the eigenvalues are to be computed or just the $ndim$ largest.

$roots=\text{'A'}$

All the eigenvalues are computed.

$roots=\text{'L'}$

Only the largest $ndim$ eigenvalues are computed.

nint

$n$, the number of objects in the distance matrix.

dfloat, array-like, shape $(n\times (n-1)/2)$

The lower triangle of the distance matrix $D$ stored packed by rows. That is $d[(i-1)\times (i-2)/2+j-1]$ must contain $d_{ij}$ for $i=2,3,\dots ,n\text{;}j=1,2,\dots ,i-1$.

ndimint

$k$, the number of dimensions used to represent the data.

Returns

xfloat, ndarray, shape $(n,ndim)$

The $i$th row contains $k$ coordinates for the $i$th point, $i=1,2,\dots ,n$.

eigvalfloat, ndarray, shape $\left(n\right)$

If $roots=\text{'A'}$, $eigval$ contains the $n$ scaled eigenvalues of the matrix $E$.

If $roots=\text{'L'}$, $eigval$ contains the largest $k$ scaled eigenvalues of the matrix $E$.

In both cases the eigenvalues are divided by the sum of the eigenvalues (that is, the trace of $E$).

Raises

NagValueError

(errno $1$)

On entry, $roots=⟨value⟩$.

Constraint: $roots=\text{'A'}$ or $\text{'L'}$.

(errno $1$)

On entry, $n=⟨value⟩$ and $ndim=⟨value⟩$.

Constraint: $n>ndim$.

(errno $1$)

On entry, $ndim=⟨value⟩$.

Constraint: $ndim\ge 1$.

(errno $2$)

On entry, all the elements of $d=0.0$.

(errno $2$)

On entry, $i=⟨value⟩$ and $d[i-1]<0.0$.

Constraint: $d[i-1]\ge 0.0$.

(errno $3$)

There are less than $ndim$ eigenvalues greater than zero.

(errno $4$)

The computation of the eigenvalues or eigenvectors has failed.

Notes

In the NAG Library the traditional C interface for this routine uses a different algorithmic base. Please contact NAG if you have any questions about compatibility.

For a set of $n$ objects a distance matrix $D$ can be calculated such that $d_{ij}$ is a measure of how ‘far apart’ are objects $i$ and $j$ (see distance_mat() for example). Principal coordinate analysis or metric scaling starts with a distance matrix and finds points $X$ in Euclidean space such that those points have the same distance matrix. The aim is to find a small number of dimensions, $k\ll (n-1)$, that provide an adequate representation of the distances.

The principal coordinates of the points are computed from the eigenvectors of the matrix $E$ where $e_{ij}=-1/2(d_{ij}^2-d_{i.}^2-d_{.j}^2+d_{..}^2)$ with $d_{i.}^2$ denoting the average of $d_{ij}^2$ over the suffix $j$, etc.. The eigenvectors are then scaled by multiplying by the square root of the value of the corresponding eigenvalue.

Provided that the ordered eigenvalues, ${\lambda }_i$, of the matrix $E$ are all positive, ${\sum }_{i=1}^k{\lambda }_i/{\sum }_{i=1}^{n-1}{\lambda }_i$ shows how well the data is represented in $k$ dimensions. The eigenvalues will be non-negative if $E$ is positive semidefinite. This will be true provided $d_{ij}$ satisfies the inequality: $d_{ij}\le d_{ik}+d_{jk}$ for all $i,j,k$. If this is not the case the size of the negative eigenvalue reflects the amount of deviation from this condition and the results should be treated cautiously in the presence of large negative eigenvalues. See Krzanowski (1990) for further discussion. multidimscal_metric provides the option for all eigenvalues to be computed so that the smallest eigenvalues can be checked.

References

Chatfield, C and Collins, A J, 1980, Introduction to Multivariate Analysis, Chapman and Hall

Gower, J C, 1966, Some distance properties of latent root and vector methods used in multivariate analysis, Biometrika (53), 325–338

Krzanowski, W J, 1990, Principles of Multivariate Analysis, Oxford University Press