Efficient Multiple Temporal Network Kernel Density Estimation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910782044766208 |
|---|---|
| author | Shao, Yu Cheng, Peng Lian, Xiang Chen, Lei Ni, Wangze Lin, Xuemin Zhang, Chen Wang, Liping |
| author_facet | Shao, Yu Cheng, Peng Lian, Xiang Chen, Lei Ni, Wangze Lin, Xuemin Zhang, Chen Wang, Liping |
| contents | Kernel density estimation (KDE) has become a popular method for visual analysis in various fields, such as financial risk forecasting, crime clustering, and traffic monitoring. KDE can identify high-density areas from discrete datasets. However, most existing works only consider planar distance and spatial data. In this paper, we introduce a new model, called TN-KDE, that applies KDE-based techniques to road networks with temporal data. Specifically, we introduce a novel solution, Range Forest Solution (RFS), which can efficiently compute KDE values on spatiotemporal road networks. To support the insertion operation, we present a dynamic version, called Dynamic Range Forest Solution (DRFS). We also propose an optimization called Lixel Sharing (LS) to share similar KDE values between two adjacent lixels. Furthermore, our solutions support many non-polynomial kernel functions and still report exact values. Experimental results show that our solutions achieve up to 6 times faster than the state-of-the-art method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_07106 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Multiple Temporal Network Kernel Density Estimation Shao, Yu Cheng, Peng Lian, Xiang Chen, Lei Ni, Wangze Lin, Xuemin Zhang, Chen Wang, Liping Databases Kernel density estimation (KDE) has become a popular method for visual analysis in various fields, such as financial risk forecasting, crime clustering, and traffic monitoring. KDE can identify high-density areas from discrete datasets. However, most existing works only consider planar distance and spatial data. In this paper, we introduce a new model, called TN-KDE, that applies KDE-based techniques to road networks with temporal data. Specifically, we introduce a novel solution, Range Forest Solution (RFS), which can efficiently compute KDE values on spatiotemporal road networks. To support the insertion operation, we present a dynamic version, called Dynamic Range Forest Solution (DRFS). We also propose an optimization called Lixel Sharing (LS) to share similar KDE values between two adjacent lixels. Furthermore, our solutions support many non-polynomial kernel functions and still report exact values. Experimental results show that our solutions achieve up to 6 times faster than the state-of-the-art method. |
| title | Efficient Multiple Temporal Network Kernel Density Estimation |
| topic | Databases |
| url | https://arxiv.org/abs/2501.07106 |