An Efficient Approach for Mining Periodic Sequential Access Patterns

Zhou, B., Hui, S. C. and Fong, A. C. M. (2004) An Efficient Approach for Mining Periodic Sequential Access Patterns. In: 8th Pacific Rim International Conference on Artificial Intelligence, Auckland, New Zealand, 9-13 Aug 2004, pp. 485-494. (doi: 10.1007/978-3-540-28633-2_52)

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Fong, Dr Alvis Cheuk Min
• Authors: Zhou, B., Hui, S. C., and Fong, A. C. M.
• College/School: College of Science and Engineering > School of Computing Science
• ISSN: 0302-9743