Experimental comparison of model-based clustering methods

Machine Learning

Volumn 42, Issue 1-2, 2001, Pages 9-29

  Meilǎ, Marina ^a,b   Heckerman, David ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES; RANDOM PROCESSES;

CLUSTERING METHODS; EXPECTATION MAXIMIZATION (EM) ALGORITHM; INITIALIZATION METHODS;

DATA REDUCTION;

EID: 0034826101     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007648401407     Document Type: Article

References (18)

1. Banfield, J. & Raftery, A. (1993). Model-based Gaussian and non-Gaussian clustering. Biometrics, 49, 803-821.
2. Bauer, E., Koller, D., & Singer, Y. (1997). Update rules for parameter estimation in Bayesian networks. In D. Geiger and P. Shenoy (Eds.), Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, Providence, RI, (pp. 3-13). San Mateo, CA: Morgan Kaufmann.
3. Celeux, G. & Govaert, G. (1992). A classification EM algorithm for clustering and two stochastic versions. Computational Statistics and Data Analysis, 14, 315-332.
4. Cheeseman, P. & Stutz, J. (1995). Bayesian classification (AutoClass): Theory and results. In U. Fayyad, G. Piatesky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.) Advances in Knowledge Discovery and Data Mining (pp. 153-180). Menlo Park, CA: AAAI Press.
5. Chickering, D. & Heckerman, D. (1997). Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29, 181-212.
6. Clogg, C. (1995). Latent class models. In Handbook of Statistical Modeling for the Social and Behavioral Sciences (pp. 311-359). New York: Plenum Press.
7. DeGroot, M. (1970). Optimal Statistical Decisions. New York, NY: McGraw-Hill.
8. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39, 1-38.
9. Dobson, A. J. (1990). An Introduction to Generalized Linear Models. New York, NY: Chapman and Hall.
10. Duda, R. O. & Hart, P. E. (1973) Pattern Classification and Scene Analysis. New York, NY: John Wiley & Sons.
11. Fisher, D. (1996). Iterative optimization and simplification of hierarchical clustering. Journal of Artificial Intelligence Research, 4:270:281.
12. Fraley, C. (1997). Algorithms for model-based Gaussian hierarchical clustering. SIAM Journal on Scientific Computing, 20, 270-281.
13. Frey, B., Hinton, G., & Dayan, P. (1996). Does the wake-sleep algorithm produce good density estimators? In D. Touretsky, M. Mozer, & M. Hasselmo, (Eds.), Neural Information Processing Systems (Vol. 8, pp. 661-667). Cambridge, MA: MIT Press.
14. Jain, A. K. & Dubes, R. C. (1988). Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice Hall.
15. Meilǎ, M. & Heckerman, D. (February, 1998). An experimental comparison of several clustering and initialization methods. Technical Report MSR-TR-98-06, Microsoft Research, Redmond, WA.
16. Thiesson, B. (1995). Accelerated quantification of Bayesian networks with incomplete data. In Proceedings of First International Conference on Knowledge Discovery and Data Mining, Montreal, QU (pp. 306-311). San Francisco, CA: Morgan Kaufmann.
17. Thiesson, B., Meek, C., Chickering, D., & Heckerman, D. (1999). Computationally efficient methods for selecting among mixtures of graphical models, with discussion. In Bayesian Statistics 6: Proceedings of the Sixth Valencia International Meeting (pp. 631-656), Oxford: Oxford University Press.
18. Zipf, G. (1949). Human Behavior and the Principle of Least Effort. Cambridge, MA: Addison-Wesley.