Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences
檔案
- 000268197700010.pdf (637.3 KB, Adobe PDF)
日期
2009-07-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 25 卷第 4 期,頁 1121–1133
ISSN
1016-2364
語言
英文
摘要
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.
所屬典藏
會議論文引用此條目
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://ir.lib.nycu.edu.tw/handle/11536/7083
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/7083