25 March 2024 in IEEE Transactions on Knowledge and Data Engineering
The spatial co-location pattern is a collection of spatial features in which instances of features prevalently appear in neighboring spatial regions. Due to the heterogeneity of spatial data distribution, the instances of some patterns appear prevalently in the global region (i.e., Global Prevalent Co-location Patterns, GPCPs), while some patterns are not prevalent globally, and their instances are clustered only in some local regions (i.e., Local Prevalent Co-location Patterns, LPCPs). Multi-level co-location pattern mining aims to mine these two types of patterns simultaneously, but existing methods cannot accurately judge the spatial distribution of patterns in a certain region, leading to unsuitable judgment of both GPCPs and LPCPs. To overcome this problem, this paper firstly proposes the relative distribution coefficient to identify the spatial distribution form of patterns, and provides a more refined way for discovering both GPCPs and LPCPs. Secondly, a novel multi-level co-location pattern mining algorithm is proposed by using the relative distribution coefficient as the interest metrics, and some pruning strategies are suggested to improve the mining efficiency. Finally, extensive experiments are conducted on both real and synthetic datasets to verify the effectiveness and efficiency of the proposed method.
18 February 2021 in IEEE Transactions on Knowledge and Data Engineering
Spatial co-location pattern mining (SCPM) aims to discover subsets of spatial features frequently located together in proximate areas. Previous studies of SCPM solely concern the inter-features association of a pattern, but neglect the interesting intra-feature behavior. In this paper, we propose the task of spatial co-location pattern mining with coupling relation consideration (SCPM-CR) to capture complex relations embedded in a co-location. Specifically, InterPCI measure is designed to capture the inter-features coupling by considering the comprehensive interaction of objects for the features in a pattern, and luckily it possesses the anti-monotone property. Another measure, IntraCAI, is proposed to capture the congregating behavior of intra-feature objects under the restriction of a co-location. A general framework is designed for SCPM-CR task and experiments show that a large fraction of computation time is devoted to identifying the participating objects of a candidate pattern. To tackle this calculation bottleneck, a novel candidate-and-search algorithm is suggested, CS-HBS, equipped with heuristic backtracking search. Extensive experiments are conducted on real and synthetic datasets to demonstrate the superiority of SCPM-CR compared with traditional SCPM methods, and also to validate the efficiency and scalability of CS-HBS. Experimental results show that CS-HBS outperforms the baselines by several times or even orders of magnitude.
19 April 2021 in IEEE Transactions on Fuzzy Systems
Spatial colocation patterns are subsets of spatial feature sets that are frequently “neighboring” in space. In the majority of existing mining methods, neighboring is determined by a single distance threshold and does not take the neighboring degree into consideration causing many neighbor relationships to be lost and they also cannot objectively describe the correlation between spatial features. In addition, existing methods ignore the instance-sharing problem of spatial neighbor relationships when calculating the prevalence of colocation patterns. In order to overcome these weaknesses, this article introduces the fuzzy theory into the spatial colocation pattern discovery. Through the fuzziness of spatial neighbor relationships between spatial instances, we develop a reasonable fuzzy proximity metric, which takes the instance-sharing problem into account and which measures the similarity between different spatial features. Three effective fuzzy clustering methods are proposed, which ensure that colocation patterns can be extracted accurately and quickly. Finally, extensive experiments on five synthetic datasets and five real-world datasets prove the practicability and efficiency of the proposed methods.
2 December 2019 in Distributed and Parallel Databases
27 March 2021 in Knowledge and Information Systems
20 November 2023 in Information Sciences