Newtonian clustering: An approach based on molecular dynamics and global optimization

Pattern Recognition

Volumn 40, Issue 6, 2007, Pages 1734-1744

  Blekas, K ^a   Lagaris, I E ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Clustering; Global optimization; Molecular dynamics; Order statistics

Indexed keywords

CONFORMAL MAPPING; GLOBAL OPTIMIZATION; LEARNING ALGORITHMS; MATHEMATICAL MODELS; MOLECULAR DYNAMICS; NONLINEAR EQUATIONS;

DATA POINTS; NEWTONIAN CLUSTERING; ORDER STATISTICS;

DATA STRUCTURES;

EID: 33947188020     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.07.012     Document Type: Article

References (35)

1. Hardigan J.A. Clustering Algorithms (1975), Wiley, New York
2. Fukunaga K. Introduction to Statistical Pattern Recognition (1990), Academic Press, San Diego
3. Bishop C.M. Neural Networks for Pattern Recognition (1995), Oxford University Press Inc., New York
4. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification (2001), Wiley-Interscience, New York
5. McLachlan G.M., and Peel D. Finite Mixture Models (2001), Wiley, New York
6. Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. B 39 (1977) 1-38
7. Milligan G.W., and Cooper M.C. An examination of procedures for determining the number of clusters in a data set. Psychometrika 50 (1985) 159-179
8. Kass R.E., and Raftery A.E. Bayes factors. J. Am. Stat. Assoc. 90 (1995) 773-795
9. Hardy A. On the number of clusters. Comput. Stat. Data Anal. 23 (1996) 83-96
10. Fraley C., and Raftery A.E. How many clusters? Which clustering method? Answers via model-based cluster analysis. Comput. J. 4 (1998) 578-588
11. H. Akaike, Information theory and an extension of the maximum likelihood principle, in: Second International Symposium on Information Theory, Budapest, 1973, pp. 267-281.
12. Schwarz G. Estimating the dimension of a model. Ann. Stat. 6 (1978) 461-464
13. Smyth P. Model selection for probabilistic clustering using cross-validated likelihood. Stat. Comput. 10 (2000) 63-72
14. Chickering D., and Heckerman D. Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Mach. Learning 29 2-3 (1997) 181-212
15. Green P. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika 82 (1995) 711-732
16. H. Chipman, E.I. George, R.E. McCulloch, The practical implementation of Bayesian model selection (with discussion), IMS Lecture Notes-Monograph Series, vol. 38, 2001, pp. 67-134.
17. A. Corduneanu, C.M. Bishop, Variational Bayesian model selection for mixture distributions, in: AI and Statistics, 2001, pp. 27-34.
18. Figueiredo M.A., and Jain A.K. Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Mach. Intell. 24 3 (2002) 381-396
19. Blekas K., Likas A., Galatsanos N.P., and Lagaris I.E. A spatially-constrained mixture model for image segmentation. IEEE Trans. Neural Networks 16 2 (2005) 494-498
20. Baldi P., and Brunak S. Bioinformatics: The Machine Learning Approach (1998), MIT Press, Cambridge
21. Boender C.G.E., Kan A.H.G.R., Timmer G.T., and Stougie L. A stochastic method for global optimization. Math. Programming 22 (1982) 125-140
22. Kan A.H.G.R., and Timmer G.T. Stochastic global optimization methods. Part I: clustering methods. Math. Programming 39 (1987) 27-56
23. Kan A.H.G.R., and Timmer G.T. Stochastic global optimization methods. Part II: multi level methods. Math. Programming 39 (1987) 57-78
24. Torn A., and Viitanen S. Topographical global optimization using pre-sampled points. J. Global Optim. 5 (1994) 267-276
25. Ali M.M., and Storey C. Topographical multilevel single linkage. J. Global Optim. 5 (1994) 349-358
26. Theos F.V., Lagaris I.E., and Papageorgiou D.G. PANMIN: sequential and parallel global optimization procedures with a variety of options for the local search strategy. Comput. Phys. Commun. 159 (2004) 63-69
27. Horn D., and Gottlieb A. The method of quantum clustering. In: Dietterich T.G., Becker S., and Ghahramani Z. (Eds). Advances in Neural Information Processing Systems 14 (2001), MIT Press, Cambridge, MA 769-776
28. D Horn, A. Gottlieb, Algorithm for data clustering in pattern recognition problems based on quantum mechanics, Phys. Rev. Lett. 88(1) (2002) 018702-4.
29. Vlassis N., and Likas A. A greedy EM algorithm for Gaussian mixture learning. Neural Process. Lett. 15 (2001) 77-87
30. Verbeek J.J., Vlassis N., and Krose B. Efficient greedy learning of Gaussian mixture models. Neural Comput. 15 2 (2003) 469-485
31. Parzen E. On estimation of a probability density function and mode. Ann. Math. Stat. 33 (1962) 1065-1076
32. Heermann D.W. Computer Simulation Methods in Theoretical Physics (1986), Springer, Berlin, Heidelberg, New York
33. Papageorgiou D.G., Demetropoulos I.N., and Lagaris I.E. Merlin-3.0: a multi-dimensional optimization environment. Comput. Phys. Commun. 109 (1998) 227-249
34. Ripley B.D. Pattern Recognition and Neural Networks (1996), Cambridge University Press Inc., Cambridge, UK
35. C.J. Merz, P.M. Murphy, UCI repository of machine learning databases, 〈http://www.ics.uci.edu/~mlearn/MLRepository.html〉, Irvine, CA, 1998.