Mining Co-locations under Uncertainty

Abstract

A co-location pattern represents a subset of spatial features whose events tend to locate together in spatial proximity. The certain case of the co-location pattern has been investigated. However, location information of spatial features is often imprecise, aggregated, or error prone. Because of the continuity nature of space, over-counting is a major problem. In the uncertain case, the problem becomes more challenging. In this paper, we propose a probabilistic participation index to measure co-location patterns based on the well-known possible world model. To avoid the exponential cost of calculating participation index from all possible worlds, we prove a lemma that allows for instance centric counting, avoids over-counting, and produces the same results as using possible world based counting. We use this property to develop efficient mining algorithms. We observed through both algebraic analysis and extensive experiments that the feature tree based algorithm outperforms uncertain Apriori algorithm by an order of magnitude not only for co-locations of large sizes but also for datasets with high level of uncertainty. This is an important insight in mining uncertainty co-locations.