會議論文
| 學年 | 101 |
|---|---|
| 學期 | 2 |
| 發表日期 | 2013-07-22 |
| 作品名稱 | Pincer-Style Maximal Sequential Pattern Mining |
| 作品名稱（其他語言） | |
| 著者 | Jou, Chichang; Wu, Chen-Cheng |
| 作品所屬單位 | 淡江大學資訊管理學系 |
| 出版者 | IADIS |
| 會議名稱 | 7th European Conference on Data Mining (ECDM 2013) |
| 會議地點 | 布拉格, 捷克 |
| 摘要 | Apriori-based sequential pattern mining algorithms use bottom-up method. They join frequent patterns with shorter length into candidate patterns with longer length, and then repeat the process until no more candidate patterns could be generated. In many applications, only frequent maximal sequential patterns (MSP), which are not a sub-sequence of any other frequent sequential pattern, are requested. In these cases, the Apriori-based algorithms will generate all sequential patterns first, and then eliminate non-maximal ones. That would perform lots of computations not directly related to the final results. For this reason, we propose the Pincer-Style Maximal Sequential Pattern Mining algorithm, PMSPM, to obtain all frequent MSPs by eliminating most of the intermediate steps in the Apriori-based algorithms. Like a pincer’s movement, PMSPM alternates bottom-up and top-down directions to find many MSPs in the early top-down stages. Thus, minings in the bottom-up direction could safely skip many repetitive procedures. PMSPM could save lots of support counting efforts to reduce computing time. We implement PMSPM and compare its performance with that of an Apriori-like algorithm. We also test effects of database parameters on its performance. |
| 關鍵字 | Sequential Pattern Mining |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 20130722~20130724 |
| 通訊作者 | Jou, Chichang |
| 國別 | |
| 公開徵稿 | Y |
| 出版型式 | 電子版 |
| 出處 | pp.79-83 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/101112 ) |