R: Evaluation of the candidate clustering partition in...
checkBranchLocalMO
R Documentation
Evaluation of the candidate clustering partition in $HIPAM_MO$
Description
In the HIPAM algorithm, each (parent) cluster P is investigated to see if it can be divided further into new (child) clusters, or stop (in this case, P would be a terminal node).
In this version of HIPAM, called $HIPAM_MO$, there are two different stopping criteria: First, if $|P| leq 2$, then P is a terminal node. If not, the second stopping criteria uses the Mean Split Silhouette. See Vinue et al. (2013) for more details.
The foundation and performance of the HIPAM algorithm is explained in hipamAnthropom.
A specific cluster of the clustering partition in a certain level of the tree.
maxsplit
The maximum number of clusters that any cluster can be divided when searching for the best clustering.
asw.tol
If this value is given, a tolerance or penalty can be introduced (asw.tol > 0 or asw.tol < 0, respectively) in the branch splitting procedure. Default value (0) is maintained. See page 154 of Wit et al. (2004) for more details.
local.const
If this value is given (meaningful values are those between -1 and 1), a proposed partition is accepted only if the associated asw is greater than this constant. Default option for this argument is maintained, that is to say, this value is ignored. See page 154 of Wit et al. (2004) for more details.
orness
Quantity to measure the degree to which the aggregation is like a min or max operation. See weightsMixtureUB and getDistMatrix.
type
Option 'MO' for using $HIPAM_MO$.
ah
Constants that define the ah slopes of the distance function in getDistMatrix. Given the five variables considered, this vector is c(23,28,20,25,25). This vector would be different according to the variables considered.
verbose
Boolean variable (TRUE or FALSE) to indicate whether to report information on progress.
...
Other arguments that may be supplied.
Value
The new resulting classification tree.
Note
This function belongs to the $HIPAM_MO$ algorithm and it is not solely used. That is why there is no section of examples in this help page. See hipamAnthropom.
Pollard, K. S., and van der Laan, M. J., (2002). A method to identify significant clusters in gene expression data. Vol. II of SCI2002 Proceedings, 318–325.