Dom's Q 0 measure (Dom, 2001) uses conditional entropy, H(C|K) to calculate the goodness of a clustering solution.
given the hypothesized partition, what is the number of bits necessary to represent the true clustering?