efficiently retrieving longest common route patterns of moving objects by summarizing turning regions
文献类型：会议论文
| 作者 | Huang Guangyan ; Zhang Yanchun ; He Jing ; Ding Zhiming |
| 出版日期 | 2011 |
| 会议名称 | 15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011 |
| 会议日期 | 24-May-20 |
| 会议地点 | Shenzhen, China |
| 关键词 | Abstracting Algorithms Fading (radio) Mining Trajectories |
| 页码 | 375-386 |
| 英文摘要 | The popularity of online location services provides opportunities to discover useful knowledge from trajectories of moving objects. This paper addresses the problem of mining longest common route (LCR) patterns. As a trajectory of a moving object is generally represented by a sequence of discrete locations sampled with an interval, the different trajectory instances along the same route may be denoted by different sequences of points (location, timestamp). Thus, the most challenging task in the mining process is to abstract trajectories by the right points. We propose a novel mining algorithm for LCR patterns based on turning regions (LCRTurning), which discovers a sequence of turning regions to abstract a trajectory and then maps the problem into the traditional problem of mining longest common subsequences (LCS). Effectiveness of LCRTurning algorithm is validated by an experimental study based on various sizes of simulated moving objects datasets. © 2011 Springer-Verlag. |
| 收录类别 | EI |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| ISSN号 | 3029743 |
| ISBN号 | 9783642208409 |
| 源URL | [http://124.16.136.157/handle/311060/14313]  |
| 专题 | 软件研究所_基础软件国家工程研究中心_会议论文 |
| 推荐引用方式 GB/T 7714 | Huang Guangyan,Zhang Yanchun,He Jing,et al. efficiently retrieving longest common route patterns of moving objects by summarizing turning regions[C]. 见:15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011. Shenzhen, China. 24-May-20. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。