Mining frequent trajectory pattern based on vague space partition

详细信息    查看全文

• 作者：Liang Wang ; Kunyuan Hu ; Tao Ku ; Xiaohui Yan
• 关键词：Frequent trajectory pattern ; Data mining ; Vague space partition ; PrefixSpan algorithm ; GSP algorithm
• 刊名：Knowledge-Based Systems
• 出版年：2013
• 出版时间：September, 2013
• 年：2013
• 卷：50
• 期：Complete
• 页码：100-111
• 全文大小：1462 K

文摘

Frequent trajectory pattern mining is an important spatiotemporal data mining problem with broad applications. However, it is also a difficult problem due to the approximate nature of spatial trajectory locations. Most of the previously developed frequent trajectory pattern mining methods explore a crisp space partition approach to alleviate the spatial approximation concern. However, this approach may cause the sharp boundary problem that spatially close trajectory locations may fall into different partitioned regions, and eventually result in failure of finding meaningful trajectory patterns. In this paper, we propose a flexible vague space partition approach to solve the sharp boundary problem. In this approach, the spatial plane is divided into a set of vague grid cells, and trajectory locations are transformed into neighboring vague grid cells by a distance-based membership function. Based on two classical sequential mining algorithms, the PrefixSpan and GSP algorithms, we propose two efficient trajectory pattern mining algorithms, called VTPM-PrefixSpan and VTPM-GSP, to mine the transformed trajectory sequences with time interval constraints. A comprehensive performance study on both synthetic and real datasets shows that the VTPM-PrefixSpan algorithm outperforms the VTPM-GSP algorithm in both effectiveness and scalability.