• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ICCCI 2010;International conference on computer and computational intelligence >An Improved Algorithm Based on Suffix Projection in Sequential Pattern Mining
【24h】

An Improved Algorithm Based on Suffix Projection in Sequential Pattern Mining

机译：序列模式挖掘中基于后缀投影的改进算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

On mining sequential patterns, divide-andconquer method is adopted in PrefixSpan. But the emergence of numerous projections database effects the performance, so we give an improved algorithm called SuffixJoin. The main idea is based on the established 1-sequence projection database, and the suffix item is selected from candidate database. The join operations are executed to mine the frequent sequence. This method reduces the time spending in scanning projections repeatedly and improves the mining efficiency. And the experimental results show that the performance is well improved under the condition of the sequences without of item sets and with large sequence.
机译：对于挖掘顺序模式，PrefixSpan中采用了分而治之的方法。但是大量投影数据库的出现影响了性能，因此我们给出了一种称为SuffixJoin的改进算法。主要思想是基于已建立的1序列投影数据库，后缀项是从候选数据库中选择的。执行联接操作以挖掘频繁序列。该方法减少了重复扫描投影的时间，提高了挖掘效率。实验结果表明，在无项目集，有大序列的序列条件下，性能得到了很好的改善。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号