CLUSTH Hierarchical clustering, faster version
[LAB,DEN] = CLUSTH(A,K,TYPE,MSIZE)
DescriptionThis routine performs a hierarchical clustering in feature space with a linkage type given by TYPE. The clusterings with the numbers of clusters given in the vector K are returned in the columns of LAB. The routine uses DCLUSTH on the Euclidean distance matrix between the objects. As this might be prohibitive for large datasets, a preclustering is used, see below. The prototypes refer to by LAB are the cluster mediods, except for single linkage clustering in which case these are the cluster centres. Use CLUSTHC to create a classifier based on the cluster result which is consistent with TYPE. IF K is given its values are reduced to less than M/5 to make the routine more feasible. Moreover, if M > MSIZE the dataset A is preclustered by PRECLUST using CLUSTM. Unless specific values of K < 100 are needed it is recommended for fast processing to use K = []. Speed may be further increased by using smaller values of MSIZE, e.g. MSIZE = 500; Example(s)
randreset; % take care of reproducability
See alsodatasets, mappings, dclusth, cluste, clustf, clustk, clustm, clustkh, clusteval, clustcerr, clustc, clustnum, clusthc, plotdg, preclust,
|