Online, one-pass mining Web click streams poses some interesting computational issues, such as unbounded length of streaming data, possibly very fast arrival rate, and just one scan over previously arrived Web click-sequences. In this paper, we propose a new, single-pass algorithm, called DSM-TKP (Data Stream Mining for Top-K Path traversal patterns), for mining a set of top-k path traversal patterns, where k is the desired number of path traversal patterns to be mined. An effective summary data structure, called TKP-forest (a forest of Top-K Path traversal patterns), is used to maintain the essential information about the top-k path traversal patterns generated so far. Experimental studies show that the proposed DSM-TKP algorithm uses stable memory usage and makes only one pass over the streaming Web click-sequences.
|Number of pages||13|
|Journal||Journal of Information Science and Engineering|
|State||Published - Jul 2009|
|Event||IEEE/WIC/ACM International Conference on Web Intelligence - Compiegne Univ Technol, Compiegne, France|
Duration: 19 Sep 2005 → 22 Sep 2005
- web usage mining; data streams; path traversal patterns; top-k pattern mining; single-pass mining
Li, H-F., & Lee, S-Y. (2009). Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences. Journal of Information Science and Engineering, 25(4), 1121-1133. https://doi.org/10.6688/JISE.2009.25.4.10