Spatial Co-location Pattern Mining Using Delaunay Triangulation

Spatial data mining is the process of finding interesting patterns that may implicitly exist in spatial database. The process of finding the subsets of features that are frequently found together in a same location is called co-location pattern discovery. Earlier methods to find co-location patterns focuses on converting neighbourhood relations to item sets. Once item sets are obtained then can apply any method for finding patterns. The criteria to know the strength of co-location patterns is participation ratio and participation index. In this paper, Delaunay triangulation approach is proposed for mining co-location patterns. Delaunay triangulation represents the closest neighbourhood structure of the features exactly which is a major concern in finding the co-location patterns. The results show that this approach achieves good performance when compared to earlier methodologies.