Abstract
In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports “what-if” and “what-happen” analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, J., Kamber, M., Tung, K.H.: Spatial Clustering Methods in Data Mining. In: Miller, H.J., Han, J. (eds.) Geographic Data Mining and Knowledge Discovery, pp. 188–217. Cambridge University Press, Cambridge, UK (2001)
Kolatch, E.: Clustering Algorithms for Spatial Databases: A Survey (2000) Available at http://www.cs.umd.edu/~kolatch/papers/SpatialClustering.pdf
Lee, I., Estivill-Castro, V.: Fast Cluster Polygonization and Its Applications in Data-Rich Environments. GeoInformatica 10(4), 399–422 (2006)
Galton, A., Duckham, M.: What Is the Region Occupied by a Set of Points? In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 81–98. Springer, Heidelberg (2006)
Knorr, E.M., Ng, R.T., Shilvock, D.L.: Finding Boundary Shape Matching Relationships in Spatial Data. In: Scholl, M.O., Voisard, A. (eds.) SSD 1997. LNCS, vol. 1262, pp. 29–46. Springer, Heidelberg (1997)
Son, E., Kang, I., Kim, T., Li, K.: A Spatial Data Mining Method by Clustering Analysis. In: Laurini, R., Makki, K., Pissinou, N. (eds.) Proceedings of the 6th International Symposium on Advances in Geographic Information Systems, pp. 157–158. ACM Press, New York (1998)
Cohn, A.G., Bennett, B., Gooday, J., Gotts, N.M.: Qualitative Spatial Representation and Reasoning with the Region Connection Calculus. GeoInformatica 1(3), 275–316 (1997)
Lee, I., Lee, K.: Higher Order Voronoi Diagrams for Concept Boundaries and Tessellations. In: Proceedings of the 6th IEEE International Conference on Computer and Information Science, Melbourne, Australia, IEEE Computer Society, Los Alamitos (2007)
Okabe, A., Boots, B.N., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, West Sussex (2000)
Worboys, M.F.: GIS: A Computing Perspective. Taylor & Francis, London (1995)
Dent, B.D.: Cartography: Thematic Map Design, 5th edn. WCB McGraw Hill, Boston (1999)
Gärdenfors, P.: Conceptual Spaces: The Geometry of Thought. MIT Press, Cambridge (2000)
MacQueen, J.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proceedings of the 5th Berkeley Symposium on Maths and Statistics Problems. vol. 1, pp. 281–297 (1967)
Kaufman, L., Rousseuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, New York (1990)
Mitchell, T.M.: Machine Learning. WCB/McGraw-Hill, New York (1997)
Gahegan, M., Lee, I.: Data Structures and Algorithms to Support Interactive Spatial Analysis Using Dynamic Voronoi Diagrams. Environments and Urban Systems 24(6), 509–537 (2000)
Lee, I., Gahegan, M.: Interactive Analysis using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-Based Data Structure. Transactions in GIS 6(2), 89–114 (2002)
Aurenhammer, F., Schwarzkopf, O.: A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. In: Proceedings of the Symposium on Computational Geometry, North Conway, NH, pp. 142–151. ACM Press, New York (1991)
Chazelle, B., Edelsbrunner, H.: An Improved Algorithm for Constructing kth-Order Voronoi Diagrams. IEEE Transactions on Computers 36(11), 1349–1354 (1987)
Dehne, F.K.H.: On O(N 4) Algorithm to Construct all Voronoi Diagrams for K-Nearest Neighbor Searching in the Euclidean plane. In: Díaz, J. (ed.) Proceedings of the International Colloquium on Automata, Languages and Programming, Barcelona, Spain. Lecture Notes in Artificial Intelligence , vol. 154, pp. 160–172. Springer, Heidelberg (1983)
Lee, D.T.: On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Transactions on Computers 31(6), 478–487 (1982)
Berg, M., Kreveld, M., Overmars, M., Schwarzkoph, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer-Verlag, West Sussex (2002)
Estivill-Castro, V., Lee, I.: Argument Free Clustering via Boundary Extraction for Massive Point-data Sets. Computers, Environments and Urban Systems 26(4), 315–334 (2002)
Miller, H.J., Han, J.: Geographic Data Mining and Knowledge Discovery: An Overview. Cambridge University Press, Cambridge, UK (2001)
O’Rourke, J.: Computational Geometry in C. Cambridge University Press, New York (1993)
Estivill-Castro, V., Lee, I.: Clustering with Obstacles for Geographical Data Mining. ISPRS Journal of Photogrammetry and Remote Sensing 59(1-2), 21–34 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, I., Pershouse, R., Lee, K. (2007). Geospatial Cluster Tessellation Through the Complete Order-k Voronoi Diagrams. In: Winter, S., Duckham, M., Kulik, L., Kuipers, B. (eds) Spatial Information Theory. COSIT 2007. Lecture Notes in Computer Science, vol 4736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74788-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74788-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74786-4
Online ISBN: 978-3-540-74788-8
eBook Packages: Computer ScienceComputer Science (R0)