Abstract
Spatial clustering provides answers for “where?” and “when?” and evokes “why?” for further explorations. In this paper, we propose a divisive multi-level clustering method that requires O(n log n) time. It reveals a cluster hierarchy for the “where?” and “when?” queries. Experimental results demonstrate that it identifies quality multi-level clusters. In addition, we present a solid framework for reasoning about multi-level clusters using Region Connection Calculus for the “why?” query. In this framework, we can derive their possible causes and positive associations between them with ease.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Anselin. What is Special About Spatial Data? Alternative Perspectives on Spatial Data Analysis. TR 89-4, NCGIA, University of California, 1989.
T. C. Bailey and A. C. Gatrell. Interactive Spatial Analysis. 1995.
A. G. Cohn, B. Bennett, J. Gooday, and N. M. Gotts. Qualitative Spatial Representation and Reasoning with the Region Connection Calculus. GeoInformatica, 1(3):275–316, 1997.
A. G. Cohn and N. M. Gotts. Representing Spatial Vagueness: A Mereological Approach. In Proc. of the 5th Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 230–241, Massachusetts, 1996. Morgan Kaufmann.
P. J. Diggle. Statistical Analysis of Spatial Point Patterns. 1983.
H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. On the Shape of a Set of Points in the Plane. IEEE Transactions on Information Theory, 29(4):551–559, 1983.
M. Ester, H. P. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. of the 2nd Int. Conf. on KDDM, pages 226–231, Portland, Oregon, 1996. AAAI Press.
V. Estivill-Castro and I. Lee. Argument Free Clustering via Boundary Extraction for Massive Point-data Sets. Computers, Environments and Urban Systems, 26(4):315–334, 2002.
P. Gärdenfors, and M-A. Williams. Reasoning about Categories in Conceptual Spaces. In Proc. of the IJCAI, pages 385–392, Seattle, Washington, 1998. Morgan Kaufmann.
S. Guha, R. Rastogi, and K. Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proc. of the ACM SIGMOD’98, pages 73–84, Seattle, Washington, 1998. ACM Press.
E. M. Knorr, R. T. Ng, and D. L. Shilvock. Finding Boundary Shape Matching Relationships in Spatial Data. In Proc. of the 5th Int. Symposium on Spatial Databases, LNCS 1262, pages 29–46, Berlin, Germany, 1997. Springer.
K. Koperski. A Progressive Refinement Approach to Spatial Data Mining. PhD thesis, Computing Science, Simon Fraser University, B.C., Canada, 1999.
I. Lee and V. Estivill-Castro. Polygonization of Point Clusters through Cluster Boundary Extraction for Geographical Data Mining. In Proc of the 10th Int Symposium on Spatial Data Handling, pages 27–40, Ottawa, Canada, 2002. Springer.
I. L. McHarg. Design with Nature. Natural History Press, New York, 1969.
H. J. Miller and J. Han. Geographic Data Mining and Knowledge Discovery: An Overview. Cambridge University Press, Cambridge, UK, 2001.
F. Murtagh. Comments on Parallel Algorithms for Hierarchical Clustering and Cluster Validity. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(10):1056–1057, 1992.
W. Wang, J. Yang, and R. R. Muntz. STING: A Statistical Information Grid Approach to Spatial Data Mining. In Proc. of the 23rd Int. Conf. on Very Large Data Bases, pages 186–195, Athens, Greece, 1997. Morgan Kaufmann.
T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proc. of the ACM SIGMOD’96, pages 103–114, Montreal, Canada, 1996. ACM Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, I., Williams, MA. (2003). Multi-level Clustering and Reasoning about Its Clusters Using Region Connection Calculus. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-36175-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04760-5
Online ISBN: 978-3-540-36175-6
eBook Packages: Springer Book Archive