Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/29575
DC Field | Value | Language |
---|---|---|
dc.creator | 沈錳坤 | zh_TW |
dc.creator | Li, Hua-Fu ; \r\nLee, Suh-Yin ; \r\nShan, Man-Kwan | - |
dc.date | 2006-06 | - |
dc.date.accessioned | 2009-08-24T04:29:32Z | - |
dc.date.available | 2009-08-24T04:29:32Z | - |
dc.date.issued | 2009-08-24T04:29:32Z | - |
dc.identifier.uri | https://nccur.lib.nccu.edu.tw/handle/140.119/29575 | - |
dc.description.abstract | 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 determined 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. | - |
dc.format.extent | 1109305 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | zh_TW | en |
dc.language.iso | en_US | - |
dc.relation | Computer Networks, 50(10), 1474-487 | en |
dc.subject | Web click-sequence streams; \r\nPath traversal patterns; \r\nSingle-pass algorithm | - |
dc.title | DSM-PLW: Single-pass mining of path traversal patterns over streaming web click-sequences | en |
dc.type | article | en |
dc.identifier.doi | 10.1016/j.comnet.2005.10.018 | en_US |
dc.doi.uri | http://dx.doi.org/10.1016/j.comnet.2005.10.018 | en_US |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en_US | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.openairetype | article | - |
Appears in Collections: | 期刊論文 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.