Mining User Movement Behavior Patterns in a Mobile Service Environment

被引:36
作者
Chen, Tzung-Shi [1 ]
Chou, Yen-Ssu [2 ]
Chen, Tzung-Cheng [3 ]
机构
[1] Natl Univ Tainan, Dept Comp Sci & Informat Engn, Tainan 70005, Taiwan
[2] Natl Tsing Hua Univ, Ctr Serv Technol & Management, Hsinchu 30013, Taiwan
[3] Chang Jung Christian Univ, Dept Engn & Management Adv Technol, Tainan 71101, Taiwan
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS | 2012年 / 42卷 / 01期
关键词
Data mining; mobile access patterns; mobile services; mobility prediction; spatio-temporal mining; DATA ALLOCATION; OBJECT TRACKING; DISCOVERY; QUERIES; SYSTEM; LOGS;
D O I
10.1109/TSMCA.2011.2159583
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile service systems offer users useful information ubiquitously via mobile devices. Based on changeable user movement behavior patterns (UMBPs), mobile service systems have the capability of effectively mining a special request from abundant data. In this paper, UMBPs are studied in terms of the problem of mining matching mobile access patterns based on joining the following four kinds of characteristics, U, L, T, and S, where U is the mobile user, L is the movement location, T is the dwell time in the timestamp, and S is the service request. By introducing standard graph-matching algorithms along with the primitives of a database management system, which comprises grouping, sorting, and joining, these joint operations are defined. Moreover, by mining the associated structure via maximum weight bipartite graph matching, a prediction mechanism, based on the model of UMBPs, is utilized to find strong relationships among U, L, T, and S. In addition, a PC-based experimental evaluation under various simulation conditions, using synthetically generated data, is introduced. Finally, performance studies are conducted to show that, in terms of execution efficiency and scalability, the proposed procedures produced excellent performance results.
引用
收藏
页码:87 / 101
页数:15
相关论文
共 27 条
[1]  
Agrawal R., 1994, P 20 INT C VER LARG, P487, DOI DOI 10.5555/645920.672836
[2]  
Bellur U, 2007, 2007 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, P86
[3]   Self-Organized Data Ecologies for Pervasive Situation-Aware Services: The Knowledge Networks Approach [J].
Bicocchi, Nicola ;
Baumgarten, Matthias ;
Brgulja, Nermin ;
Kusber, Rico ;
Mamei, Marco ;
Mulvenna, Maurice ;
Zambonelli, Franco .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2010, 40 (04) :789-802
[4]  
Chang Yuan-Chi., 2000, P ACM INT C MANAGEME, P391
[5]   Optimizing top-k selection queries over multimedia repositories [J].
Chaudhuri, S ;
Gravano, L ;
Marian, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (08) :992-1009
[6]  
Fayyazi M., 2004, Proceedings. 18th International Parallel and Distributed Processing Symposium
[7]  
HUANG JL, 2003, P 12 INT C INF KNOWL, P161
[8]   Mining web logs to improve hit ratios of prefetching and caching [J].
Huang, Yin-Fu ;
Hsu, Jhao-Min .
KNOWLEDGE-BASED SYSTEMS, 2008, 21 (01) :62-69
[9]   Global data allocation based on user behaviors in mobile computing environments [J].
Huang, Yin-Fu ;
Lin, Kun-Hao .
COMPUTER COMMUNICATIONS, 2008, 31 (10) :2420-2427
[10]   Supporting top-k join queries in relational databases [J].
Ilyas, IF ;
Aref, WG ;
Elmagarmid, AK .
VLDB JOURNAL, 2004, 13 (03) :207-221