Conference paper Open Access
Panagiotis Nikitopoulos; Aris-Iakovos Paraskevopoulos; Christos Doulkeridis; Nikos Pelekis; Yannis Theodoridis
Hot spot analysis is the problem of identifying statistically significant spatial clusters from an underlying data set. In this paper, we target the problem of hot spot analysis of massive spatio-temporal data, which raises the need for a parallel and scalable solution that operates on data distributed over a set of nodes. We propose an algorithm, called BigCAB, implemented in Spark, that solves the problem in a parallel and scalable way. Our experiments on real data representing taxi trips demonstrate both the efficiency as well as the nice scaling properties of our algorithm.
Name | Size | |
---|---|---|
BigCAB_GisCup_0.pdf
md5:5621fae4e9d45b478d89bdf6bc33d1c6 |
284.4 kB | Download |
All versions | This version | |
---|---|---|
Views | 101 | 101 |
Downloads | 86 | 86 |
Data volume | 24.5 MB | 24.5 MB |
Unique views | 96 | 96 |
Unique downloads | 82 | 82 |