Name
Abstract | ||
|---|---|---|
AbstractNetwork kernel density visualization, or NKDV, has been extensively used to visualize spatial data points in various domains, including traffic accident hotspot detection, crime hotspot detection, disease outbreak detection, and business and urban planning. Due to a wide range of applications for NKDV, some geographical software, e.g., ArcGIS, can also support this operation. However, computing NKDV is very time-consuming. Although NKDV has been used for more than a decade in different domains, existing algorithms are not scalable to million-sized datasets. To address this issue, we propose three efficient methods in this paper, namely aggregate distance augmentation (ADA), interval augmentation (IA), and hybrid augmentation (HA), which can significantly reduce the time complexity for computing NKDV. In our experiments, ADA, IA and HA can achieve at least 5x to 10x speedup, compared with the state-of-the-art solutions. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.14778/3461535.3461540 | Hosted Content |
DocType | Volume | Issue |
Journal | 14 | 9 |
ISSN | Citations | PageRank |
2150-8097 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsz Nam Chan | 1 | 22 | 5.40 |
| Zhe Li | 2 | 0 | 0.34 |
| Leong Hou U | 3 | 348 | 33.45 |
| Jianliang Xu | 4 | 2743 | 168.17 |
| Reynold Cheng | 5 | 3069 | 154.13 |