 |
English
|
正體中文
|
简体中文
|
Post-Print筆數 : 27 |
全文筆數/總筆數 : 116001/147038 (79%)
造訪人次 : 57958192
線上人數 : 7
|
|
|
資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://nccur.lib.nccu.edu.tw/handle/140.119/75893
|
| 題名: | DSM-PLW: Single-pass mining of path traversal patterns over streaming Web click-sequences |
| 作者: | Shan, Man-kwan;Li, Hua-fu;Lee, Suh-yin
沈錳坤 |
| 貢獻者: | 資科系 |
| 關鍵詞: | Web click-sequence streams;Path traversal patterns;Single-pass algorithm |
| 日期: | 2006 |
| 上傳時間: | 2015-06-17 15:44:23 (UTC+8) |
| 摘要: | Mining Web click streams is an important data mining problem with broad applications. However, it is also a difficult problem since the streaming data possess some interesting characteristics, such as unknown or unbounded length, possibly a very fast arrival rate, inability to backtrack over previously arrived click-sequences, and a lack of system control over the order in which the data arrive. In this paper, we propose a projection-based, single-pass algorithm, called DSM-PLW (Data Stream Mining for Path traversal patterns in a Landmark Window), for online incremental mining of path traversal patterns over a continuous stream of maximal forward references generated at a rapid rate. According to the algorithm, each maximal forward reference of the stream is projected into a set of reference-suffix maximal forward references, and these reference-suffix maximal forward references are inserted into a new in-memory summary data structure, called SP- forest (Summary Path traversal pattern forest), which is an extended prefix tree-based data structure for storing essential information about frequent reference sequences of the stream so far. The set of all maximal reference sequences is deter- mined from the SP-forest by a depth-first-search mechanism, called MRS-mining (Maximal Reference Sequence mining). Theoretical analysis and experimental studies show that the proposed algorithm has gently growing memory requirements and makes only one pass over the streaming data. � 2005 Elsevier B.V. All rights reserved. |
| 關聯: | Computer Networks - COMPUT NETW , vol. 50, no. 10, pp. 1474-1487 |
| 資料類型: | article |
| DOI 連結: | http://dx.doi.org/10.1016/j.comnet.2005.10.018 |
| DOI: | 10.1016/j.comnet.2005.10.018 |
| 顯示於類別: | [資訊科學系] 期刊論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| 1-s2.0-S138912860500366X-main.pdf | | 1088Kb | Adobe PDF2 | 804 | 檢視/開啟 |
|
在政大典藏中所有的資料項目都受到原著作權保護.
|
著作權政策宣告 Copyright Announcement1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.
2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(
nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(
nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
