刘素杰. 带相对时间的轨迹序列模式挖掘[J]. 微电子学与计算机, 2013, 30(11): 108-111.
引用本文: 刘素杰. 带相对时间的轨迹序列模式挖掘[J]. 微电子学与计算机, 2013, 30(11): 108-111.
LIU Su-jie. Trajectory Sequential Pattern Mining with the Relative Time[J]. Microelectronics & Computer, 2013, 30(11): 108-111.
Citation: LIU Su-jie. Trajectory Sequential Pattern Mining with the Relative Time[J]. Microelectronics & Computer, 2013, 30(11): 108-111.

带相对时间的轨迹序列模式挖掘

Trajectory Sequential Pattern Mining with the Relative Time

  • 摘要: 针对带有时间约束的序列模式挖掘算法时空效率低的问题,引入相对时间,提出带相对时间的轨迹序列模式挖掘。该算法利用相对时间作为约束条件,首先基于网格划分计算相对时间内的网格密度,接着对密度网格进行扩展得到兴趣区域,然后在兴趣区域的基础上挖掘轨迹序列模式。使用真实数据进行实验,实验表明,与传统的序列模式挖掘算法相比,该算法的挖掘效率在时间和空间上都有明显提高。

     

    Abstract: For the problem that the low efficiency of time constrained sequential pattern mining algorithm in the aspect of time and space, this paper proposes trajectory sequential pattern mining with the relative time. The algorithm uses the relative time as a constraint condition.Firstly,it computes grid density of the relative time based on grid division,and then obtains regions of interest through extension dense grid.What is more,conduct trajectory sequential pattern mining on the basis of regions of interest.Experiments on real dataset show that this algorithm maintains better efficiency in time and space performance than traditional sequential pattern mining algorithms.

     

/

返回文章
返回