期刊
PROCEEDINGS OF THE VLDB ENDOWMENT
卷 13, 期 1, 页码 29-42出版社
ASSOC COMPUTING MACHINERY
DOI: 10.14778/3357377.3357380
关键词
-
资金
- ARC [DP170102726, DP180102050, DP170102231]
- NSFC [61728204, 91646204]
- Google Faculty Research Award
In this paper, we study the problem of large-scale trajectory data clustering, k-paths, which aims to efficiently identify k representative paths in a road network. Unlike traditional clustering approaches that require multiple data-dependent hyperparameters, k-paths can be used for visual exploration in applications such as traffic monitoring, public transit planning, and site selection. By combining map matching with an efficient intermediate representation of trajectories and a novel edge-based distance (EBD) measure, we present a scalable clustering method to solve k-paths. Experiments verify that we can cluster millions of taxi trajectories in less than one minute, achieving improvements of up to two orders of magnitude over state-of-the-art solutions that solve similar trajectory clustering problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据