Incrementally Mining Temporal Patterns in Interval-based Databases

檔案

本條目沒有附加檔案。

日期

2014

期刊名稱

2014 INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA)

卷期與頁次

頁 304–311

ISBN

978-1-4799-6991-3

語言

英文

摘要

In several applications, sequence databases generally update incrementally with time. Obviously, it is impractical and inefficient to re-mine sequential patterns from scratch every time a number of new sequences are added into the database. Some recent studies have focused on mining sequential patterns in an incremental manner; however, most of them only considered patterns extracted from time point-based data. In this paper, we proposed an efficient algorithm, Inc_TPMiner, to incrementally mine sequential patterns from interval-based data. We also employ some optimization techniques to reduce the search space effectively. The experimental results indicate that Inc_TPMiner is efficient in execution time and possesses scalability. Finally, we show the practicability of incremental mining of interval-based sequential patterns on real datasets.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, Y.-C., Weng, J. T.-Y., Wang, J.-Z., Chou, C.-L., Huang, J.-L., & Lee, S.-Y. (2014). Incrementally Mining Temporal Patterns in Interval-based Databases. 2014 INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), 304–311. https://ir.lib.nycu.edu.tw/handle/11536/136497

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/136497