Efficient mining of group patterns from user movement data

• Main Authors: WANG, Yida, LIM, Ee Peng, HWANG, San-Yih
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2006
• Subjects: Databases and Information Systems; Numerical Analysis and Scientific Computing
• Online Access: https://ink.library.smu.edu.sg/sis_research/46; https://ink.library.smu.edu.sg/context/sis_research/article/1045/viewcontent/10.1.1.331.7383.pdf
• Institution: Singapore Management University

In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location data emitted from mobile devices tracking users. We formally define group pattern as a group of users that are within a distance threshold from one another for at least a minimum duration. To mine group patterns, we first propose two algorithms, namely AGP and VG-growth. In our first set of experiments, it is shown when both the number of users and logging duration are large, AGP and VG-growth are inefficient for the mining group patterns of size two. We therefore propose a framework that summarizes user movement data before group pattern mining. In the second series of experiments, we show that the methods using location summarization reduce the mining overheads for group patterns of size two significantly. We conclude that the cuboid based summarization methods give better performance when the summarized database size is small compared to the original movement database. In addition, we also evaluate the impact of parameters on the mining overhead.