.png){kind=icon}
返回
Mining closed flexible patterns in time-series databases
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2009.06.064.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose an efficient algorithm, called CFP, for mining closed flexible patterns in time-series databases, where flexible gaps are allowed in a pattern. Our proposed algorithm involves three stages: transforming a time-series database into a symbolic database, generating all frequent patterns of length one from the transformed database, and mining closed flexible patterns in a depth-first search manner. In the proposed method, we design two pruning strategies and a closure checking scheme to reduce the search space and thus speed up the algorithm. The experimental results show that our algorithm outperforms the modified Apriori algorithm by an order of magnitude. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Data mining
Closed flexible pattern
Time-series database
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
