Theory, R functions & Examples
Section: Ordination analysis
Correspondence analysis (CA, previously know also as reciprocal averaging, RA), is a unimodal unconstrained ordination method. An interesting property, which attracted ecologists to this method, is the fact that it can calculate and display correspondence between samples and species in the same ordination space. In the space of all ordination axes, the distances among samples (and also among species) are represented by chi-square distance metric, which does not suffer from the double-zero problem (but is blamed by some for being too much influenced by rare species, see below). The data must be non-negative integers or presences-absences. Correspondence analysis suffers from creating often strong arch artefact in ordination diagrams, which is caused by a non-linear correlation between first and higher axes. Arch can be removed by detrending, which is the base of the detrended correspondence analysis (DCA). Distribution of samples along the first (D)CA axis is used as a base of TWINSPAN classification algorithm.
Although nowaday's software is using matrix algebra to calculate CA (either using singular value decomposition or eigenvalue decomposition of the matrix), the original algorithm is based on reciprocal averaging of column and row scores, which starts from random values, and by iterative row- and column-averaging converge into a unique solution, which represents the sample and species scores.
It has the following five calculation steps:
After calculating the sample and species scores for the first axis, one can continue to the second and higher axes, while maintaining linear independence from all previously calculated axes.
The following table (modified Table 4-5 from Šmilauer & Lepš 2014) shows a simple example of how to calculate sample and species scores:
| Calculation steps:
1. Initial scores (0, 4, and 10)
2. Species scores:
u.WA1Cirsium = (0*0 + 0*4 + 3*10)/(0 + 0 + 3) = 30
u.WA1Glechoma = (5*0 + 2*4 + 1*10)/(5 + 2 + 1) = 2.25
u.WA1Rubus = (6*0 + 2*4 + 0*10)/(6 + 2 + 0) = 1
u.WA1Urtica = (8*0 + 1*4 + 0*10)/(8 + 1 + 0) = 0.444
3. Sample scores:
x.WA1Sample 1 = (0*10 + 5*2.25 + 6*1 + 8*0.444)/(0 + 5 + 6 + 8) = 1.095
x.WA1Sample 2 = (0*10 + 2*2.25 + 2*1 + 1*0.444)/(0 + 2 + 2 + 1) = 1.389
x.WA1Sample 3 = (3*10 + 1*2.25 + 0*1 + 0*0.444)/(3 + 1 + 0 + 0) = 8.063
4. Rescale to the original range (0-10 here)
5. Continue by step 2 until the values converge.
Important property of this algorithm is that it actually does not depends on the arbitrary choice of initial scores, as can be seen on Figure 1 (in the example table above, the initial scores were preselected in the way that the convergence is faster; if they are random values, the convergence will still occur but will happen later).
CA algorithm has, however, two unpleasant properties: it produces a more or less pronounced arch artefact, and it compresses the samples at the 1st-axis ends relative to the middle (see an example on Figure 2).
A detrended correspondence analysis (DCA) attempts to remove the arch effect from ordination (Figure 3). The method was (and still is) very popular, especially among vegetation ecologists, because it often returns meaningful distribution of samples in ordination diagrams. Additionally, it has one interesting property: the length of the first DCA axis (in SD units) refers to the heterogeneity or homogeneity of the dataset, and can be used to decide whether data should be analysed by linear (axis shorter than 3 SD) or unimodal (axis longer than 4 SD) ordination methods (details here). However, detrending (by segments) is a brute-force approach which resembles using a hammer on data - arch is hammered by cutting the first axis into segments and moving the sample points up and down along the second axis (you may see rescaling from CA to DCA here). For this and other reasons, the method is criticized and not recommended for use by some of the researchers (see e.g. Legendre & Legendre 1998, Borcard et al. 2011, or Jari Oksanen), while defended by others (e.g. ter Braak & Šmilauer 2015). A technical note: since the DCA implemented in both vegan or CANOCO is calculated by (the updated version of) the original DECORANA algorithm written by Mark O. Hill (and published in Hill & Gauch 1980), it still has the same limitations; one of them is that it calculates species and sample scores only for the first four ordination axes.
Traditionally, CA (and CCA) method was criticized for being too sensitive to descriptors (e.g. species) with very low total abundance, i.e. species that occur with very low frequency or in very few samples. As a result, rare objects are often located as outliers in CA ordination diagrams, and as such, they appear as highly influential. However, since they also have low weight (due to low total abundance), their effect on the result is reduced. In fact, deleting rare species before conducting (C)CA analysis (as often done previously to reduce the computational time) has minimal effect on the results of the calculation. More details about this are in Greenacre (2013), who also suggests using alternative scaling method when plotting results of (C)CA, so-called contribution biplot, where species coordinates are directly proportional to the species contribution to the solution.
In CA, both objects and species are represented by points in the ordination diagram (compare to PCA, where species/descriptors are vectors and sites are points). Similarly to PCA, two types of scaling are available (Figure 4, Borcard et al. 2011):
In the case of DCA, only one scaling type, equivalent to scaling 1 in CA, is available.