Last chance! 50% off unlimited learning
Sale ends in
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
. If provided, group merges will
start with this partition. Otherwise, each observation is assumed to
be in a cluster by itself at the start of ado.call
call.C. Fraley and A. E. Raftery (2006). MCLUST Version 3 for R: Normal Mixture Modeling and Model-Based Clustering, Technical Report no. 504, Department of Statistics, University of Washington.
"EEE"
,
do not admit a fast algorithm under the usual agglomerative
hierachical clustering paradigm.
These use less memory but are much slower to execute.hc
,
hclass
hcTree <- hcEII(data = iris[,-5])
cl <- hclass(hcTree,c(2,3))
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)
Run the code above in your browser using DataLab