會議論文
| 學年 | 103 |
|---|---|
| 學期 | 1 |
| 發表日期 | 2014-08-13 |
| 作品名稱 | Timed Sequential Pattern Mining Based on Confidence in Accumulated Intervals |
| 作品名稱（其他語言） | |
| 著者 | Jou, Chichang; Shyur, Huan-Jyh; Yen, Chih-Yu |
| 作品所屬單位 | 淡江大學資訊管理學系 |
| 出版者 | IEEE |
| 會議名稱 | The 15th IEEE International Conference on Information Reuse and Integration |
| 會議地點 | San Francisco, U.S.A. |
| 摘要 | Many applications of sequential patterns require a guarantee of a particular event happening within a period of time. We propose CAI-PrefixSpan, a new data mining algorithm to obtain confident timed sequential patterns from sequential databases. Based on PrefixSpan, it takes advantage of the pattern-growth approach. After a particular event sequence, it would first calculate the confidence level regarding the eventual occurrence of a particular event. For those pass the minimal confidence requirement, it then computes the minimal time interval that satisfies the support requirement. It then generates corresponding projected databases, and applies itself recursively on the projected databases. With the timing information, it obtains fewer but more confident sequential patterns. CAI-PrefixSpan is implemented along with PrefixSpan. They are compared in terms of numbers of patterns obtained and execution efficiency. Our effectiveness and performance study shows that CAI-PrefixSpan is a valuable and efficient approach in obtaining timed sequential patterns. |
| 關鍵字 | timed sequential pattern mining; accumulated interval; PrefixSpan |
| 語言 | en_US |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 20140813~20140815 |
| 通訊作者 | Jou, Chichang |
| 國別 | USA |
| 公開徵稿 | Y |
| 出版型式 | 電子版 |
| 出處 | Proceedings of the 15th International Conference on Information Reuse and Integration |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/99535 ) |