Resumen
A co-location pattern is a set of spatial features whose instances are frequently correlated to each other in space. Its mining models always consist of two essential steps. One step is to generate neighbor relationships between spatial instances, and another step is to check the prevalence of candidate patterns on the clique, star or Delaunay triangulation relationships. At least three major issues are addressed in this paper. First, since different spatial regions, different distribution densities, it is difficult to set appropriate parameters to generate ideal neighbor relationships. Second, the clique relationship and the others are so strongly rigid that the users? personal interests are suppressed; some interesting patterns are neglected without increasing redundancy. Third, the different strength of correlations among instances are neglected in prevalence calculation. It causes correlations among features to be undifferentiated. Accordingly, the main work of this paper includes: (1) The neighbor relationship generation can be improved on the idea that the distances between an instance and any of its neighbors are not remarkably different. (2) The type-??
ß
co-location pattern is defined and checked based on a co-occurrence where the closeness centrality of each instance is not less than a given threshold ??
ß
. (3) Since the closeness centrality carries strength of correlations among instances, the strength of the correlations between a feature and the other ones in a type-??
ß
co-location pattern can be evaluated with prevalence calculation. Finally, experiments on synthetic and real-world spatial data sets are used to assess the effectiveness and efficiency of our works. The results show that fewer spatial neighbor relationships are generated, and more interesting patterns can be discovered by flexibly adjusting ??
ß
according to the user?s preferences.