Given a pivot allocation vector, a set of simulated allocations and a set of permutations from different relabelling algorithms, this function relabels the permutations so that all methods maximize their similarity with the pivot. This is helpful when comparing different different label switching algorithms.
1  compare.clust(pivot.clust,perms,z,K)

pivot.clust 
a pivot allocation vector of the n observations among the K clusters. 
perms 
a list containing f permutation arrays, as returned by 
z 
a set of simulated allocation arrays. 
K 
number of mixture components 
similarity 
(f+1) K\times (f+1) matrix containing the similarity coefficient of the resulting clusters. 
clusters 
f\times n array of single best clusterings, relabelled in order to maximize their similarity with 
permutations 
releaballed permutations. 
Panagiotis Papastamoulis
label.switching
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
All documentation is copyright its authors; we didn't write any of that.