This class contains a result of a run. Let K be the total number of cluster, p the number of dimension m the p-vector containing the size of each dimension.
proportiona K-vector of proportions.
pia K*p-matrix composed of the scale parameters.
mua matrix with K lines and sum(m) columns in which line k is composed of the location parameters of cluster k.
llthe estimated log-likelihood.
bicthe estimated BIC criterion.
iclthe estimated ICL criterion.
tika n*K-matrix containing the estimation of the conditional probabilities for the observed ranks to belong to each cluster.
partitiona n-vector containing the partition estimation resulting from the clustering.
entropya n*2-matrix containing for each observation its estimated cluster and its entropy. The entropy output illustrates the confidence in the clustering of each observation (a high entropy means a low confidence in the clustering)..
probabilitya n*2-matrix similar to the entropy output, containing for each observation its estimated cluster and its probability p(xi; mk, pk) given its cluster. This probability is estimated using the last simulation of the presentation orders used for the likelihood approximation. The probability output exhibits the best representative of each cluster.
convergencea boolean indicating if none problem of empty class has been encountered.
partiala boolean indicating the presence of partial rankings or ties.
partialRanka matrix containing the full rankings, estimated using the within cluster ISR parameters when the ranking is partial. When ranking is full, partialRank simply contains the observed ranking. Available only in presence of at least one partial ranking.
partialRankScoreconfidence score in estimated partial rank
distancePropDistances (MSE) between the final estimation and the current value at each iteration of the SEM-Gibbs algorithm (except the burn-in phase) for proportions. A list of Qsem-Bsem elements, each element being a K*p-matrix.
distancePiDistances (MSE) between the final estimation and the current value at each iteration of the SEM-Gibbs algorithm (except the burn-in phase) for scale parameters. A list of Qsem-Bsem elements, each element being a K*p-matrix.
distanceMuDistances (Kendall distance) between the final estimation and the current value at each iteration of the SEM-Gibbs algorithm (except the burn-in phase) for proportions. A list of Qsem-Bsem elements, each element being a K*p-matrix.
distanceZa vector of size Qsem-Bsem containing the rand index between the final estimated partition and the current value at each iteration of the SEM-Gibbs algorithm (except the burn-in phase). Let precise that the rand index is not affected by label switching.
distancePartialRankKendall distance between the final estimation of the partial rankings (missing positions in such rankings are estimated) and the current value at each iteration of the SEM-Gibbs algorithm (except the burn-in phase). distancePartialRank is a list of Qsem-Bsem elements, each element being a matrix of size n*p. Available only in presence of at least one partial ranking.
proportionInitiala vector containing the initialization of proportions in the algorithm.
piInitiala matrix containing the initialization of the probabilities of good paired comparison in the algorithm.
muInitiala matrix containing the initialization of modal rankings in the algorithm.
partialRankInitiala matrix containing the initialization of the partial rankings in the algorithm.