18. The non-transitory computer-readable storage medium of claim 15 , wherein the clustering further includes: finding a most likely value of a clustering variable after all virtual-evidence have been propagated through the Bayesian belief network by means of a greedy agglomerative search process including: consider all pairs of clusters; evaluating a set of edges connecting one sample in one cluster to another sample in another cluster to choose one pair of clusters; and merging repeatedly the chosen pair of clusters to create a larger cluster until only one cluster results.
19. The non-transitory computer-readable storage medium of claim 18 , wherein the greedy agglomerative search process further includes: assigning a score to each of the pairs of clusters, the score being a product of probabilities associated with the edges and a pair of clusters with a highest score being merged when the merging is repeated.