Mining Spatial Data via Clustering

Contributions from researchers in Knowledge Discovery are producing essential tools in order to better understand the typically large amounts of spatial data in Geographical Information Systems. Clustering techniques are proving to be valuable in providing exploratory analysis functionality while supporting approaches for automated pattern discovery in spatially referenced data and for the iden-tiication of important spatial relationships. However, there is little recognition of the broader context for which many clustering approaches are related. The concern for eecient ltering of outliers has divested attention from the actual problem being solved, which has resulted in a lack of recognition for the variety of approaches that could be modeled and in the re-discovery of solution approaches that are problematic or inferior. We present an overview of non-hierarchical clustering approaches for spatial data analysis. Our panoramic view to clustering large spatio-referenced datasets suggests that more eeective and eecient clustering methods are possible.

[1]  Alan T. Murray,et al.  Cluster Discovery Techniques for Exploratory Spatial Data Analysis , 1998, Int. J. Geogr. Inf. Sci..

[2]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[3]  D. Fogel,et al.  Discovering patterns in spatial data using evolutionary programming , 1996 .

[4]  Richard L. Church,et al.  Applying simulated annealing to location-planning models , 1996, J. Heuristics.

[5]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[6]  Richard L. Church,et al.  Heuristic solution approaches to operational forest planning problems , 1995 .

[7]  Hans-Peter Kriegel,et al.  The Impact of Global Clustering on Spatial Database Systems , 1994, VLDB.

[8]  J. Besag,et al.  Spatial Statistics and Bayesian Computation , 1993 .

[9]  Shokri Z. Selim,et al.  A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..

[10]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[11]  K E Rosing,et al.  Optimal Clustering , 1986 .

[12]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[14]  Robert E. Jensen,et al.  A Dynamic Programming Algorithm for Cluster Analysis , 1969, Oper. Res..

[15]  Stan Openshaw,et al.  Two exploratory space-time-attribute pattern analysers relevant to GIS , 1994 .

[16]  R. Ng,et al.  Eecient and Eeective Clustering Methods for Spatial Data Mining , 1994 .

[17]  Jiawei Han,et al.  Attribute-Oriented Induction in Relational Databases , 1991, Knowledge Discovery in Databases.

[18]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[19]  J. Mcqueen Some methods for classi cation and analysis of multivariate observations , 1967 .

[20]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .