SEARCH

SEARCH BY CITATION

Keywords:

  • Algorithm;
  • Constrained ordination;
  • Exploratory data analysis;
  • Variation partitioning

Abstract. Variation partitioning by (partial) constrained ordination is a popular method for exploratory data analysis, but applications are mostly restricted to simple ecological questions only involving two or three sets of explanatory variables, such as climate and soil, this because of the rapid increase in complexity of calculations and results with an increasing number of explanatory variable sets. The existence is demonstrated of a unique algorithm for partitioning the variation in a set of response variables on n sets of explanatory variables; it is shown how the 2n– 1 non-overlapping components of variation can be calculated. Methods for evaluation and presentation of variation partitioning results are reviewed, and a recursive algorithm is proposed for distributing the many small components of variation over simpler components. Several issues related to the use and usefulness of variation partitioning with n sets of explanatory variables are discussed with reference to a worked example.