Abstract
Web usage mining discovers interesting and frequent user access patterns from web logs. Most of the previous works have focused on mining common sequential access patterns of web access events that occurred within the entire duration of all web access transactions. However, many useful sequential access patterns occur frequently only during a particular periodic time interval due to user browsing behaviors and habits. It is therefore important to mine periodic sequential access patterns with periodic time constraints. In this paper, we propose an efficient approach, known as TCS-mine (Temporal Conditional Sequence mining algorithm), for mining periodic sequential access patterns based on calendar-based periodic time constraints. The calendar-based periodic time constraints are used for describing real-life periodic time concepts such as the morning of every weekend. The mined periodic sequential access patterns can be used for temporal-based personalized web recommendations. The performance of the proposed TCS-mine algorithm is evaluated and compared with a modified version of WAP-mine for mining periodic sequential access patterns.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kosala, R., Blockeel, H.: Web Mining Research: A Survey. ACM SIGKDD Explorations 2, 1–15 (2000)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of the 11th Intl. Conf. on Data Engineering, Taipei, Taiwan (1995)
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Pei, J., Han, J., Mortazavi-asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, Springer, Heidelberg (2000)
Zhou, B.Y., Hui, S.C., Fong, A.C.M.: CS-mine: An Efficient WAP-tree Mining for Web Access Patterns. In: Proc. of the 6th APWeb Conf., Hangzhou, China (2004)
Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rules. In: Proc. of the 14th Intl. Conf. on Data Engineering, pp. 412–421 (1998)
Ramaswamy, S., Mahajan, S., Silberschatz, A.: On the Discovery of Interesting Patterns in Association Rules. In: Proc. of the 24th Intl. Conf. on VLDB, New York, USA (1998)
Li, Y., Ning, P., Wang, X.S., Jajodia, S.: Discovering Calendar-based Temporal Association Rules. In: Proc. of the 8th Intl. Symp. on Temporal Representation and Reasoning (2001)
Cooley, R., Mobasher, B., Srivastava, J.: Data Preparation for Mining World Wide Web Browsing Patterns. Journal of Knowledge and Information Systems 1(1) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, B., Hui, S.C., Fong, A.C.M. (2004). An Efficient Approach for Mining Periodic Sequential Access Patterns. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive