Using combinatorial optimization in model-based trimmed clustering with cardinality constraints

Computational Statistics and Data Analysis

Volumn 54, Issue 3, 2010, Pages 637-654

  Gallegos, María Teresa ^a   Ritter, Gunter ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; CARDINALITIES; CARDINALITY CONSTRAINTS; CLUSTER SIZES; CLUSTERING CRITERIA; CONSTRAINED CLUSTERING; CONSTRAINED OPTIMIZATION PROBLEMS; GROSS OUTLIERS; K-MEANS; MAXIMUM A POSTERIORI; MODEL-BASED; SCALE PARAMETER; SPURIOUS CLUSTER; STATISTICAL CLUSTERING; STATISTICAL MODELS; SYNTHETIC DATASETS;

CLUSTER ANALYSIS; COMBINATORIAL OPTIMIZATION; MAXIMUM LIKELIHOOD ESTIMATION;

CONSTRAINED OPTIMIZATION;

EID: 70549110606     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csda.2009.08.023     Document Type: Article

References (65)

1. Achatz H., Kleinschmidt P., and Paparrizos K. A dual forest algorithm for the assignment problem. In: Gritzmann P., and Sturmfels B. (Eds). Applied Geometry and Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 4 (1991), American Mathematical Society, Providence, RI 1-10
2. Ahuja R.K., Orlin J.B., Stein C., and Tarjan R.E. Improved algorithms for bipartite network flows. SIAM J. Comput. 23 (1994) 906-933
3. Anderson E. The irises of the Gaspé Peninsula. Bull. Amer. Iris Soc. 59 (1935) 2-5
4. Aurenhammer F., Hoffmann F., and Aronov B. Minkowski-type theorems and least-squares clustering. Algorithmica 20 (1998) 61-76
5. Barnett V., and Lewis T. Outliers in Statistical Data (1994), Wiley, Chichester, UK
6. Becker C., and Gather U. The masking breakdown point of multivariate outlier identification rules. JASA 94 (1999) 947-955
7. Bernholt T., and Fischer P. The complexity of computing the MCD-estimator. Theoret. Comput. Sci. 326 (2004) 383-398
8. Bezdek J.C., Keller J., Krisnapuram R., and Pal N.R. Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. The Handbooks of Fuzzy Sets Series (1999), Kluwer, Boston, London, Dordrecht
9. Bock H.-H. On some significance tests in cluster analysis. J. Classification 2 (1985) 77-108
10. Carpaneto G., Martello S., and Toth P. Algorithms and codes for the assignment problem. Ann. Oper. Res. 13 (1988) 193-223
11. Chen H., Chen J., and Kalbfleisch J.D. Testing for a finite mixture model with two components. J. Roy. Stat. Soc. Ser. B 66 (2004) 95-115
12. Coleman D.A., Dong X., Hardin J., Rocke D.M., and Woodruff D.L. Some computational issues in cluster analysis with no a priori metric. CSDA 31 (1999) 1-11
13. Cook W.J., Cunningham W.H., Pulleyblank W.R., and Schrijver A. Combinatorial Optimization (1998), Wiley, New York etc
14. Cuesta-Albertos J.A., Gordaliza A., and Matrán C. Trimmed k-means: An attempt to robustify quantizers. Ann. Statist. 25 (1997) 553-576
15. Davies L., and Gather U. The identification of multiple outliers. JASA 88 (1993) 782-792
16. Edmonds J., and Karp R. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19 (1972) 248-264
17. Fisher R.A. The use of multiple measurements in taxonomic problems. Ann. Eugenics 7 (1936) 179-188
18. Fraley C., and Raftery A.E. Model-based clustering, discriminant analysis, and density estimation. JASA 97 (2002) 611-631
19. Friedman H., and Rubin J. On some invariant criteria for grouping data. JASA 62 (1967) 1159-1178
20. Fulkerson D. An out-of-kilter method for minimal cost flow problems. J. SIAM 9 (1961) 18-27
21. Gabow H.N., and Tarjan R.E. Faster scaling algorithms for network problems. SIAM J. Comput. 18 (1989) 1013-1036
22. Gallegos M.T., and Ritter G. A robust method for cluster analysis. Ann. Statist. 33 (2005) 347-380
23. Gallegos M.T., and Ritter G. Trimming algorithms for clustering contaminated grouped data and their robustness. Adv. Data Anal. Classif. 3 (2009) 135-167 10.1007/s11634-009-0044-9
24. García-Escudero L.A., Gordaliza A., Matrán C., and Mayo-Iscar A. A general trimming approach to robust cluster analysis. Ann. Stat. 36 (2008) 1324-1345
25. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco
26. Goldberg A.V., and Tarjan R.E. Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15 (1990) 430-466
27. Gordon A.D. Classification. second ed. Monographs on Statistics and Applied Probability vol. 82 (1999), CRC Press
28. Gusfield D., Martel C., and Fernandez-Baca D. Fast algorithms for bipartite network flow. SIAM J. Comput. 16 (1987) 237-251
29. Hartigan J.A. Asymptotic distributions for clustering criteria. Ann. Stat. 6 (1978) 117-131
30. Hathaway R.J. A constrained formulation of maximum-likelihood estimation for normal mixture distributions. Ann. Stat. 13 (1985) 795-800
31. Hung M.S., and Rom W.O. Solving the assignment problem by relaxation. Oper. Res. 28 (1980) 969-982
32. Jancey R. Multidimensional group analysis. Austral. J. Botany 14 (1966) 127-130
33. Kéribin C. Consistent estimation of the order of mixture models. Sankhyā 62 Ser. A (2000) 49-66
34. Kleinschmidt P., Lee C.W., and Schannath H. Transportation problems which can be solved by use of Hirsch paths for the dual problem. Math. Program. 37 (1987) 153-168
35. Knuth D.E. The Art of Computer Programming. 2nd ed. vol. 2 (1981), Addison-Wesley, Reading, Menlo Park, London, Amsterdam, Don Mills, Sydney
36. Lawler E. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart and Winston, New York
37. Li B. A new approach to cluster analysis: The clustering-function-based method. J. R. Stat. Soc., Series B 68 (2006) 457-476
38. MacQueen, J., 1967. Some methods for classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Math. Statist. Probab. pp. 281-297
39. Mardia K., Kent T., and Bibby J. Multivariate Analysis (1979), Academic Press, London, New York, Toronto, Sydney, San Francisco
40. McLachlan G.J., and Peel D. Finite Mixture Models (2000), Wiley, New York etc
41. Mecklin C.J., and Mundfrom D.J. An appraisal and bibliography of tests for multivariate normality. Internat. Statist. Rev. 72 1 (2004) 123-138
42. Milligan G., and Cooper M. An examination of procedures for determining the number of clusters in a data set. Psychometrika 50 (1985) 159-179
43. Neykov N., Filzmoser P., Dimova R., and Neytchev P. Robust fitting of mixtures using the trimmed likelihood estimator. CSDA 52 (2007) 299-308
44. Orlin, J.B., 1988. A faster strongly polynomial minimum cost flow algorithm. In: Proc. 20th ACM Symp. Theory of Computing, pp. 377-387
45. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization (1982), Prentice-Hall, Englewood Cliffs, New Jersey
46. Pollard D. Strong consistency of k-means clustering. Ann. Stat. 9 (1981) 135-140
47. Pollard D. A central limit theorem for k-means clustering. Ann. Probab. 10 (1982) 919-926
48. Rocke D.M., and Woodruff D.L. Identification of outliers in multivariate data. JASA 91 (1996) 1047-1061
49. Rocke, D.M., Woodruff, D.L., 1999. A synthesis of outlier detection and cluster identification. Tech. rep., University of California, Davis http://handel.cipic.ucdavis.edu/~dmrocke/Synth5.pdf
50. Rousseeuw P.J. Multivariate estimation with high breakdown point. In: Grossmann W., Pflug G.C., Vincze I., and Wertz W. (Eds). Mathematical Statistics and Applications vol. 8B. (1985), Reidel, Dordrecht, Boston, Lancaster, Tokyo 283-297
51. Rousseeuw P.J., and Van Driessen K. A fast algorithm for the minimum covariance determinant estimator. Technometrics 41 (1999) 212-223
52. Schroeder A. Analyse d'un mélange de distributions de probabilités de même type. Rev. Statist. Appl. 24 (1976) 39-62
53. Schwarz G. Estimating the dimension of a model. Ann. Stat. 6 (1978) 461-464
54. Scott A., and Symons M.J. Clustering methods based on likelihood ratio criteria. Biometrics 27 (1971) 387-397
55. Sedgewick R. Algorithms in C. third ed. Graph Algorithms. vol. 5 (2002), Addison-Wesley, Boston
56. Steinhaus H. Sur la division des corps matériels en parties. Bull. Acad. Polon. Sci. 4 (1956) 801-804
57. Symons M.J. Clustering criteria and multivariate normal mixtures. Biometrics 37 (1981) 35-43
58. Tibshirani R., Walther G., and Hastie T. Estimating the number of clusters in a data set via the gap statistic. J. R. Stat. Soc. Ser. B 63 (2001) 411-423
59. Tokuyama, T., Nakano, J., 1991. Geometric algorithms for a minimum cost assignment problem. In: Proc. 7th ACM Symp. on Computational Geometry, pp. 262-271
60. Tokuyama T., and Nakano J. Efficient algorithms for the Hitchcock transportation problem. SIAM J. Comput. 24 (1995) 563-578
61. Tokuyama T., and Nakano J. Geometric algorithms for the minimum cost assignment problem. Random Structures Algorithms 6 (1995) 393-406
62. Tso M., Kleinschmidt P., Mitterreiter I., and Graham J. An efficient transportation algorithm for automatic chromosome karyotyping. Pattern. Recog. Lett. 12 (1991) 117-126
63. Ward Jr. J.H. Hierarchical grouping to optimize an objective function. JASA 58 (1963) 236-244
64. Wolfe J. Pattern clustering by multivariate mixture analysis. Multivariate Behavioral Res. 5 (1970) 329-350
65. Woodruff D.L., and Reiners T. Experiments with, and on, algorithms for maximum likelihood clustering. CSDA 47 (2004) 237-252