Abstract
Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences.
This paper proposes an efficient approach for using the preorder linked WAP-trees with binary position codes assigned to each node, to mine frequent sequences, which eliminates the need to engage in numerous re-construction of intermediate WAP-trees during mining. Experiments show huge performance advantages for sequential mining using prefix linked WAP-tree technique.
This research was supported by the Natural Science and Engineering Research Council (NSERC) of Canada under an operating grant (OGP-0194134) and a University of Windsor grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Mining Sequential Patterns. Proceedings of the 11th International Conference on Data Engineering, Taiwan, 1995.
Berendt, B., Spiliopoulou, M.: Analyzing Navigation Behaviour in Web Sites Integrating Multiple Information Systems. VLDB Journal, Special Issue on Databases and the Web, volume 9, number 1, 2000, pages 56–75.
Han, J., Kamber, M.: Data Mining-Concepts and Techniques, Morgan Kaufmann Publisher, 2001.
Masseglia, F., Poncelet, P., Cicchetti, R.: An Efficient Algorithm for Web Usage Mining. Networking and Information Systems Journal (NIS), volume 2, number 5–6, 1999, pages 571–603.
Nanopoulos, A., Manolopoulos, Y.: Mining Patterns from Graph Traversals. Data and Knowledge Engineering, volume 37, number 3, 2001, pages 243–266.
Pei, J., Han, J., Mortazavi-Asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. Proceedings of the 2000 Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’00), Kyoto, Japan, 2000.
Shaffer, C.A.: A Practical Introduction to Data Structures and Algorithm Analysis. Prentice Hall Inc., September 2000.
Spiliopoulou, M.: The Laborious Way from Data Mining to Web Mining. Journal of Computer Systems Science and Engineering, Special Issue on Semantics of the Web, volume 1, 1999, pages 113–126.
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. Proceedings of the Proceedings of the Fifth International Conference On Extending Database Technology (EDBT), Avignon, France, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, Y., Ezeife, C.I. (2003). Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-36175-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04760-5
Online ISBN: 978-3-540-36175-6
eBook Packages: Springer Book Archive