본문 바로가기
  • Home

Location Generalization Method of Moving Objectusing R*-Tree and Grid

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2007, 12(2), pp.231-242
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Ko, Hyeon 1 김광종 1 Yonsik Lee 1

1군산대학교

Accredited

ABSTRACT

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points, And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on R*-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

Citation status

* References for papers published after 2022 are currently being built.