Detecting commuting patterns by clustering subtrajectories
文献类型：期刊论文
| 作者 | Buchin, Kevin; Buchin, Maike; Gudmundsson, Joachim; Loeffler, Maarten; Luo, Jun |
| 刊名 | International Journal of Computational Geometry & Applications
 |
| 出版日期 | 2011 |
| 卷号 | 21期号:3页码:253-282 |
| 英文摘要 | In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Frechet distance and the discrete Frechet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the 'longest' subtrajectory cluster is as hard as MaxClique to compute and approximate. |
| 收录类别 | SCI |
| 原文出处 | http://www.worldscientific.com/doi/abs/10.1142/S0218195911003652 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3565]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | International Journal of Computational Geometry & Applications |
| 推荐引用方式 GB/T 7714 | Buchin, Kevin,Buchin, Maike,Gudmundsson, Joachim,et al. Detecting commuting patterns by clustering subtrajectories[J]. International Journal of Computational Geometry & Applications,2011,21(3):253-282. |
| APA | Buchin, Kevin,Buchin, Maike,Gudmundsson, Joachim,Loeffler, Maarten,&Luo, Jun.(2011).Detecting commuting patterns by clustering subtrajectories.International Journal of Computational Geometry & Applications,21(3),253-282. |
| MLA | Buchin, Kevin,et al."Detecting commuting patterns by clustering subtrajectories".International Journal of Computational Geometry & Applications 21.3(2011):253-282. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。