.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
proximity computation
data models
ZIP code data
smart city
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
.png){kind=icon}
PREAI
分享收藏A Survey of Top-k Query Processing Techniques in Relational Database Systems关系数据库系统中Top-k查询处理技术综述OAAI
OAAI分享收藏A collaborative approach to moving k-nearest neighbor queries in directed and dynamic road networks
PREAI
分享收藏
查看更多内容