In search of optimal clusters using genetic algorithms

Pattern Recognition Letters

Volumn 17, Issue 8, 1996, Pages 825-832

  Murthy, C A ^a   Chowdhury, Nirmalya ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b Ramakrishna Mission Shilpapitha   (India)

Author keywords

Clustering; Genetic algorithms; K means; Pattern recognition

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING; STATISTICAL METHODS;

CLUSTERING PROBLEM; K MEANS; REAL LIFE DATA SETS; SYNTHETIC DATA SETS;

PATTERN RECOGNITION;

EID: 0030189865     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(96)00043-8     Document Type: Article

References (17)

1. Anderberg, M.R. (1973). Cluster Analysis for Application. Academic Press, New York.
2. Ankerbrandt, C.A., B.P. Unckles and F.E. Petry (1990). Scene recognition using genetic algorithms with semantic nets. Pattern Recognition Lett. 11, 285-293.
3. Belew, R. and L. Booker, Eds. (1991). Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann, Los Altos, CA.
4. Bhandari, D., C.A. Murthy and S.K. Pal (1996). Genetic algorithm with elitist model and its convergence. Internat. J. Pattern Recognition Artificial Intelligence, Accepted.
5. Bornholdt, S. and D. Graudenz (1992). Genetic asymptotic and neural networks and structure design by genetic algorithms. Neural Networks 5, 327-334.
6. Davis, T.E. and C.J. Principe (1991). A simulated annealing like convergence theory for the simple genetic algorithm. In: (Belew and Booker, 1991), 174-181.
7. Devijver, P.A. and J. Kittler (1982). Pattern Recognition: A Statistical Approach. Prentice-Hall International, Hemel Hemstead, Hertfordshire, UK.
8. Goldberg, D.E. (1989). Genetic Algorithms: Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.
9. Jain, A.K. and R.C. Dubes (1988). Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ.
10. Johnson, R.A. and D.W. Wichern (1982). Applied Multivariate Statistical Analysis. Prentice-Hall, Englewood Cliffs, NJ.
11. Jones, D.R. and M.A. Beltramo (1991). Solving partitioning problems with genetic algorithms. In: (Belew and Booker, 1991), 442-449.
12. Michalewicz, Z. (1992). Genetic Algorithms + Data Structure = Evolution Programs. Springer, Berlin.
13. Murthy, C.A., D. Bhandari and S.K. Pal (1996). Epsilon optimal stopping time for genetic algorithms with Elitist model. IEEE Trans. Syst. Man Cybernet., Submitted.
14. Selim, S.Z. and M.A. Ismail (1984). K-means type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell. 6 (1), 81-87.
15. Spath, H. (1980). Cluster Analysis Algorithms. Ellis Horwood, Chichester, UK.
16. Tou, T.J. and C.R. Gonzalez (1974). Pattern Recognition Principles. Addison-Wesley, Reading, MA.
17. Qi, Xiaofeng and F. Palmieri (1994). Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, Pan I: Basic properties of selection and mutation. IEEE Trans. Neural Networks 5 (1), 102-119.