Comprehensive Analysis of Data Clustering Algorithms

Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 235)


We have given a comprehensive comparative analysis of various clustering algorithms. Clustering algorithms usually employ distance metric or similarity matrix to cluster the data set into different partitions. Well known clustering algorithms have been widely used in various disciplines. Type of clustering algorithm used depends upon the application and data set used in that field. Numerical data set is comparatively easy to implement as data are invariably real numbers. Others type of data set such as categorical, time series, boolean, and spatial, temporal have limited applications. It is observed that there is no optimal solution for handling problems with large data sets of mixed and categorical attributes. Some of the algorithms can be applied but their performance degrades as the size of data keeps on increasing.


Data clustering Statistical analysis Special Temporal Hierarchical clustering 


  1. 1.
    Jain AK (2009) Data clustering: 50 years beyond k-means. In: 19th international conference in pattern recognitionGoogle Scholar
  2. 2.
    Zhan T, Zhou Y (2012) Clustering algorithm on high-dimension data partitional mended attribute. In: 9th international conference on fuzzy systems and knowledge discovery, IEEEGoogle Scholar
  3. 3.
    Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD’96Google Scholar
  4. 4.
    Nanda SJ, Panda G (2012) Accurate partitional clustering algorithm based on immunized PSO. In: IEEE ICAESM 30–31 MarchGoogle Scholar
  5. 5.
    Ahmad A, Dey L (2007) A k-mean clustering algorithm for mixed numeric and categorical data. Sci Direct Data Knowl Eng 63:503–527CrossRefGoogle Scholar
  6. 6.
    Hinneburg A, Keim DA (1998) An efficient approach to clustering in large multimedia databases with noise. American Association for Artificial Intelligence, New York Google Scholar
  7. 7.
    Guha S, Rastogi R, Kyuseok S (1999) ROCK: a robust clustering algorithm for categorical attributes. In: Proceedings of 15th international conference on data engineering, Sydney, Australia, 23–26 March, pp 512–521Google Scholar
  8. 8.
    Ng R, Han J (1994) Efficient and effective clustering method for spatial data mining. In: Proceedings of the 20th international conference on very large data bases, Santiago, Chile, pp 144–155Google Scholar
  9. 9.
    Karypis G, Han E-H, Kumar V (1999) CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Comput 32(8):68–75CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.ITM UniversityGurgaonIndia
  2. 2.BIT MesraRanchiIndia

Personalised recommendations