On mining webclick streams for path traversal patterns

Authors:
Hua-Fu Li;Suh-Yin Lee;Man-Kwan Shan
Affiliations:
National Chiao-Tung University, Taiwan R.O.C.;National Chiao-Tung University, Taiwan R.O.C.;National Cheng-Chi University, Taiwan, R.O.C.
Venue:
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Year:
2004

Citing 4
Cited 6

Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Data Mining for Path Traversal Patterns

IEEE Transactions on Knowledge and Data Engineering
A simple algorithm for finding frequent elements in streams and bags

ACM Transactions on Database Systems (TODS)
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery

Efficient evaluation of parameterized pattern queries

Proceedings of the 14th ACM international conference on Information and knowledge management
DSM-PLW: single-pass mining of path traversal patterns over streaming web click-sequences

Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Parameterized pattern queries

Data & Knowledge Engineering
Discovering geographical-specific interests from web click data

Proceedings of the first international workshop on Location and the web
Path Data in Marketing: An Integrative Framework and Prospectus for Model Building

Marketing Science
Mining top-k maximal reference sequences from streaming web click-sequences with a damped sliding window

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user access patterns as maximal forward references, we present a single-pass algorithm StreamPath for online discovering frequent path traversal patterns from an extended prefix tree-based data structure which stores the compressed and essential information about user's moving histories in the stream. Theoretical analysis and performance evaluation show that the space requirement of StreamPath is limited to a logarithmic boundary, and the execution time, compared with previous multiple-pass algorithms [2], is fast.