Ordination Algorithm

An Ordination Algorithm is a exploratory data analysis algorithm that orders objects that are characterized by values on multiple variables (i.e., multivariate objects) so that similar objects are near each other and dissimilar objects are farther from each other.

AKA: Ordination.
Example(s):
- principal components analysis (PCA).
- non-metric multidimensional scaling (NMDS)
- correspondence analysis (CA) and its derivatives (detrended CA (DCA).
- canonical CA (CCA).
- Bray–Curtis ordination.
- redundancy analysis (RDA).
- ...
Counter-Example(s):
- Data Clustering Algorithm.
See: Multivariate Analysis, Gradient Analysis, Data Clustering, Exploratory Data Analysis, Hypothesis Testing.

References

(Wikipedia, 2016) ⇒ http://wikipedia.org/wiki/ordination_(statistics) Retrieved:2016-3-27.
- In multivariate analysis, ordination or gradient analysis is a method complementary to data clustering, and used mainly in exploratory data analysis (rather than in hypothesis testing). Ordination orders objects that are characterized by values on multiple variables (i.e., multivariate objects) so that similar objects are near each other and dissimilar objects are farther from each other. These relationships between the objects, on each of several axes (one for each variable), are then characterized numerically and/or graphically. Many ordination techniques exist, including principal components analysis (PCA), non-metric multidimensional scaling (NMDS), correspondence analysis (CA) and its derivatives (detrended CA (DCA), canonical CA (CCA)), Bray–Curtis ordination, and redundancy analysis (RDA), among others.