Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1133 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
1121 | en_US |
dc.citation.volume |
25 | en_US |
dc.contributor.author |
Li, Hua-Fu | en_US |
dc.contributor.author |
Lee, Suh-Yin | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:09:16Z | |
dc.date.available |
2014-12-08T15:09:16Z | |
dc.date.issued |
2009-07-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.issn |
1016-2364 | en_US |
dc.identifier.journal |
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/7083 | |
dc.identifier.wosnumber |
WOS:000268197700010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
web usage mining | en_US |
dc.subject |
data streams | en_US |
dc.subject |
path traversal patterns | en_US |
dc.subject |
top-k pattern mining | en_US |
dc.subject |
single-pass mining | en_US |
dc.title |
Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences | en_US |
dc.type |
Article | en_US |
檔案
- 000268197700010.pdf (637.3 KB, Adobe PDF)
所屬典藏: 會議論文
引用此條目
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