How many clusters? Which clustering method? Answers via model-based cluster analysis

Computer Journal

Volumn 41, Issue 8, 1998, Pages 586-588

  Fraley, Chris ^a   Raftery, Adrian E ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA REDUCTION; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING; STATISTICAL METHODS;

BAYESIAN INFORMATION CRITERION (BIC); EXPECTATION-MAXIMIZATION (EM) ALGORITHMS; MODEL-BASED CLUSTER ANALYSIS;

DATA STRUCTURES;

EID: 0032269108     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/41.8.578     Document Type: Article

References (66)

1. Murtagh, F. and Raftery, A. E. (1984) Fitting straight lines to point patterns. Pattern Recognition, 17, 479-483.
2. Banfield, J. D. and Raftery, A. E. (1993) Model-based Gaussian and non-Gaussian clustering. Biometrics, 49, 803-821.
3. Dasgupta, A. and Raftery, A. E. (1998) Detecting features in spatial point processes with clutter via model-based clustering. J. Amer. Stat. Assoc., 93, 294-302.
4. Campbell, J. G., Fraley, C., Murtagh, F. and Raftery, A. E. (1997) Linear flaw detection in woven textiles using model-based clustering. Pattern Recognition Lett., 18, 1539-1548.
5. Celeux, G. and Govaert, G. (1995) Gaussian parsimonious clustering models. Pattern Recognition, 28, 781-793.
6. Mukerjee, S., Feigelson, E. D., Babu, G. J., Murtagh, F., Fraley, C. and Raftery, A. (1998) Three types of gamma ray bursts. Astrophys. J., 508, 314-327.
7. Dempster, A. P., Laird, N. M. and Rubin, D. B. (1977) Maximum likelihood for incomplete data via the EM algorithm. J. R. Stat. Soc., B, 39, 1-38.
8. Reaven, G. M. and Miller, R. G. (1979) An attempt to define the nature of chemical diabetes using a multidimensional analysis. Diabetologia, 16, 17-24.
9. Hartigan, J. A. (1975) Clustering Algorithms. Wiley, New York.
10. Gordon, A. D. (1981) Classification: Methods for the Exploratory Analysis of Multivariate Data. Chapman & Hall, London.
11. Murtagh, F. (1985) Multidimensional clustering algorithms. CompStat Lectures, 4. Physica Verlag, Mostbach.
12. McLachlan, G. J. and Basford, K. E. (1988) Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York.
13. Kaufman, L. and Rousseeuw, P. J. (1990) Finding Groups in Data. Wiley, New York.
14. MacQueen, J. (1967) Some methods for classification and analysis of multivariate observations. In Cam, L. M. L. and Neyman, J. (eds), Proc. 5th Berkeley Symp. on Mathematical Statistics and Probability, vol. 1, pp. 281-297. University of California Press.
15. Hartigan, J. A. and Wong, M. A. (1978) Algorithm AS 136: a K-means clustering algorithm. Appl. Stat., 28, 100-108.
16. Engelman, L. and Hartigan, J. A. (1969) Percentage points of a test for clusters. J. Amer. Stat. Assoc., 64, 1647.
17. Bock, H. H. ( 1974) Automatische Klassifikation (Clusteranalyse). Vandenhoek & Ruprecht, Göttingen.
18. Bozdogan, H. (1993) Choosing the number of component clusters in the mixture model using a new informational complexity criterion of the inverse Fisher information matrix. In Opitz, O., Lausen, B. and Klar, R. (eds), Information and Classification, pp. 40-54. Springer-Verlag, Berlin.
19. Bock, H. H. (1996) Probability models and hypothesis testing in partitioning cluster analysis. In Arabie, P., Hubert, L. and DeSorte, G. (eds), Clustering and Classification, pp. 377-453. World Science Publishers, Singapore.
20. Ward, J. H. (1963) Hierarchical groupings to optimize an objective function. J. Amer. Stat. Assoc., 58, 234-244.
21. Friedman, H. P. and Rubin, J. (1967) On some invariant criteria for grouping data. J. Amer. Stat. Assoc., 62, 1159-1178.
22. Scott, A. J. and Symons, M. J. (1971) Clustering methods based on likelihood ratio criteria. Biometrics, 27, 387-397.
23. Fraley, C. (1999) Algorithms for model-based Gaussian hierarchical clustering. SIAM J. Sci. Comput., 20, 270-281.
24. McLachlan, G. J. and Krishnan, T. (1997) The EM Algorithm and Extensions. Wiley, New York.
25. Boyles, R. A. (1983) On the convergence of the EM algorithm. J. R. Stat. Soc., B, 45, 47-50.
26. Wu, C. F. J. (1983) On convergence properties of the EM algorithm. Annals. Stat., 11, 95-103.
27. Bensmail, H., Celeux, G., Raftery, A. E. and Robert, C. P. (1997) Inference in model-based cluster analysis. Stat. Comput., 7, 1-10.
28. Broniatowski, M., Celeux, G. and Diebolt, J. (1984) Reconnaissance de mélanges de densités par un algorithme d'apprentissage probabiliste. In Diday, E., Jambu, M., Lebart, L., Pagès, J.-P. and Tomassone, R. (eds), Data Analysis and Informatics, III, Elsevier Science, pp. 359-373.
29. Celeux, G. and Diebolt, J. (1985) The SEM algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Comput. Stat. Quart., 2, 73-82.
30. Celeux, G. and Govaert, G. (1992) A classification EM algorithm for clustering and two stochastic versions. Comput. Stat. Data Anal., 14, 315-332.
31. Kass, R. E. and Raftery, A. E. (1995) Bayes factors. J. Amer. Stat. Assoc., 90, 773-795.
32. Schwarz, G. (1978) Estimating the dimension of a model. Ann. Stat., 6, 461-464.
33. Binder, D. A. (1978) Bayesian cluster analysis. Biometrika, 65, 31-38.
34. Leroux, M. (1992) Consistent estimation of a mixing distribution. Annals. Stat., 20, 1350-1360.
35. Roeder, K. and Wasserman, L. (1997) Practical Bayesian density estimation using mixtures of normals. J. Amer. Stat. Assoc., 92, 894-902.
36. Jeffreys, H. (1961) Theory of Probability (3rd edn). Clarendon, Oxford.
37. Byers, S. D. and Raftery, A. E. (1998) Nearest neighbor clutter removal for estimating features in spatial point processes. J. Amer. Stat. Assoc., 93, 577-584.
38. Allard, D. and Fraley, C. (1997) Nonparametric maximum likelihood estimation of features in spatial point processes using Voronoï tessellation. J. Amer. Stat. Assoc., 92, 1485-1493.
39. Ripley, B. D. (1994) Neural networks and related methods for classification. J. R. Stat. Soc., B, 56, 409-456.
40. Golub, G. H. and Van Loan, C. F. (1996) Matrix Computations (3rd edn). Johns Hopkins University Press, Baltimore, MD.
41. Muise, R. and Smith, C. (1991) Nonparametric Minefield Detection and Localization. Technical Report CSS-TM-591-91, Coastal Systems Station, Panama City, Florida.
42. Bensmail, H. and Celeux, G. (1996) Regularized Gaussian discriminant analysis through eigenvalue decomposition. J. Amer. Stat. Assoc., 91, 1743-1748.
43. Posse, C. (1998) Hierarchical Model-based Clustering for Large Data Sets. Technical report, University of Minnesota, School of Statistics.
44. Diday, E. (1979) Optimisation en Classification Automatique. INRIA, France.
45. Späth, H. (1985) Cluster Dissection and Analysis: Theory, Fortran Programs, Examples. Ellis Horwood, New York.
46. Hastie, T. and Stuetzle, W. (1989) Principal Curves. J. Amer. Stat. Assoc., 84, 502-516.
47. Banfield, J. D. and Raftery, A. E. (1992) Ice floe identification in satellite images using mathematical morphology and clustering about principal curves. J. Amer. Stat. Assoc., 87, 7-16.
48. Banfield, J. D. and Raftery, A. E. (1992) Identifying ice floes in satellite images. Naval Research Rev., 43, 2-18.
49. Banfield, J. D. (1991) Automated tracking of ice floes: A statistical approach. IEEE Trans. Geoscience Remote Sensing, 29, 905-911.
50. Banfield, J. D. (1992) Skeletal modeling of ice leads. IEEE Trans. Geoscience Remote Sensing, 30, 918-923.
51. Heijmans, H. J. A. M. (1995) Mathematical morphology: A modern approach in image processing based on algebra and geometry. SIAM Rev., 37, 1-36.
52. Stanford, D. and Raftery, A. E. (1997) Principal Curve Clustering with Noise. Technical Report 317, University of Washington, Department of Statistics.
53. McLachlan, G. (1982) The classification and mixture maximum likelihood approaches to cluster analysis. In Krishnaiah, P. R. and Kanal, L. N. (eds), Handbook of Statistics, Vol. 2, pp. 199-208. North-Holland, Amsterdam.
54. Bryant, P. and Williamson, A. J. (1986) Maximum likelihood and classification: a comparison of three approaches. In Gaul, W. and Schader, R. (eds), Classification as a Tool of Research, pp. 33-45. Elsevier Science, Amsterdam.
55. Bock, H. H. (1996) Probability models in partitional cluster analysis. Comput. Stat. Data Anal., 23, 5-28.
56. Bock, H. H. (1996) Probability models in partitional cluster analysis. In Ferligoj, A. and Kramberger, A. (eds), Developments in Data Analysis, pp. 3-25. FDV, Metodoloski zvezki 12, Ljubljana, Slovenia.
57. Symons, M. J. (1981) Clustering criteria and multivariate normal mixtures. Biometrics, 37, 35-43.
58. Anderson, J. J. (1985) Normal mixtures and the number of clusters problem. Comput. Stat. Quart., 2, 3-14.
59. Bezdek, J. C. (1981) Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York.
60. Diday, E. and Govaert, G. (1974) Classification avec distances adaptives. Comptes Rendues Acad. Sci. Paris, 278, 993.
61. Cheeseman, P. and Stutz, J. (1995) Bayesian classification (AutoClass): Theory and results. In Fayyad, U. et al. (eds), Advances in Knowledge Discovery and Data Mining, pp. 153-180. AAAI Press.
62. Stutz, J. and Cheeseman, P. (1995) AutoClass - a Bayesian approach to classification. In Skilling, J. and Sibisi, S. (eds), Maximum Entropy and Bayesian Methods, Cambridge 1994. Kluwer, Dordrecht.
63. McLachlan, G. J. and Peel, D. (1998) MIXFIT: An algorithm for automatic fitting and testing of normal mixtures. In Proc. 14th Int. Conf. on Pattern Recognition, vol. 1, pp. 553-557. IEEE Computer Society.
64. Peel, D. and McLachlan, G. J. (1998) User's Guide to EMMIX - Version 1.0. University of Queensland, Australia.
65. Chickering, D. M. and Heckerman, D. (1997) Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29, 181-244.
66. McLachlan, G. J. and Peel, D. (1998) Robust cluster analysis via mixtures of multivariate t-distributions. In Amin, A. et al. (eds), Lecture Notes in Computer Science, vol. 1451, pp. 658-666. Springer, Berlin.