| 序列模式增量式更新的研究 |
| |
| 引用本文： | 陶再平.序列模式增量式更新的研究[J].计算机工程与设计,2007,28(7):1730-1731,F0003. |
| |
| 作者姓名： | 陶再平 |
| |
| 作者单位： | 浙江金融职业学院,浙江,杭州,310018 |
| |
| 摘 要： | 序列模式挖掘是数据挖掘领域中十分重要的研究课题.目前已有许多算法用于序列模式的挖掘,但在序列模式增量式更新方面的研究还比较少,针对这种情况提出了序列模式增量式更新的挖掘算法SPIU.SPIU算法充分利用了原有的挖掘结果,并对产生的候选频繁序列进行剪枝,有效地减小了候选频繁序列的大小,从而很好地改善了挖掘效率.测试结果表明SPIU算法是正确和高效的,另外算法还具有很好的扩放性.
|
| 关 键 词： | 数据挖掘 序列模式 增量式更新 频繁序列 剪枝 序列模式挖掘 增量式 研究 sequential patterns mining incremental updating 扩放性 测试结果 挖掘效率 改善 大小 剪枝 频繁序列 利用 挖掘算法 情况 比较 课题 数据挖掘 |
| 文章编号： | 1000-7024（2007）07-1730-02 |
| 修稿时间： | 2006-07-06 |
Study of incremental updating for mining sequential patterns |
| |
| TAO Zai-ping.Study of incremental updating for mining sequential patterns[J].Computer Engineering and Design,2007,28(7):1730-1731,F0003. |
| |
| Authors: | TAO Zai-ping |
| |
| Affiliation: | Zhejiang Financial Professional College, Hangzhou 310018, China |
| |
| Abstract: | Sequential pattern mining is an important research topic in data mining. There are many algorithms for efficient discovery of sequential patterns. However, very little work is done on maintenance of discovered patterns. A new algorithm named SPIU is proposed, which make use of the previous mining results and prune to the candidate frequent sequence. The size of candidate frequent sequence is reduced and the mining efficiency is improved effectively. Synthetic data shows that it is efficient, and it has very good scale-up properties. |
| |
| Keywords: | data mining sequential patterns incremental updating frequent sequence prune |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
