Mining qualitative patterns in spatial cluster analysis

Clustering is an important concept formation process within AI. It detects a set of objects with similar characteristics. These similar aggregated objects represent interesting concepts and categories. As clustering becomes more mature, post-clustering activities that reason about clusters need a great attention. Numerical quantitative information about clusters is not as intuitive as qualitative one for human analysis, and there is a great demand for an intelligent qualitative cluster reasoning technique in data-rich environments. This article introduces a qualitative cluster reasoning framework that reasons about clusters. Experimental results demonstrate that our proposed qualitative cluster reasoning reveals interesting cluster structures and rich cluster relations.

[1]  Antony Galton,et al.  Efficient generation of simple polygons for characterizing the shape of a set of points in the plane , 2008, Pattern Recognit..

[2]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[3]  Michael F. Worboys,et al.  GIS : a computing perspective , 2004 .

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

[5]  Anthony G. Cohn,et al.  Qualitative Spatial Representation and Reasoning with the Region Connection Calculus , 1997, GeoInformatica.

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

[7]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[8]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[9]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

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

[11]  Jiawei Han,et al.  Spatial clustering methods in data mining , 2001 .

[12]  Vladimir Estivill-Castro,et al.  Discovering Associations in Spatial Data - An Efficient Medoid Based Approach , 1998, PAKDD.

[13]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[14]  Hans-Peter Kriegel,et al.  Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications , 1998, Data Mining and Knowledge Discovery.

[15]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[16]  V. Estivill-Castro,et al.  Argument free clustering for large spatial point-data sets via boundary extraction from Delaunay Diagram , 2002 .

[17]  Ickjai Lee,et al.  Fast Cluster Polygonization and its Applications in Data-Rich Environments , 2006, GeoInformatica.

[18]  Ickjai Lee,et al.  Argument free clustering via boundary extraction for massive point-data Sets , 2002 .

[19]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[20]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .