Grouping Genetic Algorithm for Data Clustering

  • Santhosh Peddi
  • Alok Singh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7076)


Clustering can be visualized as a grouping problem as it consists of identifying finite set of groups in a dataset. Grouping genetic algorithms are specially designed to handle grouping problems. As the clustering criteria such as minimizing the with-in cluster distance is high-dimensional, non-linear and multi-modal, many standard algorithms available in the literature for clustering tend to converge to a locally optimal solution and/or have slow convergence. Even genetic guided clustering algorithms which are capable of identifying better quality solutions in general are also not totally immune to these shortcomings because of their ad hoc approach towards clustering invalidity and context insensitivity. To remove these shortcomings we have proposed a hybrid steady-state grouping genetic algorithm. Computational results show the effectiveness of our approach.


Grouping Genetic Algorithm Data Clustering Heuristic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jain, A.K., Murthy, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys 13, 264–323 (1999)CrossRefGoogle Scholar
  2. 2.
    Hong, Y., Kwong, S.: To combine steady state genetic algorithm and ensemble learning for data clustering. Pattern Recognition Letters 29, 1416–1423 (2008)CrossRefGoogle Scholar
  3. 3.
    Krishna, K., Murthy, M.N.: Genetic K-means Algorithm. IEEE Transactions on Systems, Man Cybernetic - Part B 29, 433–439 (1999)CrossRefGoogle Scholar
  4. 4.
    Painho, M., Fernando, B.: Using genetic algorithms in clustering problems. In: Proceedings of the 5th International Conference on GeoComputation (2000)Google Scholar
  5. 5.
    Kuncheva, L.I., Bezdeck, J.C.: Nearest prototype classification: clustering genetic algorithm or random search? IEEE Transactions on. Systems, Man and Cybernetics - Part B 28, 160–164 (1998)CrossRefGoogle Scholar
  6. 6.
    Franti, P.: Genetic algorithm with deterministic crossover for vector quantization. Pattern recognition Letters 21, 61–68 (2000)CrossRefGoogle Scholar
  7. 7.
    Garai, G., Chaudhury, B.B.: A novel genetic algorithm for automatic clustering. Pattern Recognition Letters 25, 173–187 (2004)CrossRefGoogle Scholar
  8. 8.
    Mitra, S.: An evolutionary rough partitive clustering. Pattern Recognition Letters 25, 1439–1449 (2004)CrossRefGoogle Scholar
  9. 9.
    Martnez-Otzeta, J.M., Sierra, B., Lazkano, E., Astigarraga, A.: Classifier hierarchy learning by means of genetic algorithms. Pattern Recognition Letters 27, 1998–2004 (2006)CrossRefGoogle Scholar
  10. 10.
    Falkenauer, E.: Genetic algorithms and grouping problems. John Wiley & Sons, Chicester (1998)zbMATHGoogle Scholar
  11. 11.
    Sheng, W., Tucker, A., Liu, X.: Clustering with Niching Genetic K-means Algorithm. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 162–173. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Fred, A., Jain, A.K.: Combining multiple clusterings using evidence accumulation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 835–850 (2005)CrossRefGoogle Scholar
  13. 13.
    Singh, A., Gupta, A.K.: Two heuristics for the one-dimensional bin-packing problem. OR Spectrum 29, 765–781 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Ho, T.K.: The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 832–844 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Santhosh Peddi
    • 1
  • Alok Singh
    • 1
  1. 1.Department of Computer and Information SciencesUniversity of HyderabadHyderabadIndia

Personalised recommendations