Spatial co-location pattern mining aims to discover the association between spatial features and has been an important research direction in spatial data mining. Spatial co-location pattern mining method based on column calculation(CPM-Col algorithm) avoids the most time-consuming operation of generating table instances and directly searches for participating instances. This method has become one of the most efficient approaches. However, backtracking search for participating instances remains a bottleneck, especially in dense datasets and long pattern mining. To accelerate the search for participating instances, this paper proposed two improvements to the CPM-Col algorithm with less extra computations. Firstly, the row instances found by CPM-Col algorithm were stored as partial table instances, for avoiding backtracking calculations of many instances. Secondly, after successfully finding a row instance, some instances of the first feature were obtained by the sub-clique reaction of the row instance. Based on these improvements, this paper proposed a co-location pattern mining method based on improved column calculation(CPM-iCol algorithm) and discussed complexity, correctness, and completeness. Experiments were conducted on synthetic and real datasets. Comparing to a classical algorithm join-less and CPM-Col, the CPM-iCol algorithm significantly reduces mining time and backtracking times. The results show that the proposed algorithm has better performance and scalability than CPM-Col algorithm, especially in dense datasets.

[2024-01-16] Accepted Paper /doc/2023.09.0448/v1

[2024-05-05] Printed Article /doc/2023.09.0448/v2