Description Usage Arguments Details Value
We proceed by grouping, varying the number of functional groups of components from the number of components until to 1. All components are initially dispersed into a singleton, as many singletons as components. At each step, one of the functional groups is grouped with another functional group: the new functional groups selected are those that minimize the Residual Sum of Squares of the clustering. The process stops when all components are grouped into a large, unique functional group. As a whole, the process generates a hierarchical aggloimerative tree of component clustering, whose RSS decreases monotonically with the number of functional groups.
1 | agglomerative_ftree(fobs, mOccur, xpr, opt.mean, opt.model)
|
fobs |
a numeric vector. The vector |
mOccur |
a matrix of occurrence (occurrence of elements).
Its first dimension equals to |
xpr |
a vector of numerics of |
opt.mean |
a character equals to Modelled performances are computed
using arithmetic mean ( |
opt.model |
a character equals to If If |
At each hierarchical level of the agglomerative tree, the clustering of the existing functional groups into new functional groups proceeds as follows. Each existing functional group is successively grouped with other functional groups. The component clustering that minimizes RSS is kept.
Return an object "tree",
that is a list containing
(i) tree$aff
: an integer square-matrix of
component affectation to functional groups,
(ii) tree$cor
: a numeric vector of
coefficient of determination.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.