`hcE.Rd`

Agglomerative hierarchical clustering based on maximum likelihood for a Gaussian mixture model parameterized by eigenvalue decomposition.

hcE(data, partition, minclus=1, ...) hcV(data, partition, minclus = 1, alpha = 1, ...) hcEII(data, partition, minclus = 1, ...) hcVII(data, partition, minclus = 1, alpha = 1, ...) hcEEE(data, partition, minclus = 1, ...) hcVVV(data, partition, minclus = 1, alpha = 1, beta = 1, ...)

data | A numeric vector, matrix, or data frame of observations. Categorical variables are not allowed. If a matrix or data frame, rows correspond to observations and columns correspond to variables. |
---|---|

partition | A numeric or character vector representing a partition of
observations (rows) of |

minclus | A number indicating the number of clusters at which to stop the agglomeration. The default is to stop when all observations have been merged into a single cluster. |

alpha, beta | Additional tuning parameters needed for initializatiion in some models. For details, see Fraley 1998. The defaults provided are usually adequate. |

... | Catch unused arguments from a |

A numeric two-column matrix in which the *i*th row gives the minimum
index for observations in each of the two clusters merged at the
*i*th stage of agglomerative hierarchical clustering.

Most models have memory usage of the order of the square of the
number groups in the initial partition for fast execution.
Some models, such as equal variance or `"EEE"`

,
do not admit a fast algorithm under the usual agglomerative
hierachical clustering paradigm.
These use less memory but are much slower to execute.

J. D. Banfield and A. E. Raftery (1993).
Model-based Gaussian and non-Gaussian Clustering.
*Biometrics 49:803-821*.

C. Fraley (1998).
Algorithms for model-based Gaussian hierarchical clustering.
*SIAM Journal on Scientific Computing 20:270-281*.

C. Fraley and A. E. Raftery (2002).
Model-based clustering, discriminant analysis, and density estimation.
*Journal of the American Statistical Association 97:611-631*.

hcTree <- hcEII(data = iris[,-5]) cl <- hclass(hcTree,c(2,3)) if (FALSE) { par(pty = "s", mfrow = c(1,1)) clPairs(iris[,-5],cl=cl[,"2"]) clPairs(iris[,-5],cl=cl[,"3"]) par(mfrow = c(1,2)) dimens <- c(1,2) coordProj(iris[,-5], classification=cl[,"2"], dimens=dimens) coordProj(iris[,-5], classification=cl[,"3"], dimens=dimens) }