Improved Algorithm of Complex Spatial Co-Location Pattern Based on Grid Clique

Abstract

In this paper, an algorithm is presented, which takes grid clique as a whole to find its all instance points neighbor lists in 9-neighbor area, and inserts them into the candidate extension clique list, then deletes the records that dont meet the criteria in the list, finally combines grid cliques and candidate extension clique list to generate maximal clique. The paper discusses the characteristics of spatial co-location pattern algorithm, and makes statistics of its maximal clique number generated in different distance threshold. The experiment shows that the improved algorithm can find out more maximal cliques.