The Efficient Spatio-Temporal Moving Pattern Mining using Moving Sequence Tree 


Vol. 16,  No. 2, pp. 237-248, Apr.  2009
10.3745/KIPSTD.2009.16.2.237


PDF
  Abstract

Recently, based on dynamic location or mobility of moving object, many researches on pattern mining methods actively progress to extract more available patterns from various moving patterns for development of location based services. The performance of moving pattern mining depend on how analyze and process the huge set of spatio-temporal data. Some of traditional spatio-temporal pattern mining methods[1-6,8-11]have proposed to solve these problem, but they did not solve properly to reduce mining execution time and minimize required memory space. Therefore, in this paper, we propose new spatio-temporal pattern mining method which extract the sequential and periodic frequent moving patterns efficiently from the huge set of spatio-temporal moving data. The proposed method reduces mining execution time of 83%∼93% rate on frequent moving patterns mining using the moving sequence tree which generated from historical data of moving objects based on hash tree. And also, for minimizing the required memory space, it generalize the detained historical data including spatio-temporal attributes into the real world scope of space and time using spatio-temporal concept hierarchy.

  Statistics


  Cite this article

[IEEE Style]

Y. S. Lee and H. Ko, "The Efficient Spatio-Temporal Moving Pattern Mining using Moving Sequence Tree," The KIPS Transactions:PartD, vol. 16, no. 2, pp. 237-248, 2009. DOI: 10.3745/KIPSTD.2009.16.2.237.

[ACM Style]

Yon Sik Lee and Hyun Ko. 2009. The Efficient Spatio-Temporal Moving Pattern Mining using Moving Sequence Tree. The KIPS Transactions:PartD, 16, 2, (2009), 237-248. DOI: 10.3745/KIPSTD.2009.16.2.237.