An Analysis of Clustering Techniques

Authors

  • Pradeep Bolleddu  Computer Science Department, Indian Institute of Technology Ropar, India

DOI:

https://doi.org/10.32628/CSEIT22821

Keywords:

Machine Learning, Clustering, Data Analysis, Python

Abstract

I analyzed different clustering methods of credit card customers data by some machine learning clustering algorithm i approached to classify the high dimensional data by using clustering algorithms in the real world ,It is a type of process where we divide the similar objects into one group The Objective of paper is to identify which method gives a general view of clustering techniques like K-means, algometrive and gaussian distribution ,to analyze Segmentation of customers can be used to define marketing strategies. Clustering comes under unsupervised learning, if we take data set it contains some input patterns, entities etc. The main aim of clustering is to make partition & to make clusters having similarity, so that we can get some useful insights and make further analyses .The process of finding closely connected and fair information from high dimensional datasets is complex and difficult to carry .In this paper we tried to analyze our model through different clustering models like K-means, DBSCAN, Agglomerative Hierarchical and gaussian mixture model) and I explained about all algorithm that I used unique approaches for clustering the high dimensional data.

References

  1. Cheng-Far Tsai and Tang-Wei Huang (2012) DBSCAN: A Quick Density-Based Clustering Technique Idea International Symposium on Computer, Con-sumer and Control, pp. 638-641.
  2. Amandeep Kaur Mann and Navneet Kaur, “Review Paper on Clustering Techniques”, Global Journal of Computer Science and Technology, Software and Data Engineering (0975-4350), Volume 13 Issue 5 Version 1.0 Year 2013
  3. Mihika Shah and Sindhu Nair, A Survey of Data Mining Clustering Algorithms, International Journal of Computer Applications (0975 – 8887) Volume 128 No.1, October 2015
  4. S. Anitha Elavarasi and Dr. J. Akhilandeshwari (2011) A Survey on Partition Clustering Algorithms, International Journal of Enterprise Computing and Business Systems.
  5. S.Vijayalakshmi and M Punithavalli (2012) A Fast Approach to Cluster-Ing Datasets using DBSCAN and Applications (0975 – 8887) Vol 60– No.14, pp.1-7.
  6. Adela Tudor, Adela Bara, Romania and Juliana Botha (2011). “Solutions for Analyzing CRM Systems-data Mining Algorithms”, International Journal of Computers, Vol. 5, No. 4, pp. 485-493.
  7. Preeti Baser and Dr. Jatinderkumar R. Saini, A Comparative Analysis of Various Clustering Techniques used for Very Large Datasets, International Journal of Computer Science Communication Networks, Vol 3(4),271-275
  8. Sunita Jahirabadkar and Parag Kulkarni (2013) Clustering for High Dimensional Data: Density based Subspace Clustering Algorithms, International Journal of Computer Applications (0975 – 8887) Vol 63 – No.20, pp. 29-35
  9. Agrawal, R and Srikant, R (1994). “Fast algorithms for mining association rules in large databases”, In Proceedings of 20th International Conference on Very Large Databases, Santiago de Chile, Chile, Morgan Kaufmann Publishers Inc., pp. 487–499.
  10. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H and Verkamo, A (1996). “Fast discovery of association rules”, Advances in Knowledge Discovery and Data Mining, American Association for Artificial Intelligence. pp. 307–328.
  11. Ada Wai-Chee Fu and E, Ng Ka (2002). “Efficient Algorithm for Projected Clustering”, Proceedings of the 18th International Conference on Data Engineering, DOI: 10.1109/ICDE.2002.994727.

Downloads

Published

2022-04-30

Issue

Section

Research Articles

How to Cite

[1]
Pradeep Bolleddu, " An Analysis of Clustering Techniques" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 8, Issue 2, pp.52-57, March-April-2022. Available at doi : https://doi.org/10.32628/CSEIT22821