Advertisement

A Comprehensive Analysis of the Most Common Hard Clustering Algorithms

  • Aditya VardhanEmail author
  • Priyanshu Sarmah
  • Arunav Das
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 98)

Abstract

From past decades, Clustering is the process of observation that set assignment into subsets called clusters. It is an unsupervised method and can be grouped as hard and soft clustering. Hard clustering methods assign the sample point to a specific cluster whereas soft clustering methods give a probability of assignment to all clusters. In this paper, we have tried to give intuition to some of the popular hard clustering methods with their associated algorithms.

Keywords

Unsupervised machine learning K-means clustering algorithm DBSCAN Mean Shift Algorithm Hierarchical Clustering Cluster dissimilarities 

References

  1. 1.
    Esteves, R.M., Hacker, T., Rong, C.: Competitive K-Means, a new accurate and distributed K-Means algorithm for large datasets. In: 2013 IEEE 5th International Conference on Cloud Computing Technology and Science, Bristol, pp. 17–24 (2013).  https://doi.org/10.1109/cloudcom.2013.89
  2. 2.
    Shi, N., Liu, X., Guan, Y.: Research on k-means clustering algorithm: an improved k-means clustering algorithm. In: 2010 Third International Symposium on Intelligent Information Technology and Security Informatics, Jinggangshan, pp. 63–67 (2010)Google Scholar
  3. 3.
  4. 4.
    Advantages & Disadvantages of k-Means and Hierarchical Clustering (Unsupervised Learning). Machine Learning for Language Technology ML4LT (2016). Marina San, Department of Linguistics and Philology, Uppsala UniversityGoogle Scholar
  5. 5.
    Smiti, A., Elouedi, Z.: Dynamic DBSCAN-GM clustering algorithm. In: 2015 16th IEEE International Symposium on Computational Intelligence and Informatics (CINTI), pp. 311–316 (2015)Google Scholar
  6. 6.
    Bansal, K., Bansal, M.: Dynamic data clustering and visualization using FDClust algorithm. In: 2017 International Conference on Computer Communication and Informatics (ICCCI), pp. 1–5 (2017)Google Scholar
  7. 7.
    Zhang, L., Deng, S., Li, S.: Analysis of power consumer behaviour based on the complementation of K-means and DBSCAN. In: 2017 IEEE Conference on Energy Internet and Energy System Integration (EI2), Beijing, pp. 1–5 (2017).  https://doi.org/10.1109/ei2.2017.8245490
  8. 8.
    Ghuman, S.S.: Clustering techniques - a review. Int. J. Comput. Sci. Mob. Comput. 5, 524–530 (2016)Google Scholar
  9. 9.
    Xu, R., Wunsch II, D.: Survey of clustering algorithms (2005)Google Scholar
  10. 10.
    Wang, L., Li, M., Han, X., Zheng, K.: An improved density-based spatial clustering of application with noise. Int. J. Comput. Appl. (2018)Google Scholar
  11. 11.
    Yu, Y., Zhao, J., Wang, X., Wang, Q., Zhang, Y.: Cludoop: an efficient distributed density-based clustering for big data using hadoop. Int. J. Distrib. Sens. Netw. 11, 579391 (2015)CrossRefGoogle Scholar
  12. 12.
    Smiti, A., Elouedi, Z.: DBSCAN-GM: an improved clustering method based on Gaussian Means and DBSCAN techniques. In: 2012 IEEE 16th International Conference on Intelligent Engineering Systems (INES) (2012)Google Scholar
  13. 13.
    Jain, A.K., Narasimha Murty, M., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264–323 (1999)CrossRefGoogle Scholar
  14. 14.
    Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. In: KDD Workshop on Text Mining, vol. 400, no. 1 (2000)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.OdishaIndia

Personalised recommendations