透過您的圖書館登入
IP:18.216.230.107
  • 期刊
  • OpenAccess

PTree: Mining Sequential Patterns Efficiently in Multiple Data Streams Environment

並列摘要


Although issues of data streams have been widely studied and utilized, it is nevertheless challenging to deal with sequential mining of data streams. In this paper, we assume that the transaction of a user is partially coming and that there is no auxiliary for buffering and integrating. We adopt the Path Tree for mining frequent sequential patterns over data streams and integrate the user's sequences efficiently. Algorithms with regards to accuracy (PAlgorithm) and space (PSAlgorithm) are proposed to meet the different aspects of users, although GAlgorithm for mining frequent sequential patterns with a gap limitation is proposed. Many pruning properties are used to further reduce the space usage and improve the accuracy of our algorithms. We also prove that PAlgorithm mine frequent sequential patterns with the approximate support of error guarantee. Through thoughtful experiments, synthetic and real datasets are utilized to verify the feasibility of our algorithms.

被引用紀錄


郭家祥(2015)。從地點紀錄探勘時空語意軌跡模式〔碩士論文,國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2015.00735
Jaysawal, B. P. (2013). 跨多條資料串流之漸進式循序樣式探勘 [master's thesis, Yuan Ze University]. Airiti Library. https://doi.org/10.6838/YZU.2013.00043
CHEN, S. L. (2016). 使用大數據與文字探勘分析顧客文字以了解其對飯店產業的影響 [master's thesis, National Taipei Uinversity]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0023-1303201714242033

延伸閱讀