Name
Title | ||
|---|---|---|
Parallel Co-location Pattern Mining based on Neighbor-Dependency Partition and Column Calculation |
Abstract | ||
|---|---|---|
ABSTRACTA co-location pattern is a subset of spatial features whose instances are frequently located together in proximate areas. Mining co-location patterns can discover spatial dependencies in spatial datasets and have particular value in many applications. However, it is challengeable to discover co-location patterns from massive spatial datasets, due to the expensive computational cost. In this paper, we present a novel parallel co-location pattern mining approach. First, dividing spatial neighbor relationships into some neighbor-dependency partitions enables to perform mining task on each partition independently in parallel. Then, a column-based calculation approach is proposed to replace the time-consuming generation of table instances for calculating the prevalence of patterns. To further reduce the search space of patterns on each partition, two pruning strategies are suggested. We implement the parallel co-location pattern mining algorithm based on neighbor-dependency partition and column calculation via MapReduce, named PCPM-NDPCC. Substantial experiments are conducted on real and synthetic datasets to examine the performance of PCPM-NDPCC. Experimental results reveal that PCPM-NDPCC has a significant improvement in efficiency than baseline algorithms and shows better scalability for massive spatial data processing. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3474717.3483984 | Geographic Information Systems |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peizhong Yang | 1 | 22 | 6.85 |
| Lizhen Wang | 2 | 153 | 26.16 |
| Xiaoxuan Wang | 3 | 17 | 7.52 |
| Lihua Zhou | 4 | 18 | 7.71 |
| Hongmei Chen | 5 | 25 | 5.39 |