Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 On Mining Webclick Streams for Path Traversal Patterns
作者 Hua-Fu Li;Suh-Yin Lee;Man-Kwan Shan
沈錳坤
關鍵詞 algorithms; data mining; data stream mining; path traversal patterns performance; web-click streams
日期 2004
上傳時間 9-Jan-2009 16:54:00 (UTC+8)
摘要 Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user access patterns as maximal forward references, we present a single-pass algorithm StreamPath for online discovering frequent path traversal patterns from an extended prefix tree-based data structure which stores the compressed and essential information about user`s moving histories in the stream. Theoretical analysis and performance evaluation show that the space requirement of StreamPath is limited to a logarithmic boundary, and the execution time, compared with previous multiple-pass algorithms [2], is fast.
關聯 World Wide Web Conference
資料類型 conference
DOI http://dx.doi.org/10.1145/1013367.1013497
dc.creator (作者) Hua-Fu Li;Suh-Yin Lee;Man-Kwan Shanen_US
dc.creator (作者) 沈錳坤-
dc.date (日期) 2004en_US
dc.date.accessioned 9-Jan-2009 16:54:00 (UTC+8)-
dc.date.available 9-Jan-2009 16:54:00 (UTC+8)-
dc.date.issued (上傳時間) 9-Jan-2009 16:54:00 (UTC+8)-
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/23930-
dc.description.abstract (摘要) Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user access patterns as maximal forward references, we present a single-pass algorithm StreamPath for online discovering frequent path traversal patterns from an extended prefix tree-based data structure which stores the compressed and essential information about user`s moving histories in the stream. Theoretical analysis and performance evaluation show that the space requirement of StreamPath is limited to a logarithmic boundary, and the execution time, compared with previous multiple-pass algorithms [2], is fast.-
dc.format application/pdfen_US
dc.format.extent 232393 bytes-
dc.format.mimetype application/pdf-
dc.language enen_US
dc.language en-USen_US
dc.language.iso en_US-
dc.relation (關聯) World Wide Web Conferenceen_US
dc.subject (關鍵詞) algorithms; data mining; data stream mining; path traversal patterns performance; web-click streams-
dc.title (題名) On Mining Webclick Streams for Path Traversal Patternsen_US
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1145/1013367.1013497en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1145/1013367.1013497en_US