Mining Maximal Dynamic Spatial Co-Location Patterns

12/30/2018
by   Jiangli Duan, et al.
0

A spatial co-location pattern represents a subset of spatial features whose instances are prevalently located together in a geographic space. Although many algorithms of mining spatial co-location pattern have been proposed, there are still some problems: 1) they miss some meaningful patterns (e.g., Ganoderma_lucidumnew, maple_treedead and water_hyacinthnew(increase), algaedead(decrease)), and get the wrong conclusion that the instances of two or more features increase/decrease (i.e., new/dead) in the same/approximate proportion, which has no effect on prevalent patterns. 2) Since the number of prevalent spatial co-location patterns is very large, the efficiency of existing methods is very low to mine prevalent spatial co-location patterns. Therefore, first, we propose the concept of dynamic spatial co-location pattern that can reflect the dynamic relationships among spatial features. Second, we mine small number of prevalent maximal dynamic spatial co-location patterns which can derive all prevalent dynamic spatial co-location patterns, which can improve the efficiency of obtaining all prevalent dynamic spatial co-location patterns. Third, we propose an algorithm for mining prevalent maximal dynamic spatial co-location patterns and two pruning strategies. Finally, the effectiveness and efficiency of the method proposed as well as the pruning strategies are verified by extensive experiments over real/synthetic datasets.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/26/2020

Discovering Closed and Maximal Embedded Patterns from Large Tree Data

We address the problem of summarizing embedded tree patterns extracted f...
10/21/2018

Spatial Co-location Pattern Mining - A new perspective using Graph Database

Spatial co-location pattern mining refers to the task of discovering the...
02/26/2022

TaSPM: Targeted Sequential Pattern Mining

Sequential pattern mining (SPM) is an important technique of pattern min...
04/21/2009

FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking

Maximal frequent patterns superset checking plays an important role in t...
09/01/2020

Top-k Socio-Spatial Co-engaged Location Selection for Social Users

With the advent of location-based social networks, users can tag their d...
11/12/2018

Segue: Overviewing Evolution Patterns of Egocentric Networks by Interactive Construction of Spatial Layouts

Getting the overall picture of how a large number of ego-networks evolve...
04/20/2020

Dynamic Matching Algorithms in Practice

In recent years, significant advances have been made in the design and a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.