中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 基础软件国家工程研究中心  > 会议论文
题名:
efficiently retrieving longest common route patterns of moving objects by summarizing turning regions
作者: Huang Guangyan ; Zhang Yanchun ; He Jing ; Ding Zhiming
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 15th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2011
会议日期: 24-May-20
出版日期: 2011
会议地点: Shenzhen, China
关键词: Abstracting ; Algorithms ; Fading (radio) ; Mining ; Trajectories
出版地: Germany
收录类别: EI
ISSN: 3029743
ISBN: 9783642208409
部门归属: (1) Centre for Applied Informatics, School of Engineering and Science, Victoria University, Australia; (2) Institute of Software, Chinese Academy of Sciences, China
英文摘要: 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.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/14313
Appears in Collections:基础软件国家工程研究中心_会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
efficiently retrieving longest common route patterns of moving objects by summarizing turning regions.pdf(293KB)----限制开放-- 联系获取全文

Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Huang Guangyan]'s Articles
[Zhang Yanchun]'s Articles
[He Jing]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Huang Guangyan]‘s Articles
[Zhang Yanchun]‘s Articles
[He Jing]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace