The routine may be called by the names g03fcf or nagf_mv_multidimscal_ordinal.
For a set of objects, a distance or dissimilarity matrix can be calculated such that is a measure of how ‘far apart’ the objects and are. If variables have been recorded for each observation this measure may be based on Euclidean distance, , or some other calculation such as the number of variables for which . Alternatively, the distances may be the result of a subjective assessment. For a given distance matrix, multidimensional scaling produces a configuration of points in a chosen number of dimensions, , such that the distance between the points in some way best matches the distance matrix. For some distance measures, such as Euclidean distance, the size of distance is meaningful, for other measures of distance all that can be said is that one distance is greater or smaller than another. For the former metric scaling can be used, see g03faf, for the latter, a non-metric scaling is more appropriate.
For non-metric multidimensional scaling, the criterion used to measure the closeness of the fitted distance matrix to the observed distance matrix is known as . is given by,
where is the Euclidean squared distance between points and and is the fitted distance obtained when is monotonically regressed on , that is is monotonic relative to and is obtained from with the smallest number of changes. So is a measure of by how much the set of points preserve the order of the distances in the original distance matrix. Non-metric multidimensional scaling seeks to find the set of points that minimize the .
An alternate measure is ,
in which the distances in are replaced by squared distances.
In order to perform a non-metric scaling, an initial configuration of points is required. This can be obtained from principal coordinate analysis, see g03faf. Given an initial configuration, g03fcf uses the optimization routine e04dgf/e04dga to find the configuration of points that minimizes or . The routine e04dgf/e04dga uses a conjugate gradient algorithm. g03fcf will find an optimum that may only be a local optimum, to be more sure of finding a global optimum several different initial configurations should be used; these can be obtained by randomly perturbing the original initial configuration using routines from Chapter G05.
Chatfield C and Collins A J (1980) Introduction to Multivariate Analysis Chapman and Hall
Krzanowski W J (1990) Principles of Multivariate Analysis Oxford University Press
1: – Character(1)Input
On entry: indicates whether or is to be used as the criterion.
2: – IntegerInput
On entry: , the number of objects in the distance matrix.
3: – IntegerInput
On entry: , the number of dimensions used to represent the data.
4: – Real (Kind=nag_wp) arrayInput
On entry: the lower triangle of the distance matrix stored packed by rows. That is
must contain , for and . If is missing then set ; for further comments on missing values see Section 9.
5: – Real (Kind=nag_wp) arrayInput/Output
On entry: the
th row must contain an initial estimate of the coordinates for the th point, for . One method of computing these is to use g03faf.
On exit: the
th row contains coordinates for the th point, for .
6: – IntegerInput
On entry: the first dimension of the array x as declared in the (sub)program from which g03fcf is called.
7: – Real (Kind=nag_wp)Output
On exit: the value of or at the final iteration.
8: – Real (Kind=nag_wp) arrayOutput
On exit: auxiliary outputs.
If , the first elements contain the distances, , for the points returned in x, the second set of contains the distances ordered by the input distances, , the third set of elements contains the monotonic distances, , ordered by the input distances, and the final set of elements contains fitted monotonic distances, , for the points in x. The corresponding to distances which are input as missing are set to zero.
If , the results are as above except that the squared distances are returned.
Each distance matrix is stored in lower triangular packed form in the same way as the input matrix .
9: – IntegerInput
On entry: the maximum number of iterations in the optimization process.
The tolerance is set to where . All other values are set as described in Section 9.
No values are changed, therefore, the default values of e04dgf/e04dga are used.
11: – Real (Kind=nag_wp) arrayWorkspace
12: – Integer arrayWorkspace
13: – IntegerInput/Output
On entry: ifail must be set to , or to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value or is recommended. If message printing is undesirable, then the value is recommended. Otherwise, the value is recommended. When the value or is used it is essential to test the value of ifail on exit.
On exit: unless the routine detects an error or a warning has been flagged (see Section 6).
6Error Indicators and Warnings
If on entry or , explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
On entry, and .
On entry, and .
On entry, .
On entry, .
Constraint: or .
On entry, all the elements of .
The optimization has failed to converge in iter function iterations. Try either increasing the number of iterations using iter or increasing the value of , given by iopt, used to determine convergence. Alternatively try a different starting configuration.
The conditions for an acceptable solution have not been met but a lower point could not be found. Try using a larger value of , given by iopt.
The optimization cannot begin from the initial configuration. Try a different set of points.
The optimization has failed. This error is only likely if . It corresponds to , and in e04dgf/e04dga.
An unexpected error has been triggered by this routine. Please
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
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.
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
After a successful optimization the relative accuracy of should be approximately , as specified by iopt.
8Parallelism and Performance
g03fcf 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.
The optimization routine e04dgf/e04dga used by g03fcf has a number of options to control the process. The options for the maximum number of iterations (Iteration Limit) and accuracy (Optimality Tolerance) can be controlled by iter and iopt respectively. The printing option (Print Level) is set to to give no printing. The other option set is to stop the checking of derivatives () for efficiency. All other options are left at their default values. If however is used, only the maximum number of iterations is set. All other options can be controlled by the option setting mechanism of e04dgf/e04dga with the defaults as given by that routine.
Missing values in the input distance matrix can be specified by a negative value and providing there are not more than about two thirds of the values missing the algorithm may still work. However the routine g03faf does not allow for missing values so an alternative method of obtaining an initial set of coordinates is required. It may be possible to estimate the missing values with some form of average and then use g03faf to give an initial set of coordinates.
The data, given by Krzanowski (1990), are dissimilarities between water vole populations in Europe. Initial estimates are provided by the first two principal coordinates computed.