Learn R Programming

vegan (version 2.0-10)

wcmdscale: Weighted Classical (Metric) Multidimensional Scaling

Description

Weighted classical multidimensional scaling, also known as weighted principal coordinates analysis.

Usage

wcmdscale(d, k, eig = FALSE, add = FALSE, x.ret = FALSE, w)
## S3 method for class 'wcmdscale':
plot(x, choices = c(1, 2), type = "t", ...)
## S3 method for class 'wcmdscale':
scores(x, choices = NA, ...)

Arguments

d
a distance structure such as that returned by dist or a full symmetric matrix containing the dissimilarities.
k
the dimension of the space which the data are to be represented in; must be in ${1,2,\ldots,n-1}$. If missing, all dimensions with above zero eigenvalue.
eig
indicates whether eigenvalues should be returned.
add
logical indicating if an additive constant $c*$ should be computed, and added to the non-diagonal dissimilarities such that all $n-1$ eigenvalues are non-negative. Not implemented.
x.ret
indicates whether the doubly centred symmetric distance matrix should be returned.
w
Weights of points.
x
The wcmdscale result object when the function was called with options eig = TRUE or x.ret = TRUE (See Details).
choices
Axes to be returned; NA returns all real axes.
type
Type of graph which may be "t"ext, "p"oints or "n"one.
...
Other arguments passed to graphical functions.

Value

  • If eig = FALSE and x.ret = FALSE (default), a matrix with k columns whose rows give the coordinates of points corresponding to positive eignenvalues. Otherwise, an object of class wcmdscale containing the components that are mostly similar as in cmdscale:
  • pointsa matrix with k columns whose rows give the coordinates of the points chosen to represent the dissimilarities.
  • eigthe $n-1$ eigenvalues computed during the scaling process if eig is true.
  • xthe doubly centred and weighted distance matrix if x.ret is true.
  • GOFGoodness of fit statistics for k axes. The first value is based on the sum of absolute values of all eigenvalues, and the second value is based on the sum of positive eigenvalues
  • weightsWeights.
  • negaxesA matrix of scores for axes with negative eigenvalues scaled by the absolute eigenvalues similarly as points. This is NULL if there are no negative eigenvalues or k was specified, and would not include negative eigenvalues.
  • callFunction call.

Details

Function wcmdscale is based on function cmdscale (package stats of base R), but it uses point weights. Points with high weights will have a stronger influence on the result than those with low weights. Setting equal weights w = 1 will give ordinary multidimensional scaling.

With default options, the function returns only a matrix of scores scaled by eigenvalues for all real axes. If the function is called with eig = TRUE or x.ret = TRUE, the function returns an object of class "wcmdscale" with print, plot, scores, eigenvals and stressplot methods, and described in section Value.

References

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

Mardia, K. V., Kent, J. T. and Bibby, J. M. (1979). Chapter 14 of Multivariate Analysis, London: Academic Press.

See Also

The function is modelled after cmdscale, but adds weights (hence name) and handles negative eigenvalues differently. Other multidimensional scaling methods are monoMDS, and isoMDS and sammon in package MASS.

Examples

Run this code
## Correspondence analysis as a weighted principal coordinates
## analysis of Euclidean distances of Chi-square transformed data
data(dune)
rs <- rowSums(dune)/sum(dune)
d <- dist(decostand(dune, "chi"))
ord <- wcmdscale(d, w = rs, eig = TRUE)
## Ordinary CA
ca <- cca(dune)
## Eigevalues are numerically similar
ca$CA$eig - ord$eig
## Configurations are similar when site scores are scaled by
## eigenvalues in CA
procrustes(ord, ca, choices=1:19, scaling = 1)
plot(procrustes(ord, ca, choices=1:2, scaling=1))
## Reconstruction of non-Euclidean distances with negative eigenvalues
d <- vegdist(dune)
ord <- wcmdscale(d, eig = TRUE)
## Only positive eigenvalues:
cor(d, dist(ord$points))
## Correction with negative eigenvalues:
cor(d, sqrt(dist(ord$points)^2 - dist(ord$negaxes)^2))

Run the code above in your browser using DataLab