cluster_est_binder(c, logposterior)n. c[[j]][i] is
the cluster allocation of observation i=1...n at iteration
j=1...N.c used to break ties when minimizing the cost functionlist:
c_est: a vector of length n. Point estimate of the partition
cost: a vector of length N. cost[j] is the cost
associated to partition c[[j]]
similarity: matrix of size n x n. Similarity matrix
(see similarityMat)
opt_ind: the index of the optimal partition
among the MCMC iterations.
DB Dahl, Model-Based Clustering for Expression Data via a Dirichlet Process Mixture Model, Bayesian Inference for Gene Expression and Proteomics, K-A Do, P Muller, M Vannucci (Eds.), Cambridge University Press, 2006.
similarityMat similarityMatC