| 一种缩小轨迹误差边界的队列发现算法 |
| |
| 引用本文： | 苏博,陈子军,刘文远. 一种缩小轨迹误差边界的队列发现算法[J]. 燕山大学学报, 2010, 34(4): 327-330. DOI: 10.3969/j.issn.1007-791X.2010.04.009 |
| |
| 作者姓名： | 苏博 陈子军 刘文远 |
| |
| 作者单位： | 燕山大学信息科学与工程学院,河北,秦皇岛,066004 |
| |
| 摘 要： | 现有的队列发现方法采用各个时间点最大值作为整个轨迹的误差边界,在队列发现过程中产生了过多的候选队列而且花费较多时间。本文提出缩小轨迹误差边界的队列发现方法,在缩小后的时间间隔内寻找队列,从而减少候选队列数和聚类时间点数。通过实验验证,该算法发现队列的效率较高。
|
| 关 键 词： | 队列发现 误差边界 缩小边界 |
An algorithm of convoy discovery using tighten error bounds |
| |
| SU Bo,CHEN Zi-jun,LIU Wen-yuan. An algorithm of convoy discovery using tighten error bounds[J]. Journal of Yanshan University, 2010, 34(4): 327-330. DOI: 10.3969/j.issn.1007-791X.2010.04.009 |
| |
| Authors: | SU Bo CHEN Zi-jun LIU Wen-yuan |
| |
| Affiliation: | SU Bo,CHEN Zi-jun,LIU Wen-yuan (College of Information Science , Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China) |
| |
| Abstract: | Existing convoy discovery method uses the maximum value over all its line segments as the actual tolerance value of the trajectory and it costs much time. In this paper, CUTB algorithm is proposed to tighten the error bounds and find convoy in the tighten time area. This permits efficient convoy discovery over the fewer time pionts and the candidate convoys. The experiment demonstrates that the proposals are more effective and efficient. |
| |
| Keywords: | convoy discovery error bounds tighten bounds |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
