Optimizing and accelerating space-time Ripley's K function based on Apache Spark for distributed spatiotemporal point pattern analysis
Yuan Wang, Zhipeng Gui, Huayi Wu, Dehua Peng, Jinghang Wu, Zousen Cui

TL;DR
This paper introduces a distributed computing approach using Apache Spark to efficiently compute the space-time Ripley's K function for large spatiotemporal datasets, addressing previous scalability and computational challenges.
Contribution
It extends the optimization of Ripley's K function from space to space-time dimensions and proposes four strategies to enhance computational efficiency in a distributed environment.
Findings
Significant reduction in computation time demonstrated
Feasibility confirmed through experimental validation
Potential applications across multiple scientific fields
Abstract
With increasing point of interest (POI) datasets available with fine-grained spatial and temporal attributes, space-time Ripley's K function has been regarded as a powerful approach to analyze spatiotemporal point process. However, space-time Ripley's K function is computationally intensive for point-wise distance comparisons, edge correction and simulations for significance testing. Parallel computing technologies like OpenMP, MPI and CUDA have been leveraged to accelerate the K function, and related experiments have demonstrated the substantial acceleration. Nevertheless, previous works have not extended optimization of Ripley's K function from space dimension to space-time dimension. Without sophisticated spatiotemporal query and partitioning mechanisms, extra computational overhead can be problematic. Meanwhile, these researches were limited by the restricted scalability and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
