| dc.contributor | 國立政治大學資訊科學系 | en_US |
| dc.creator (作者) | 沈錳坤 | zh_TW |
| dc.creator (作者) | Shan, Man-Kwan | - |
| dc.date (日期) | 2005-09 | en_US |
| dc.date.accessioned | 27-May-2010 16:50:43 (UTC+8) | - |
| dc.date.available | 27-May-2010 16:50:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 27-May-2010 16:50:43 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/39797 | - |
| dc.description.abstract (摘要) | Online, single-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 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 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 (Top-K Path forest) is used to maintain the essential information about the top-k path traversal patterns of the click-stream so far. Experimental studies show that DSM-TKP algorithm uses stable memory usage and makes only one pass over the streaming data. | - |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | 2005 IEEE/WIC/ACM International Conference on Web Intelligence | en_US |
| dc.subject (關鍵詞) | DSM-TKP;Mining;Top-K Path Traversal Patterns;Web Click-Streams | en_US |
| dc.title (題名) | DSM-TKP: Mining Top-K Path Traversal Patterns over Web Click-Streams | en_US |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/WI.2005.56 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/WI.2005.56 | en_US |
