Incremental mining of temporal patterns in interval-based database

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/106762

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106762

题名:	Incremental mining of temporal patterns in interval-based database
作者:	陳以錚;Hui, Lin;Chen, Yi-Cheng;Weng, Julia Tzu-Ya;Lee, Suh-Yin
贡献者:	管理學院資訊管理學系
关键词:	Algorithms;Aneurysms;Arthritis;Computer Science;Data mining;Data Mining and Knowledge Discovery;Database Management;Evolution;Information Storage and Retrieval;Information systems;Information Systems and Communication Service;Information Systems Applications (incl.Internet);IT in Business;Kawasaki disease;Medical records;Miners;Myocarditis;Optimization;Optimization techniques;Patients;Regular Paper;Studies;Temporal logic
日期:	2016-02-01
上传时间:	2026-04-23 13:41:34 (UTC+8)
出版者:	Springer London;London: Springer London
摘要:	摘要： In several real-life applications, sequence databases, in general, are updated incrementally with time. Some discovered sequential patterns may be invalidated and some new ones may be introduced by the evolution of the database. When a small set of sequences grow, or when some new sequences are added into the database, re-mining sequential patterns from scratch each time is usually inefficient and thus not feasible. Although there have been several recent studies on the maintenance of sequential patterns in an incremental manner, these works only consider the patterns extracted from time point-based data. Few research efforts have been elaborated on maintaining time interval-based sequential patterns, also called temporal patterns , where each datum persists for a period of time. In this paper, an efficient algorithm, Inc_TPMiner ( Incremental Temporal Pattern Miner ) is developed to incrementally discover temporal patterns from interval-based data. Moreover, the algorithm employs some optimization techniques to reduce the search space effectively. The experimental results on both synthetic and real datasets indicate that Inc_TPMiner significantly outperforms re-mining with static algorithms in execution time and possesses graceful scalability. Furthermore, we also apply Inc_TPMiner on a real dataset to show the practicability of incremental mining of temporal patterns. 其他題名： Knowl Inf Syst 出版者： London: Springer London 出版日期： 2016-02 出處： Knowledge and information systems, 2016-02, Vol.46 (2), p.423-448 資源來源： ABI/INFORM Collection 版權： Springer-Verlag London 2015 版權： Springer-Verlag London 2016 識別號： ISSN: 0219-1377 識別號： EISSN: 0219-3116 識別號： DOI: 10.1007/s10115-015-0828-5 識別號： CODEN: KISNCR
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	17	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....