树遍历
计算机科学
弹道
采样(信号处理)
导线
估计员
查询优化
数据挖掘
差异(会计)
骨料(复合)
算法
统计
数学
会计
大地测量学
物理
材料科学
滤波器(信号处理)
天文
业务
复合材料
计算机视觉
地理
作者
Yichen Ding,Yanhua Li,Xun Zhou,Zhuojie Huang,Simin You,Jun Luo
标识
DOI:10.1109/tbdata.2018.2830780
摘要
This paper defines and investigates a novel trajectory query, namely, Traversal Trajectory Aggregate (TTA) Query: Given a trajectory database and a pair of upstream and downstream spatio-temporal (ST) regions (i.e., spatial area coupled with a time interval), a TTA query aims to retrieve the total number of unique trajectories that traverse through these two ST regions. Such TTA queries play an important role in various urban applications, such as route planning, taxi dispatching, and location-based advertising. Two baselines can answer such TTA queries: (a) exact search (over the entire ST query regions) can obtain the exact answer, but it leads to extremely long running time when the ST query regions are huge; (b) uniform-sampling-based approaches estimate the query answer with sampled trajectories. However, the uniform sampling distribution may lead to significant estimation variance for TTA query, because traversal trajectories are relatively few and unevenly distributed in the query regions. To tackle these challenges, this paper proposes a novel Targeted Index Sampling (TIS) framework to answer TTA queries with high estimation accuracy. TIS employs a two-stage framework, with a Pilot Sampling Estimation (PSE) stage to estimate the distribution of trajectories in ST query region, and an Integrated Importance Sampling (IIS) stage, which collects trajectories with the importance sampling distribution obtained in PSE, and estimates the query result with an asymptotically unbiased estimator. Extensive experiments and case studies using a large-scale real taxi trajectory dataset from Shenzhen, China demonstrate that our TIS framework achieves <; 10 percent estimation error with > 90 percent computational time reduction over exact search, and 50 percent reduction on estimation error (with similar running time) over uniform-distribution-based sampling approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI