Efficient mining of group patterns from user movement data

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.

[1]  George M. Giaglis,et al.  Towards a classification framework for mobile location services , 2003 .

[2]  Guanling Chen,et al.  A Survey of Context-Aware Mobile Computing Research , 2000 .

[3]  Heikki Mannila,et al.  Discovery of Frequent Episodes in Event Sequences , 1997, Data Mining and Knowledge Discovery.

[4]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[5]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[6]  Sridhar Ramaswamy,et al.  Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.

[7]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[8]  Jiawei Han,et al.  Mining Segment-Wise Periodic Patterns in Time-Related Databases , 1998, KDD.

[9]  Cheeha Kim,et al.  Group-Based Location Management Scheme in Personal Communication Networks , 2002, ICOIN.

[10]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[11]  J. Gillon,et al.  Group dynamics , 1996 .

[12]  B. Mennecke,et al.  Mobile Commerce: Technology, Theory and Applications , 2002 .

[13]  Dimitrios Gunopulos,et al.  Discovering similar multidimensional trajectories , 2002, Proceedings 18th International Conference on Data Engineering.

[14]  John Riedl,et al.  E-Commerce Recommendation Applications , 2004, Data Mining and Knowledge Discovery.

[15]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[16]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[17]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[18]  Jian Pei,et al.  Mining sequential patterns with constraints in large databases , 2002, CIKM '02.

[19]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[20]  Stephen Chi-fai Chan,et al.  GBL: Group-Based Location Updating in Mobile Environment , 2004, DASFAA.

[21]  Jianyong Wang,et al.  Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.

[22]  Bradford W. Parkinson,et al.  Global positioning system : theory and applications , 1996 .

[23]  Philip S. Yu,et al.  InfoMiner+: mining partial periodic patterns with gap penalties , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[24]  김치하 Group-based Location management Scheme in Personal Communication Networks , 2002 .

[25]  Yan Huang,et al.  Discovering Spatial Co-location Patterns: A Summary of Results , 2001, SSTD.

[26]  Yida Wang,et al.  Efficient Group Pattern Mining Using Data Summarization , 2004, DASFAA.

[27]  George M. Giaglis,et al.  A taxonomy of indoor and outdoor positioning techniques for mobile location services , 2002, SECO.

[28]  Jyh-haw Yeh,et al.  Mobile Commerce Technology , 2005, Encyclopedia of Information Science and Technology.

[29]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[30]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[31]  Gruia-Catalin Roman,et al.  Consistent group membership in ad hoc networks , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[32]  Xiaoyan Hong,et al.  Dynamic Group Discovery and Routing in Ad Hoc Networks , 2002 .

[33]  Philip S. Yu,et al.  Mining long sequential patterns in a noisy environment , 2002, SIGMOD '02.

[34]  Kyuseok Shim,et al.  Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.

[35]  Yida Wang,et al.  On Mining Group Patterns of Mobile Users , 2003, DEXA.

[36]  Mohammed J. Zaki,et al.  SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.

[37]  Philip S. Yu,et al.  Mining asynchronous periodic patterns in time series data , 2000, KDD '00.