| 摘要: |
| 发现被移动对象频繁造访的热门区域是从轨迹数据库中挖掘运动模式的重要前提,而合理约束热门区域的大小是提高轨迹模式的精确表达能力的关键.研究如何从轨迹数据库找出热门区域及如何限制其大小.定义了带有覆盖范围约束的热门区域,并采用过滤-精炼策略发现热门区域.在过滤阶段,设计了一种基于网格的密集区域发现近似算法以提高发现效率;在精炼阶段,提出了基于趋势和差异性的度量指标,实现了对应区域重构算法及重构参数启发性选择算法,保证了从密集区域中有效提取出符合覆盖范围约束的热门区域.在真实数据集上验证了该工作的有效性. |
| 关键词: 移动对象 轨迹数据库 热门区域 数据挖掘 |
| DOI：10.3724/SP.J.1001.2013.04340 |
| 分类号: |
| 基金项目:国家自然科学基金(61202064, 61003028, 91124001); 国家科技重大专项(核高基)(2012ZX01039-004); 国家高技术研究发展计划(863)(2013AA01A603); 中国科学院战略性科技先导专项课题(XDA06010600); 中国科学院重点部署项目(KGZDEW-102-3-3) |
|
| Discovery of Hot Region in Trajectory Databases |
|
LIU Kui-En1, XIAO Jun-Chao1, DING Zhi-Ming1, LI Ming-Shu1,2
|
|
1.National Research Center of Fundamental Software, Institute of Software, The Chinese Academy of Sciences, Beijing 100190, China;2.State Key Laboratory of Computer Science (Institute of Software, The Chinese Academy of Sciences), Beijing 100190, China
|
| Abstract: |
| Mining of the enclosed regions that are visited frequently by moving objects (i.e. hot region) is a critical premise for the discovery of movement patterns from trajectory databases, and restricting their coverage is the key to promote precision and efficiency for representation of trajectory patterns. Given a trajectory database, this paper studies how to discover these hot regions and how to constraint their size. A definition of hot region query with coverage constraints is presented with a filter-refinement framework to construct them. In the filter step, the study introduces a grid-based approximate schema to construction the dense regions efficiently; and in the refinement step, the study proposes two trend-based and dissimilarity-based measures, and designs corresponding algorithms and heuristic parameter selection method to rationally reconstruct the regions under the coverage constraints. Experiments on practical datasets validate the effectiveness of this work. |
| Key words: moving object trajectory database hot region data mining |
