Discovering colocation patterns from spatial data sets: A general approach

doi:10.1109/TKDE.2004.90

Return

Discovering colocation patterns from spatial data sets: A general approach

2004-12-01

405

黄

黄岩 (Yan Huang)

Shashi Shekhar

Hui Xiong (Hui Xiong)

DOI：10.1109/TKDE.2004.90

Original

Save

View PDF

Abstract

En 中文

Given a collection of Boolean spatial features, the colocation pattern discovery process finds the subsets of features frequently located together. For example, the analysis of an ecology data set may reveal symbiotic species. The spatial colocation rule problem is different from the association rule problem since there is no natural notion of transactions in spatial data sets which are embedded in continuous geographic space. In this paper, we provide a transaction-free approach to mine colocation patterns by using the concept of proximity neighborhood. A new interest measure, a participation index, is also proposed for spatial colocation patterns. The participation index is used as the measure of prevalence of a colocation for two reasons. First, this measure is closely related to the cross-K function, which is often used as a statistical measure of interaction among pairs of spatial features. Second, it also possesses an antimonotone property which can be exploited for computational efficiency. Furthermore, we design an algorithm to discover colocation patterns. This algorithm includes a novel multiresolution pruning technique. Finally, experimental results are provided to show the strength of the algorithm and design decisions related to performance tuning.

Keywords:

colocation patterns

spatial association rules

participation index

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.