Ordination Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
(Created page with "An Ordination Algorithm is a clustering algorithm that orders objects that are characterized by values on multiple variables (i.e., multiva...")
 
No edit summary
Line 1: Line 1:
An [[Ordination Algorithm]] is a [[clustering algorithm]] that [[partially ordered set|orders]] objects that are characterized by values on multiple variables (i.e., [[multivariate object]]s) so that similar objects are near each other and dissimilar objects are farther from each other.  
An [[Ordination Algorithm]] is a [[clustering algorithm]] that [[partially ordered set|orders]] objects that are characterized by values on multiple variables (i.e., [[multivariate object]]s) so that similar objects are near each other and dissimilar objects are farther from each other.
* <B>AKA:</B> [[Ordination]].
* <B>Example(s):</B>
* <B>Example(s):</B>
** [[principal components analysis (PCA)]].
** [[principal components analysis (PCA)]].
Line 7: Line 8:
** [[Bray&ndash;Curtis ordination]].
** [[Bray&ndash;Curtis ordination]].
** [[redundancy analysis]] (RDA).
** [[redundancy analysis]] (RDA).
* <B>See:</B> [[Multivariate Analysis]], [[Gradient Analysis]], [[Data Clustering]], [[Exploratory Data Analysis]], [[Hypothesis Testing]], [[Partially Ordered Set]], [[Principal Components Analysis]], [[Multidimensional Scaling]], [[Correspondence Analysis]], [[Detrended Correspondence Analysis]], [[Bray&Ndash;Curtis Ordination]].
* <B>See:</B> [[Multivariate Analysis]], [[Gradient Analysis]], [[Data Clustering]], [[Exploratory Data Analysis]], [[Hypothesis Testing]].
----
----
----
----

Revision as of 15:43, 27 March 2016

An Ordination Algorithm is a clustering 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.



References

2016