**Introduction**

**Theory, Examples & Exercises**

*Unconstrained ordination**Constrained ordination*

**Data, Links & References**

**Other stuff**

Author: David Zelený

**Introduction**

**Theory, Examples & Exercises**

*Unconstrained ordination**Constrained ordination*

**Data, Links & References**

**Other stuff**

Author: David Zelený

en:nmds

Non-metric alternative to PCoA analysis - it can use any distance measure among samples, and the main focus is on projecting the relative position of sample points into low dimensional ordination space (two or three axes). The method is distance based, not eigenvalue based - it means that it does not attempt to maximize the variance preserved by particular ordination axes and resulting projection could therefore be rotated in any direction.

The algorithm goes like this (simplified):

- Specify the number of dimensions
*m*you want to use (into which you want to*scale*down the distribution of samples in multidimensional space - that's why it's scaling). - Construct initial configuration of all samples in
*m*dimensions as a starting point of iterative process. The result of the whole iteration procedure may depend on this step, so it's somehow crucial - the initial configuration could be generated by random, but better way is to help it a bit, e.g. by using PCoA ordination as a starting position. - An iterative procedure tries to reshuffle the objects in given number of dimension in such a way that the real distances among objects reflects best their compositional dissimilarity. Fit between these two parameters is expressed as so called
*stress value*- the lower stress value the better. - Algorithm stops when new iteration cannot lower the stress value - the solution has been reached.
- After the algorithm is finished, the final solution is rotated using PCA to ease its interpretation (that's why final ordination diagram has ordination axes, even if original algorithm doesn't produce any).

en/nmds.txt · Last modified: 2017/02/15 09:32 by David Zelený