Complex spatial relationships (2003) [6 citations — 0 self]
Download:
|
|
by Robert Munro, Sanjay Chawla, Pei Sun
In Proc. of the 3rd IEEE International Conference on Data Mining (ICDM
http://www.it.usyd.edu.au/~rmunro/research/munro03complex.ps
Add To MetaCart
Abstract:
This paper describes the need for mining complex relationships in spatial data. Complex relationships are defined as those involving two or more of: multi-feature colocation, self-colocation, one-to-many relationships, self-exclusion and multi-feature exclusion. We demonstrate that even in the mining of simple relationships, knowledge of complex relationships is necessary to accurately calculate the significance of results. We implement a representation of spatial data such that it contains known `weak-monotonic ' properties, which are exploited for the efficient mining of complex relationships, and discuss the strengths and limitations of this representation. 1.
Citations
| 1734 | Fast algorithms for mining association rules – Agrawal, Srikant - 1994 |
| 601 | Mining frequent patterns without candidate generation – Han, Pei, et al. - 2000 |
| 126 | Discovery of spatial association rules in geographic information databases – Koperski, Han - 1995 |
| 112 | Discovery, analysis, and presentation of strong rules – Piatetsky-Shapiro - 1991 |
| 68 | Spatial Databases: A Tour – Shekhar, Chawla - 2003 |
| 65 | Interactive spatial data analysis – Bailey, Gatrell - 1995 |
| 30 | Discovering spatial co-location patterns: A summary of results – Shekhar, Huang - 2001 |
| 24 | Mining Both Positive and Negative Association Rules – Wu, Zhang, et al. - 2002 |
| 20 | Representations of space and time – Peuquet - 2002 |
| 13 | Mining Confident Co-location Rules without A Support Threshold – Huang, Xiong, et al. - 2003 |
| 8 | Mining optimized gain rules for numeric attributes – Brin, Rastogi, et al. - 2003 |
