International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 229    Submit Your Rating     Cite This   Download        Certificate

INFERENCE & LEARNING OF MINING PATTERN WITH MULTI DIMENSIONAL CLUSTERS

    1 Author(s):  S. KOWSALYA

Vol -  9, Issue- 4 ,         Page(s) : 277 - 282  (2018 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging from geo-spatial data to bio-medical knowledge. The amount of spatial data being collected is increasing exponentially. So, it far exceeded human’s ability to analyze. Recently, clustering has been recognized as a primary data mining method for knowledge discovery in spatial database. The development of clustering algorithms has received a lot of attention in the last few years and new clustering algorithms are proposed. DBSCAN is a pioneer density based clustering algorithm. It can find out the clusters of different shapes and sizes from the large amount of data containing noise and outliers. This paper shows the results of analyzing the properties of density based clustering characteristics of three clustering algorithms namely DBSCAN, k-means and SOM using synthetic two dimensional spatial data sets.

  1. Kaufman L. and Rousseeuw P. J (1990), “Finding Groups in Data: An Introduction to Cluster Analysis”, John Wiley & Sons.
  2. Ankerst M., Markus M. B., Kriegel H., Sander J(1999), “OPTICS: Ordering Points To Identify the Clustering Structure”, Proc.ACM SIGMOD’99 Int. Conf. On Management of Data, Philadelphia, PA, pp.49-60.
  3. Guha S, Rastogi R, Shim K (1998), “CURE: An efficient clustering algorithm for large databases”, In: SIGMOD Conference, pp.73~84.
  4. Ester M., Kriegel H., Sander J., Xiaowei Xu (1996), “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, KDD’96, Portland, OR, pp.226-231.
  5. Wang W., Yang J., MuntzR(1997), “STING: A statistical information grid approach to spatial data mining”, In: Proc. of the 23rd VLDB Conf. Athens, pp.186~195.
  6. Raymond T. Ng and Jiawei Han (2002), “CLARANS: A Method for Clustering Objects for Spatial Data Mining”, IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5.
  7. Rakesh A., Johanners G., Dimitrios G., Prabhakar R(1999), “Automatic subspace clustering of high dimensional data for data mining applications”, In: Proc. of the ACM SIGMOD, pp.94~105.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details