請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36149
標題: | 在時間序列資料庫中探勘關聯性規則 Mining Association Rules in Time-series Databases |
作者: | Jen-Feng Li 李任峰 |
指導教授: | 李瑞庭 |
關鍵字: | 資料探勘,關聯性規則,時間序列資料庫,字尾樹, data mining,association rules,time-series databases,suffix tree, |
出版年 : | 2005 |
學位: | 碩士 |
摘要: | Discovering association rules can reveal the cause-effect relationships among events in a time-series database. The problem can be transformed to finding frequent sequential patterns. However, most of sequential pattern mining algorithms proposed are not suitable to mine frequent patterns in a time-series database since they are not efficient to mine frequent patterns for long sequences and a time-series database usually contains long sequences. Moreover, they do not consider the distance between the frequent patterns. Thus, in this thesis, we propose an efficient algorithm to mine frequent patterns in time-series database.
Our proposed algorithm, CP-Miner, consists of three phases. First of all, we transform every real value number in a time-series sequence into a symbolic level so that every time-series sequence can be considered as a string. Then we employ a suffix tree to store the whole database thus we can easily find the frequent strings by traversing the suffix tree. Finally, we can combine these frequent strings to generate longer frequent patterns by traversing the suffix tree. It is shown that the CP-Miner algorithm outperforms the Apriori-like algorithm in terms of runtime and space requirement. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36149 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊管理學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-94-1.pdf 目前未授權公開取用 | 391.98 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。