Abstract
The paper focuses on finding spatial association rules. A new approach to mining spatial association rules is proposed. The neighborhood is defined in terms of the Delaunay diagrams, instead of predefining distance thresholds with extra runs. Once a Delaunay diagram is created, it is used for determining neighborhoods, and then, based on this knowledge it continues with finding association rules.
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.
Similar content being viewed by others
References
1. Agrawal R., Srikant R. (1994) Fast Algorithms for Mining Association Rules in Large Databases. Int'l Conf. On VLDB; Santiago, Chile
2. Bembenik R., Protaziuk G. Mining spatial association rules. Proceedings of the IIS:IIP WM'04, Zakopane, Poland, Springer
3. de Bert, M., Schwarzkopf, O., von Kreveld, M., Overmars, M. (2000) Computational geometry: algorithms and applications. Springer Verlag
4. Estivill-Castro, V., Lee, I. (2000) AUTOCLUST: automatic clustering via boundary extraction for mining massive point-data sets. Proceedings of the 5th International Conference on Geocomputation
5. Huang Y., Shekhar S., Xiong H. (2002) Discovering Co-location Patterns from Spatial Datasets: A General Approach. Technical Report, TR 02-033, Computer Science & Engineering, University of Minnesota — Twin Cities
6. Koperski K., Han J. Discovery of spatial association rules in geographic information databases. Proceedings of 4th International Symposium on Large Spatial Databases, August 1995
7. Koperski K., Han J., Adhikary J. (1997) Mining knowledge in geographical data. Comm. of ACM
8. Morimoto Y. (2001) Mining Frequent Neighboring Class Sets In Spatial Databases. KDD'01, San Francisco, USA
9. Mitchell J. (2005) Notes on Voronoi and Delaunay diagrams, Course materials. State University of New York at Stony Brook
10. Shekhar S., Huang Y. Discovering Spatial Co-Location Patterns: A summary of results. Proceedings of SSTD, Redondo Beach, USA, 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Bembenik, R., Rybiński, H. (2006). Mining Spatial Association Rules with No Distance Parameter. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33521-8_54
Download citation
DOI: https://doi.org/10.1007/3-540-33521-8_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33520-7
Online ISBN: 978-3-540-33521-4
eBook Packages: EngineeringEngineering (R0)