Task In Spatial Data Mining Research Articles

Graph based embedding learning of trajectory data for transportation mode recognition by fusing sequence and dependency relations

As an important task in spatial data mining, trajectory transportation mode recognition can reflect various individual behaviors and traveling patterns in urban space. As trajectory is essentially a sequence, many scholars use the sequence inference models to mine the information in trajectory data. However, such methods often ignored the spatial correlation between trajectory points and implemented the evaluation based only on representative feature statistics selected in the trajectory data preprocessing stage, thus have difficulties in acquiring high-order traveling pattern features. In this study, we propose a novel ensemble recognition method for representing trajectory data with the graph structure based on sequence and dependency relations. This method integrates the sequence of trajectory points and the correlation between characteristic points of a travel path into a fused graph convolutional network to obtain semantic feature information at multiple levels. We validate our proposed method with experiments on the trajectory benchmark dataset from the Microsoft GeoLife project. The results demonstrated that our proposed graph network outperforms other baseline methods in the transportation mode recognition task of trajectories. This method can help to discover the movement patterns of urban residents, and further provide effective assistance for the management of cities.

New approaches to processing GIS Data using Artificial Neural Networks models

Spatial data mining is a special type of data mining. The main difference between data mining and spatial data mining is that in spatial data mining tasks we use not only non-spatial attributes but also spatial attributes. Spatial data mining techniques have strong relationship with GIS (Geographical Information System) and are widely used in GIS for inferring association among spatial attributes, clustering and classifying information with respect to spatial attributes. In this paper we use the statistical package Weka on two models, which consist of two parcels plans from the Olt area of Romania. In our experimentation, we compare the results of the vector models depending on the values of the training datasets. Using these models with GIS data from the domain of Cadaster we analyze the performance of the Artificial Neural Networks in context of spatial data mining.

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.

Towards Big GeoData Mining and Processing

The proliferation of advanced technologies and the rapid adoption of connected devices and mobiles were behind the tremendous growth of geographic data introducing the concept of Big GeoData. The extraction of useful patterns is an interesting process, but the specific features and the complexity of relationships among spatial objects outpace the capacities of current systems. The unique way to tackle challenges raised by Big GeoData is to develop new platforms and systems. To discuss this topic, this article starts with an introduction of Big GeoData and spatial data mining tasks, followed by a reviewing of works made on Big GeoData analytics as well as their issues. Finally, authors propose their approach to develop a tool allowing the analysis of Big GeoData. This tool will encompass a wide range of algorithms and techniques to carry out most of the data mining tasks.

Redundancy Reduction for Prevalent Co-Location Patterns

Spatial co-location pattern mining is an interesting and important task in spatial data mining which discovers the subsets of spatial features frequently observed together in nearby geographic space. However, the traditional framework of mining prevalent co-location patterns produces numerous redundant co-location patterns, which makes it hard for users to understand or apply. To address this issue, in this paper, we study the problem of reducing redundancy in a collection of prevalent co-location patterns by utilizing the spatial distribution information of co-location instances. We first introduce the concept of semantic distance between a co-location pattern and its super-patterns, and then define redundant co-locations by introducing the concept of δ-covered , where $\delta \,(0\leq \delta \leq 1)$ is a coverage measure. We develop two algorithms RRclosed and RRnull to perform the redundancy reduction for prevalent co-location patterns. The former adopts the post-mining framework that is commonly used by existing redundancy reduction techniques, while the latter employs the mine-and-reduce framework that pushes redundancy reduction into the co-location mining process. Our performance studies on the synthetic and real-world data sets demonstrate that our method effectively reduces the size of the original collection of closed co-location patterns by about 50 percent. Furthermore, the RRnull method runs much faster than the related closed co-location pattern mining algorithm.

Detecting nominal variables’ spatial associations using conditional probabilities of neighboring surface objects’ categories

How to automatically mining the spatial association patterns in spatial data is a challenging task in spatial data mining. In this paper, we propose three indices that represent the per-class, inter-class, and overall spatial associations of a nominal variable, which are based on the conditional probabilities of surface object categories. These indices represent relative quantities and are normalized to the region [−1,1], which more accord with the intuitive cognition of people. We present some algorithms for detecting spatial associations that are based on these indices. The proposed method can be regarded as an extension of join count statistics and Transiogram. Several constructive examples were used to illustrate the advantages of the new method. Using two real data sets, vegetation types in Qingxian, Shanxi, China and neural tube birth defects in Heshun, Shanxi, China, we ran comparative experiments with other commonly used methods, including join count statistics, co-location quotient, and Q(m) statistics. The experimental results show that the proposed method can detect more subtle spatial associations, and is not sensitive to the sequence of neighbors.

ARTMAP neural networks for information fusion and data mining: map production and target recognition methodologies

The Sensor Exploitation Group of MIT Lincoln Laboratory incorporated an early version of the ARTMAP neural network as the recognition engine of a hierarchical system for fusion and data mining of registered geospatial images. The Lincoln Lab system has been successfully fielded, but is limited to target/ non-target identifications and does not produce whole maps. Procedures defined here extend these capabilities by means of a mapping method that learns to identify and distribute arbitrarily many target classes. This new spatial data mining system is designed particularly to cope with the highly skewed class distributions of typical mapping problems. Specification of canonical algorithms and a benchmark testbed has enabled the evaluation of candidate recognition networks as well as pre- and post-processing and feature selection options. The resulting mapping methodology sets a standard for a variety of spatial data mining tasks. In particular, training pixels are drawn from a region that is spatially distinct from the mapped region, which could feature an output class mix that is substantially different from that of the training set. The system recognition component, default ARTMAP, with its fully specified set of canonical parameter values, has become the a priori system of choice among this family of neural networks for a wide variety of applications.