CS-Mine: An Efficient WAP-Tree Mining for Web Access Patterns

Zhou, B., Hui, S. C. and Fong, A. C. M. (2004) CS-Mine: An Efficient WAP-Tree Mining for Web Access Patterns. In: 6th Asia-Pacific Web Conference, Advance Web Technologies and Applications, Hangzhou, China, 14-17 April 2004, pp. 523-532. ISBN 9783540246558 (doi: 10.1007/978-3-540-24655-8_57)

Abstract

Much research has been done on discovering interesting and frequent user access patterns from web logs. Recently, a novel data structure, known as Web Access Pattern Tree (or WAP-tree), was developed. The associated WAP-mine algorithm is obviously faster than traditional sequential pattern mining techniques. However, WAP-mine requires re-constructing large numbers of intermediate conditional WAP-trees during mining, which is also very costly. In this paper, we propose an efficient WAP-tree mining algorithm, known as CS-mine (Conditional Sequence mining algorithm), which is based directly on the initial conditional sequence base of each frequent event and eliminates the need for re-constructing intermediate conditional WAP-trees. This can improve significantly on efficiency comparing with WAP-mine, especially when the support threshold becomes smaller and the size of database gets larger.

• Item Type: Conference Proceedings
• Additional Information: <br>Lecture notes in computer science: 3007</br> Print ISBN: 9783540213710
• 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
• ISBN: 9783540246558