Discover Co-location Patterns Research Articles

RCPM_CFI: A regional core pattern mining method based on core feature influence

Regional co-location pattern mining is a branch of spatial co-location pattern mining, which is used to discover co-location patterns that prevalently co-occur in local regions. The regional co-location patterns can reveal the association relationships among spatial features in the local regions. However, in practice, the association relationship between certain features is asymmetrical, and some features play a key (core) role in the relationship, as central position. To explore the regional co-location patterns with core feature (called regional core patterns (RCPs)) as well as their prevalent regions, this paper presents a regional partition method based on the influence of core feature. Additionally, a regional core pattern mining (RCPM) algorithm is proposed to mine the RCPs and unveil their spatial distribution resulting from the arrangement of core feature. In the regional partition stage, we propose a partition criterion that takes into account the influence of core feature. This criterion aims to comprehensively address the spatial distribution relationship between core instances and their neighboring non-core instances, ensuring the partition process is rational and complete. In the RCPM stage, we propose a core-based nearest affiliation measure method to assess the neighbor relationship between core and non-core instances, which can consider the fact that there is competition between spatial instances of the same spatial feature. And, to effectively calculate pattern prevalence and quickly identify RCPs, we present a data structure called Core_Hash to store the influence relationship between core and non-core instances. Extensive experimental evaluations and analyses are conducted on synthetic and real-world datasets. Compared to the existing algorithms, our proposed algorithms yield more reasonable and comprehensive RCPs and demonstrate good efficiency and scalability.

Maximal Instance Algorithm for Fast Mining of Spatial Co-Location Patterns

The explosive growth of spatial data and the widespread use of spatial databases emphasize the need for spatial data mining. The subsets of features frequently located together in a geographic space are called spatial co-location patterns. It is difficult to discover co-location patterns because of the huge amount of data brought by the instances of spatial features. A large fraction of the computation time is devoted to generating row instances and candidate co-location patterns. This paper makes three main contributions for mining co-location patterns. First, the definition of maximal instances is given and a row instance (RI)-tree is constructed to find maximal instances from a spatial data set. Second, a fast method for generating all row instances and candidate co-locations is proposed and the feasibility of this method is proved. Third, a maximal instance algorithm with no join operations for mining co-location patterns is proposed. Finally, experimental evaluations using synthetic data sets and a real data set show that maximal instance algorithm is feasible and has better performance.

Computing Co-Location Patterns in Spatial Data with Extended Objects: A Scalable Buffer-Based Approach

Spatial co-location patterns are subsets of spatial features usually located together in geographic space. Recent literature has provided different approaches to discover co-location patterns over point spatial data. However, most approaches consider the neighborhood relationship among spatial objects as binary and are mainly designed for point spatial features, thus are not appropriate for extended spatial features such as line strings and polygons, the neighborhood relationship among which is naturally continuous. This paper adopts a buffer-based model for measuring the spatial relationship of extended objects and mining co-location patterns. While the buffer-based model has several advantages for extended spatial features, it involves high computational complexity due to the expensive buffer-level overlay operation. To tackle this challenge, we introduce a coarse-level co-location mining framework, which follows a filter-and-refine paradigm. Within the framework, we develop a serious of rigorous upper bounds based on geometric property and progressively prune search space with these upper bounds. Moreover, we develop a join-less schema to further reduce computation cost of size-k( $k>2$ k > 2 ) co-location patterns. Finally, we conduct experiments with large-scale spatial data to validate the efficiency of the developed algorithms against several state-of-art methods. All experimental results demonstrate the superiority of our methods.

A Visualization Method for Mining Colocation Patterns Constrained by a Road Network

Colocation mining is useful for understanding the interactions or dependencies that occur among geographic phenomena. Most colocation mining methods are based on planar space. However, in urban spaces, many human-related activities are constrained by a road network. Planar colocation mining methods are not suitable for studying the concerning geographic phenomena in an urban space. In this paper, we propose a visualization method to discover colocation patterns constrained by a road network. The method consists of two major components: network kernel density estimation and network colocation rule map construction. In the colocation rule map construction component, spatial interactions among spatial network geographic phenomena are modeled based on the idea of color mixing. We use simulated datasets with different spatial patterns, different sample sizes, and different maximum distances between road network events to test our method. The results show that our method is effective for mining colocation patterns in different situations. We also change the resolution of the network colocation rule maps, and the results show that the resolution has little influence on the results. In the case study, we apply our method to explore the spatial association between crimes and city facilities in the Loop and the Near North Side districts of Chicago.

A visualization approach for discovering colocation patterns

ABSTRACTColocation mining is one of the major spatial data mining tasks. When discovering colocation patterns, spatial statistics or data mining approaches are commonly used. Colocation mining results are typically presented in a textual form and do not provide any spatial information; thus, the results lack an intuitive approach to obtain cognition of colocation rules. Here, we propose a visualization approach to discover colocation patterns for two independent point distributions and generate visual results. This approach makes use of the ability of human color perception. For two geographic features, our approach first generates density surfaces of the input features and then visualizes the density surfaces using a red or green light with different intensities. Then, based on the law of additive color mixing, our approach mixes the colors of the two density surfaces to generate a colocation rule map. The visualization approach can also provide local details of colocation and be used for local colocation analysis. Users can detect colocation patterns and their distribution from the colocation rule maps. We use both synthetic data and real data to test the performance of our approach.

MINING CO-LOCATION PATTERNS FROM SPATIAL DATA

Due to the widespread application of geographic information systems (GIS) and GPS technology and the increasingly mature infrastructure for data collection, sharing, and integration, more and more research domains have gained access to high-quality geographic data and created new ways to incorporate spatial information and analysis in various studies. There is an urgent need for effective and efficient methods to extract unknown and unexpected information, e.g., co-location patterns, from spatial datasets of high dimensionality and complexity. A co-location pattern is defined as a subset of spatial items whose instances are often located together in spatial proximity. Current co-location mining algorithms are unable to quantify the spatial proximity of a co-location pattern. We propose a co-location pattern miner aiming to discover co-location patterns in a multidimensional spatial data by measuring the cohesion of a pattern. We present a model to measure the cohesion in an attempt to improve the efficiency of existing methods. The usefulness of our method is demonstrated by applying them on the publicly available spatial data of the city of Antwerp in Belgium. The experimental results show that our method is more efficient than existing methods.

MINING CO-LOCATION PATTERNS FROM SPATIAL DATA

Abstract. Due to the widespread application of geographic information systems (GIS) and GPS technology and the increasingly mature infrastructure for data collection, sharing, and integration, more and more research domains have gained access to high-quality geographic data and created new ways to incorporate spatial information and analysis in various studies. There is an urgent need for effective and efficient methods to extract unknown and unexpected information, e.g., co-location patterns, from spatial datasets of high dimensionality and complexity. A co-location pattern is defined as a subset of spatial items whose instances are often located together in spatial proximity. Current co-location mining algorithms are unable to quantify the spatial proximity of a co-location pattern. We propose a co-location pattern miner aiming to discover co-location patterns in a multidimensional spatial data by measuring the cohesion of a pattern. We present a model to measure the cohesion in an attempt to improve the efficiency of existing methods. The usefulness of our method is demonstrated by applying them on the publicly available spatial data of the city of Antwerp in Belgium. The experimental results show that our method is more efficient than existing methods.

Discovering Co-location Patterns from Spatial Domain using a Delaunay Approach

Spatial co-location patterns represent the subsets of boolean spatial features whose instances are often located in close geographic proximity. Spatial statistics and data mining approaches are used to identify co-location patterns from spatial data sets. Spatial proximity is the important concept to determine the co-location patterns from massive data sets. A Delaunay diagram based co-location mining approach is developed to mine co-location patterns from spatial data by using the concept of spatial proximity. Delaunay diagram is used to model the spatial proximity between the objects. This approach eliminates the parameters from the user to define neighborhood of objects and avoids multiple test and trail repetitions in the process of mining. An algorithm to discover co-location patterns are designed which generates candidate locations and their table instances. Finally the co-location rules are generated to identify the patterns. The results of the experiments have been discussed

Event Centric Modeling Approach in Colocation Pattern Analysis From Spatial Data

Spatial co-location patterns are the subsets of Boolean spatial features whose instances are often located in close geographic proximity. Co-location rules can be identified by spatial statistics or data mining approaches. In data mining method, Association rule-based approaches can be used which are further divided into transaction-based approaches and distance-based approaches. Transaction-based approaches focus on defining transactions over space so that an Apriori algorithm can be used. The natural notion of transactions is absent in spatial data sets which are embedded in continuous geographic space. A new distance -based approach is developed to mine co-location patterns from spatial data by using the concept of proximity neighborhood. A new interest measure, a participation index, is used for spatial co-location patterns as it possesses an anti-monotone property. An algorithm to discover co-location patterns are designed which generates candidate locations and their table instances. Finally the co-location rules are generated to identify the patterns.

Discovering colocation patterns from spatial data sets: a general approach

Given a collection of Boolean spatial features, the colocation pattern discovery process finds the subsets of features frequently located together. For example, the analysis of an ecology data set may reveal symbiotic species. The spatial colocation rule problem is different from the association rule problem since there is no natural notion of transactions in spatial data sets which are embedded in continuous geographic space. We provide a transaction-free approach to mine colocation patterns by using the concept of proximity neighborhood. A new interest measure, a participation index, is also proposed for spatial colocation patterns. The participation index is used as the measure of prevalence of a colocation for two reasons. First, this measure is closely related to the cross-K function, which is often used as a statistical measure of interaction among pairs of spatial features. Second, it also possesses an antimonotone property which can be exploited for computational efficiency. Furthermore, we design an algorithm to discover colocation patterns. This algorithm includes a novel multiresolution pruning technique. Finally, experimental results are provided to show the strength of the algorithm and design decisions related to performance tuning.