An efficient approach for mining periodic sequential access patterns

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Zhou, B., Hui, S. C., & Fong, A. C. M. (2004). An efficient approach for mining periodic sequential access patterns. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 485–494). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free