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-go mobile 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Halvey, M., Keane, M., Smyth, B.: Predicting navigation patterns on the mobile-internet using time of the week. In: WWW 2005, pp. 958–959. ACM Press, New York (2005)
Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining data streams: a review. ACM SIGMOD Record 34(2), 18–26 (2005)
Jiang, N., Gruenwald, L.: Research issues in data stream association rule mining. ACM SIGMOD Record 35(1), 14–19 (2006)
Yamakami, T.: A time slot count in window method suitable for long-term regularity-based user classification for mobile internet. In: MUE 2008, pp. 25–29. IEEE Computer Society Press, Los Alamitos (2008)
Yamakami, T.: A long interval method to identify regular monthly mobile internet users. In: WAMIS 2008 (AINA2008 Workshops), pp. 1625–1630. IEEE Computer Society Press, Los Alamitos (2008)
Kamada, T.: Compact HTML for small information appliances. W3C Note, February 9, 1998 (1998), http://www.w3.org/TR/1998/NOTE-compactHTML-19980209
R Development Core Team: R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria (2005) ISBN 3-900051-07-0
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamakami, T. (2008). A 4+1 Bit Month-Scale Regularity Mining Algorithm with One-Path and Distributed Server Constraints for Mobile Internet. In: Takizawa, M., Barolli, L., Enokido, T. (eds) Network-Based Information Systems. NBiS 2008. Lecture Notes in Computer Science, vol 5186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85693-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-85693-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85692-4
Online ISBN: 978-3-540-85693-1
eBook Packages: Computer ScienceComputer Science (R0)