.png){kind=icon}
Return
Efficient Proximity Computation Techniques Using ZIP Code Data for Smart Cities
.png){kind=icon}
OA
AI
DOI：10.3390/s18040965.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we are interested in computing ZIP code proximity from two perspectives, proximity between two ZIP codes (Ad-Hoc) and neighborhood proximity (Top-K). Such a computation can be used for ZIP code-based target marketing as one of the smart city applications. A naive approach to this computation is the usage of the distance between ZIP codes. We redefine a distance metric combining the centroid distance with the intersecting road network between ZIP codes by using a weighted sum method. Furthermore, we prove that the results of our combined approach conform to the characteristics of distance measurement. We have proposed a general and heuristic approach for computing Ad-Hoc proximity, while for computing Top-K proximity, we have proposed a general approach only. Our experimental results indicate that our approaches are verifiable and effective in reducing the execution time and search space.
Keywords:
proximity computation
data models
ZIP code data
smart city
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.2W
Citations:
20.9W
Organization
Cited Papers
.png){kind=icon}
ShareSaveA collaborative approach to moving k-nearest neighbor queries in directed and dynamic road networks
PREAI
ShareSaveShareSave
View more