Experiments with, and on, algorithms for maximum likelihood clustering

Elements of statistics, computer science, and operations research are connected with optimization heuristics as the catalyst. Heuristic search is used as a basis for a maximum likelihood clustering algorithm and it is demonstrated that clustering can be used to improve heuristic search algorithm performance. An important problem is described, a neighborhood structure for the problem is provided, and its value for heuristic algorithm development is demonstrated.

[1]  P. Rousseeuw Multivariate estimation with high breakdown point , 1985 .

[2]  Geoffrey J. McLachlan,et al.  Mixture models : inference and applications to clustering , 1989 .

[3]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[4]  J. H. Ward Hierarchical Grouping to Optimize an Objective Function , 1963 .

[5]  K HirjiKarim Discovering data mining , 1999 .

[6]  Fionn Murtagh,et al.  Cluster Dissection and Analysis: Theory, Fortran Programs, Examples. , 1986 .

[7]  Christian Hennig,et al.  Validating visual clusters in large datasets: fixed point clusters of spectral features , 2002 .

[8]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[9]  A. Raftery,et al.  Model-based Gaussian and non-Gaussian clustering , 1993 .

[10]  G. P. McKeown,et al.  Optimization Software Class Libraries , 2002, Operations Research/Computer Science Interfaces Series.

[11]  Douglas M. Hawkins,et al.  The feasible solution algorithm for the minimum covariance determinant estimator in multivariate data , 1994 .

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  R. Fisher THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[14]  David M. Rocke,et al.  Computable Robust Estimation of Multivariate Location and Shape in High Dimension Using Compound Estimators , 1994 .

[15]  A. Scott,et al.  Clustering methods based on likelihood ratio criteria. , 1971 .

[16]  Peter J. Rousseeuw,et al.  Robust regression and outlier detection , 1987 .

[17]  Adrian E. Raftery,et al.  Fitting straight lines to point patterns , 1984, Pattern Recognit..

[18]  Paul Fischer,et al.  The complexity of computing the MCD-estimator , 2004, Theor. Comput. Sci..

[19]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .

[20]  G. J. McLachlan,et al.  9 The classification and mixture maximum likelihood approaches to cluster analysis , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[21]  Joaquín A. Pacheco,et al.  Design of hybrids for the minimum sum-of-squares clustering problem , 2003, Comput. Stat. Data Anal..

[22]  David L. Woodruff,et al.  Optimization software class libraries , 2002 .

[23]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[24]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..