Yon Sik Lee , Hyun Ko

The KIPS Transactions:PartD, Vol. 16, No. 1, pp. 113-122, Feb. 2009
10.3745/KIPSTD.2009.16.1.113,   PDF Download:

Abstract

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and A* algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on A* algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

Statistics
Cite this article