Two Phase Clustering Approach in Data Mining : A Review

Authors

  • Vashali  M. Tech. Scholar, Department of Computer Science & Engineering Manav Institutes of Technology & Management, Haryana, India
  • Shagun  Asstt. Professor, Department of Computer Science & Engineering Manav Institutes of Technology & Management, Haryana, India

Keywords:

huge statistics, SQL, BD

Abstract

In clustering, dissimilarity is measured between gadgets by way of measuring the Euclidean distance among every pair of items. Analysis of cluster is a descriptive assignment that perceive homogenous group of objects and it is also one of the fundamental analytical method in facts mining. mean Shift clustering does now not depend upon a priori information of the wide variety of clusters while ok-way algorithm is an unmanaged clustering set of rules that classifies the enter records factors into multiple clusters k based on their inherent distance from each other. On this assessment, the outline of mean shift and okay-way algorithm is provided.

References

  1. F Gibou and R. Fedkiw, "A Fast Hybrid k-Means Level Set Algorithm for Segmentation". 4th Annual Hawaii International Conference on Statistics and Mathematics 2002, pp. 1-11; 2004.
  2. K Sravya and S. Vaseem Akram, "Medical Image Segmentation by using the Pillar K-means Algorithm", International Journal of Advanced Engineering Technologies Vol. 1, Issue1; 2013.
  3. G Pradeepini and S. Jyothi, "An improved k-means clustering algorithm with refined initial centroids". Publications of Problems and Application in Engineering Research. Vol 04, Special Issue 01; 2013.
  4. G Frahling and C. Sohler, "A fast k-means implementation using coresets". International Journal of Computer Geometry and Applications 18(6): pp. 605-625; 2008.
  5. C Elkan, "Using the Triangle Inequality to Accelerate k-means", Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003), Washington DC, pp. 147-153; 2003.
  6. K Wagsta, C. Cardie, S. Rogers and S. Schroedl, "Constrained K-means Clustering with Background Knowledge", Proceedings of the Eighteenth International Conference on Machine Learning, pp. 577-584; 2001.
  7. J. Yadav and M. Sharma, "A Review of K-mean Algorithm". International Journal of Engineering Trends and Technology. Volume 4, Issue 7, pp. 2972-2976; 2013.
  8. J. Han and M. Kamber, "Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco, CA, 2001.
  9. J. Gu; J. Zhou and X. Chen, "An Enhancement of K-means Clustering Algorithm". In proceedings of Business Intelligence and Financial Engineering (BIFE '09); 2009.
  10. D. Mal yszko and S. T. Wierzchon "Standard and Genetic K-means Clustering Techniques in Image Segmentation", (CISIM'07) 0-7695-2894-5/07 IEEE 2007.
  11. Sumant V. Joshi and Atul. N. Shire, "A Review of an enhanced algorithm for color Image Segmentation", International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 3, pp. 435-440; 2013.
  12. J. Wang and X. Su; "An improved K-means Clustering Algorithm". In proceedings of 3rd International Conference on Communication Software and Networks (ICCSN), 2011.
  13. C. Kearney and Andrew J. Patton, "Information gain ranking". Financial Review, 41, pp. 29-48; 2000.
  14. R.V. Singh and M.P.S. Bhatia, "Data Clustering with Modified K-means Algorithm". In proceeding of International Conference on Recent Trends in Information Technology (ICRTIT), 2011.
  15. Li Xinwu, "Research on Text Clustering Algorithm Based on Improved K-means". In proceedings of Computer Design and Applications (ICCDA), Vol. 4, pp.: V4-573 - V4-576; 2010.

Downloads

Published

2018-06-30

Issue

Section

Research Articles

How to Cite

[1]
Vashali, Shagun, " Two Phase Clustering Approach in Data Mining : A Review, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 5, pp.726-731, May-June-2018.