期刊論文
| 學年 | 96 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 2007-11-01 |
| 作品名稱 | Discover Sequential Patterns in Incremental Database |
| 作品名稱（其他語言） | |
| 著者 | Lin, Nancy P.; Hao, Wei Hua; Chen, Hung Jen; Chueh, Hao En; Chang, Chung I |
| 單位 | 淡江大學資訊工程學系;軍訓室 |
| 出版者 | Braga: North Atlantic University Union |
| 著錄名稱、卷期、頁數 | International Journal of Computers 4(1), pp.197-201 |
| 摘要 | The task of sequential pattern mining is to discover the complete set of sequential patterns in a given sequence database with minimum support threshold. But in practice, minimum support some time is defined afterward, or need to be adjusted to discover information that interest to knowledge workers. In the same time, the problem of discover sequential patterns in a incremental database is an essential issue in real world practice of datamining. This paper discusses the issue of maintaining discovered sequential patterns when some information is appended to a sequence database. Many previous works based on Apriori-like approaches are not capable to do so without re-running previously presented algorithms on the whole updated database. We propose a novel algorithm, called DSPID, which takes full advantage of the information obtained from previous mining results to cut down the cost of finding new sequential patterns in an incremental database. |
| 關鍵字 | |
| 語言 | en |
| ISSN | 1998-4308 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | PRT |
| 公開徵稿 | |
| 出版型式 | 電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/17387 ) |