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...")
 
m (Text replacement - "ers]] " to "er]]s ")
 
(13 intermediate revisions by 2 users not shown)
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 [[exploratory data analysis algorithm]] that [[partially ordered set|order]]s 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 Algorithm|Ordination]].
* <B>Example(s):</B>
* <B>Example(s):</B>
** [[principal components analysis (PCA)]].
** [[principal components analysis (PCA)]].
** non-metric [[multidimensional scaling]] (NMDS)
** non-metric [[multidimensional scaling]] (NMDS)
** [[correspondence analysis]] (CA) and its derivatives ([[detrended correspondence analysis|detrended CA (DCA)]]
** [[correspondence analysis]] (CA) and its derivatives ([[detrended correspondence analysis|detrended CA (DCA)]].
** [[canonical CA (CCA)]]
** [[canonical CA (CCA)]].
** [[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>Counter-Example(s):</B>
** [[Data Clustering Algorithm]].
* <B>See:</B> [[Multivariate Analysis]], [[Gradient Analysis]], [[Data Clustering]], [[Exploratory Data Analysis]], [[Hypothesis Testing]].
 
----
----
----
----
==References==
 
== References ==


=== 2016 ===
=== 2016 ===
* (Wikipedia, 2016) &rArr; https://en.wikipedia.org/wiki/ordination_(statistics) Retrieved:2016-3-27.
* (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 [[partially ordered set|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 correspondence analysis|detrended CA (DCA)]], canonical CA (CCA)), [[Bray&ndash;Curtis ordination]], and [[redundancy analysis]] (RDA), among others.
** In [[multivariate analysis]], '''ordination''' or <B>[[gradient analysis]]</B> is a method complementary to [[data clustering]], and used mainly in [[exploratory data analysis]] (rather than in [[hypothesis testing]]). Ordination [[partially ordered set|order]]s 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 correspondence analysis|detrended CA (DCA)]], canonical CA (CCA)), [[Bray&ndash;Curtis ordination]], and [[redundancy analysis]] (RDA), among others.


----
----
__NOTOC__
[[Category:Concept]]
[[Category:Concept]]
__NOTOC__

Latest revision as of 00:46, 19 August 2024

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.



References

2016