Mining condensed spatial co-location patterns

Abstract

The discovery of co-location patterns among spatial events is an important task in spatial data mining. We introduce a new kind of spatial co-location patterns, named condensed spatial co-location patterns, that can be considered as a lossy compressed representation of all the co-location patterns. Each condensed pattern is the representative, and a superset, of a group of spatial co-location patterns in the full set of patterns such that the difference between the interestingness measure of the representative and the measures of the patterns belonging to the associated group are negligible. Our preliminary experiments show that condensed spatial co-location patterns are less sensitive to parameter changes and more robust in presence of missing data than closed spatial co-location patterns.