Formation of K-Means and Density Based Clustering In Data Mining

Authors

  • Y. Vijay Bhaskar Reddy  Research Scholar, Rayalaseema University, Kurnool, Andhra Pradesh, India
  • Dr. L. S. S. Reddy  Vice Chancellor, KL University, Vaddeswaram, Guntur, Andhra Pradesh, India

Keywords:

Clustering, K-means algorithm, Density based algorithm, epsilon,and Euclidean point.

Abstract

Clustering or Cluster analysis is defined as a method where different data objects are grouped into various data sets distinctly. Each of these different sets contains objects. These are similar to other objects in the same set. Immediately objects in various sets are not at all like each other. K-means clustering is a kind of unsupervised learning; it is utilized unlabeled information (information without characterized classes or gatherings) when we have. The point of this algorithm is to discover groups in the information; with the quantity of gatherings spoke to by the variable K. Density based clustering is a method that permits partition of information into bunches with comparative attributes (clusters) however does not require determining the quantity of those gatherings ahead of time. Density based clustering calculation has assumed a critical part to discover non linear shapes structure relies upon the group thickness. Density is estimated by the quantity of information focuses inside some range (epsilon).

References

  1. Lefait, G. and Kechadi, T, (2010) “Customer Segmentation Architecture BasedonClusterinTechniques” Digital Society, ICDS’10, Fourth International Conference, 10-02-2010.
  2. Fraley, Andrew, and Thearting, Kurt (1999). Increasing customer value by integrating data mining and campaign management software. Data Management, 49–53.
  3. P. Bhargavi and S. Jyothi, (2009) “Applying Naïve Bayes Data Mining Technique for Classification of Agricultural land Soils” IJCSNS International Journal of computer Science and Network Security, VOL. 9 No.8, August 117-122.
  4. Zhang T., Ramakrishnan R., and Linvy M. 1997. “BIRCH: An Efficient Data Clustering Method for Very Large Databases”. Data Mining and Knowledge Discovery 1(2): 141-182.
  5. Ng R.T., and Han J. 1994.“Efficient and Effective Clustering Methods for Spatial Data Mining”.Proc. 20th Int. Conf. on Very Large Data Bases. Santiago, Chile, 144-155.
  6. Kaufman L., and Rousseeuw P.J. 1990. “Finding Groups in Data: an Introduction to Cluster Analysis”. John Wiley & Sons.
  7. Hattori K. and Torii Y.: 1993. “Effective algorithms for the nearest neighbour method in the clustering problem”. Pattern Recognition, 26(5): 741-746.
  8. Fayyad U., Piatetsky-Shapiro G., and Smyth P. 1996. “Knowledge Discovery and Data Mining: Towards A Unifying Framework”.Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, 82-88.
  9. Ester M., Kriegel H.-P., Sander J. and Xu X. 1996. “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”.Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining. Portland, OR, 226-231.
  10. Jain Anil K. 1988. “Algorithms for Clustering Data”, Prentice Hall.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2017-12-30

Issue

Volume 3, Issue 8, November-December-2017

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Y. Vijay Bhaskar Reddy, Dr. L. S. S. Reddy, " Formation of K-Means and Density Based Clustering In Data Mining, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 8, pp.1137-1143, November-December-2017.