A Study On Spatial Data Clustering Algorithms In Data Mining

The enormous amount of hidden data in large databases has produced incredible interests in the area of data mining. Clustering is an indispensable task in data mining to cluster data into significant subsets to obtain useful information. Clustering spatial data is a significant issue that has been broadly investigated to discover hidden patterns or useful sub-groups and has several applications like satellite imagery, geographic information systems, medical image analysis, etc. The spatial clustering approach is supposed to satisfy the necessities of the application for which the investigation is carried out. In addition the same clustering approach should be very efficient in processing data along with noise and outliers, since they are inherently present in spatial data. In recent times, several commercial data mining clustering approaches have been developed and their practice is increasing enormously to realize desired objective. Researchers are attempting their best efforts to accomplish the fast and effective algorithm for the abstraction of spatial data, which are clearly discussed in the literature. Each individual clustering approach has its own merits and demerits for processing multidimensional data and consequently in spatial clustering.

[1]  Chuang Zhang,et al.  Clustering Spatial Data with Obstacles Using Improved Ant Colony Optimization and Hybrid Particle Swarm Optimization , 2008, 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery.

[2]  L Suresh,et al.  Statistical spatial clustering using spatial data mining , 2008 .

[3]  Jitian Xiao Clustering Spatial Data for Join Operations Using Match-based Partition , 2005 .

[4]  H. Kriegel,et al.  Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support , 2000, Data Mining and Knowledge Discovery.

[5]  Hans-Peter Kriegel,et al.  Spatial Data Mining: A Database Approach , 1997, SSD.

[6]  Yue Chen,et al.  SPANBRE: An Efficient Hierarchical Clustering Algorithm for Spatial Data with Neighborhood Relations , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[7]  Zhanlong Chen,et al.  Spatial data partitioning based on the clustering of minimum distance criterion , 2011, 2011 International Conference on Computer Science and Service System (CSSS).

[8]  Genlin Ji,et al.  A Spatial Clustering Algorithm Based on Spatial Topological Relations for GML Data , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[9]  Jiayao Wang,et al.  Clustering Spatial Data with Obstacles Constraints by PSO , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[10]  Jian-hua Liu,et al.  A Spatial Clustering Method by Means of Field Model to Organize Data , 2010, 2010 Second WRI Global Congress on Intelligent Systems.

[11]  Walid G. Aref,et al.  Spatial Data Models and Query Processing , 1995, Modern Database Systems.

[12]  Chi-Hoon Lee,et al.  Clustering spatial data in the presence of obstacles: a density-based approach , 2002, Proceedings International Database Engineering and Applications Symposium.

[13]  Dimitrios Gunopulos,et al.  Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.

[14]  Yanchun Zhang,et al.  Multilevel data clustering for spatial join processing , 1999, Proceedings 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE'99) (Cat. No.PR00496).

[15]  Jong-Sheng Cherng,et al.  A hypergraph based clustering algorithm for spatial data sets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.