Journal of University of Science and Technology of China ›› 2018, Vol. 48 ›› Issue (1): 57-64.DOI: 10.3969/j.issn.0253-2778.2018.01.008

• Original Paper • Previous Articles     Next Articles

A parallel algorithm for mining user frequent moving patterns

ZHU Yibo, BAO Peiming, JI Genling   

  1. College of Computer Science and Technology, Nanjing Normal University, Nanjing 210046, China)
  • Received:2017-05-20 Revised:2017-06-23 Online:2018-01-01 Published:2018-01-01

Abstract: Through daily moving trajectories, one can effectively find the frequent moving rules, i.e., user frequent moving patterns. Based on PrefixSpan algorithm, a parallel algorithm named PASFORM is presented for mining user frequent moving patterns. PASFORM uses a new pruning strategy to reduce the search space and several time constraints to make mining results time-tagged. It also employs the parallel method to mine mass data and a prefix tree to save the store space. Experimental results show that PASFORM is effective and efficient.

Key words: frequent moving pattern mining, sequential pattern mining, prefix tree, parallelization

CLC Number: