Optimal Clustering Method Based on Genetic Algorithm

  • Satish Gajawada
  • Durga Toshniwal
  • Nagamma Patil
  • Kumkum Garg
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 131)


Clustering methods divide the dataset into groups called clusters such that the objects in the same cluster are more similar and objects in the different clusters are dissimilar. Clustering algorithms can be hierarchical or partitional. Partitional clustering methods decompose the dataset into set of disjoint clusters. Most partitional approaches assume that the number of clusters are known a priori. Moreover, they are sensitive to initialization. Hierarchical clustering methods produce a complete sequence of clustering solutions, either from singleton clusters to a cluster including all individuals or vice versa. Hierarchical clustering can be represented by help of a dendrogram that can be cut at different levels to obtain different number of clusters of corresponding granularities. If dataset has large multilevel hierarchies then it becomes difficult to determine optimal clustering by cutting the dendrogram at every level and validating clusters obtained for each level. Genetic Algorithms (GAs) have proven to be a promising technique for solving complex optimization problems. In this paper, we propose an Optimal Clustering Genetic Algorithm (OCGA) to find optimal number of clusters. The proposed method has been applied on some artificially generated datasets. It has been observed that it took less number of iterations of cluster validation to arrive at optimal number of clusters.


Genetic algorithm hierarchical clustering optimal clusters dendrogram 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York (1981)MATHGoogle Scholar
  2. 2.
    Bezdek, J.C., Keller, J., Krisnapuram, R., Pal, N.R.: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. Kluwer, Boston (1999)MATHGoogle Scholar
  3. 3.
    Dubes, R., Jain, A.K.: Clustering techniques: The user’s dilemma. Pattern Recognition 8, 247–260 (1976)CrossRefGoogle Scholar
  4. 4.
    Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)MATHGoogle Scholar
  5. 5.
    Hopper, F., Klawonn, F., Kruse, R., Runkler, T.: Fuzzy Cluster Analysis. Wiley, New York (1999)Google Scholar
  6. 6.
    Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)CrossRefGoogle Scholar
  7. 7.
    Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)MATHGoogle Scholar
  8. 8.
    Lance, G.N., Williams, W.T.: A general theory of classificatory sorting strategies: II clustering systems. Comput. J. 10, 271–277 (1967)CrossRefGoogle Scholar
  9. 9.
    Xu, R., Wunsch, D.: Survey of Clustering Algorithms. IEEE Transactions on Neural Networks 16(3) (May 2005)Google Scholar
  10. 10.
    Han, J., Kamber, M.: Data Mining Concepts and Techniques. 2nd edn. ElsevierGoogle Scholar
  11. 11.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press (1975)Google Scholar
  12. 12.
    Sheikh, R.H., Raghuwanshi, M.M., Jaiswal, A.N.: Genetic Algorithm Based Clustering: A Survey. In: First International Conference on Emerging Trends in Engineering and Technology, pp. 314–319. IEEE (2008)Google Scholar
  13. 13.
    Dunn, J.C.: A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J. Cybern. 3, 32–57 (1973)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Murthy, C.A., Chowdhury, N.: In search of optimal clusters using genetic algorithms. Pattern Recognition Letters 17, 825–832 (1996)CrossRefGoogle Scholar
  15. 15.
    Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on K-Means algorithm for optimal clustering in RN. Information Sciences 146, 221–237 (2002)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Kefe, Y.L., Liz, X.: A Hybrid Genetic Based Clustering Algorithm. In: Proc. of the 3rd Int. Conf. on Machine Learning and Cybernetics, Shanghai, August 26-29, pp. 1677–1682 (2004)Google Scholar
  17. 17.
    Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recognition 33, 1455–1465 (2000)CrossRefGoogle Scholar
  18. 18.
    Bandyopadhyay, S., Maulik, U.: Nonparametric genetic clustering: comparison of validity indices. IEEE Trans. on Systems, Man, and Cybernetics, Part C: Applications and Reviews 31(1), 120–125 (2001)CrossRefGoogle Scholar
  19. 19.
    Tseng, L.Y., Yang, S.B.: A genetic approach to the automatic clustering algorithm. Pattern Recognition 34(2), 415–424 (2001)MATHCrossRefGoogle Scholar
  20. 20.
    Bandyopadhyay, S., Maulik, U.: Genetic clustering for automatic evolution of clusters and application to image classification. Pattern Recognition 35(6), 1197–1208 (2002)MATHCrossRefGoogle Scholar
  21. 21.
    Lin, H.J., Yang, F.W., Kao, Y.T.: An efficient GA-based clustering technique. Tamkang Jour. of Science and Engineering 8(2), 113–122 (2005)Google Scholar
  22. 22.
    Liu, Y., Ye, M., Peng, J., Wu, H.: Finding the Optimal Number of Clusters Using Genetic Algorithms. In: IEEE Conference on Cybernetics and Intelligent Systems, pp. 1325–1330 (2008)Google Scholar

Copyright information

© Springer India Pvt. Ltd. 2012

Authors and Affiliations

  • Satish Gajawada
    • 1
  • Durga Toshniwal
    • 1
  • Nagamma Patil
    • 1
  • Kumkum Garg
    • 2
  1. 1.Department of Electronics and Computer EngineeringIndian Institute of Technology RoorkeeRoorkeeIndia
  2. 2.Department of Computer Science and EngineeringManipal Institute of TechnologyManipalIndia

Personalised recommendations