Description Usage Arguments Value Warning References See Also Examples
This uses the normalized mutual information to evaluate how well the EM algorithm performs with respect to the data provided.
| 1 | normalizedMI(trueLabel, predictedLabel)
 | 
| trueLabel | This is a vector that represents the actual cluster labels of the data | 
| predictedLabel | This is the predicted cluster labels returned by the EM algorithm | 
| normalizedMI | This value represents the efficiency of the algorithm. The higher the value, the greater the efficiency of the algorithm | 
This function is dependent on the true and predicted clusters having the same levels.
Manning, C., Raghavan, P., Schutze, H. (2008). An Introduction to Information Retrieval. Cambridge University Press. ISBN 0-521-86571-9
| 1 2 3 4 5 6 | ## Not run: 
  true<-c("a","b","a","a","a")
   predicted<-c("a","b","b","a","a")
   normalizedMI(true,predicted)
## End(Not run)
 | 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.