A 4+1 Bit Month-Scale Regularity Mining Algorithm with One-Path and Distributed Server Constraints for Mobile Internet

Authors:
Toshihiko Yamakami
Affiliations:
ACCESS, Tokyo, Japan and Graduate School of Engineering, Kagawa University,
Venue:
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
Year:
2008

Citing 5
Cited 2

Predicting navigation patterns on the mobile-internet using time of the week

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Mining data streams: a review

ACM SIGMOD Record
Research issues in data stream association rule mining

ACM SIGMOD Record
A Long Interval Method to Identify Regular Monthly Mobile Internet Users

AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
A Time Slot Count in Window Method Suitable for Long-Term Regularity-Based User Classification for Mobile Internet

MUE '08 Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering

An empirical analysis of revisit behaviors of monthly subscription-based mobile video services

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
A one-seg service development model: ecosystem considerations in the context of mobile communication/broadcast convergence

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile Internet becomes increasing visible in everyday life. As increased penetration leverages mobile application business opportunities, it is crucial to identify methodologies to fit mobile-specific demands. Regularity is one of the important measures to enclose easy-come, easy-gomobile users. It is known that a user with multiple visits in one day with a long interval has a larger revisiting possibility in the following month than the others. The author proposes a 4+1 bit method to incorporate this empirical law in order to cope with the two major mobile restrictions: distributed server environments and large data stream. The proposed method can be performed in a one-path manner with 32-bit word boundary-aware memory compaction. The experimental result shows the method is promising to identify revisiting users under mobile-specific constraints.