首页> 外文会议>International conference on material and manufacturing technology >An Efficient Algorithm for Sequential Pattern Mining With Time Constraints
【24h】

An Efficient Algorithm for Sequential Pattern Mining With Time Constraints

机译:有时间约束的序列模式挖掘的高效算法

获取原文

摘要

In this paper, a new algorithm named TCSP is proposed to mine sequential patterns with different time constraints.It scans the database into memory and constructs time-index sets for efficient processing.It mines the desired sequential patterns without generating any candidates.We have evaluated the new algorithm with the well-known GSP algorithm and the DELISP algorithm for various datasets and constraints.The comprehensive experiments show that the TCSP algorithm works better and it has good scalability.
机译:本文提出了一种新的算法TCSP来挖掘具有不同时间约束的序列模式,它将数据库扫描到内存中并构建时间索引集以进行有效处理,从而在不生成任何候选的情况下挖掘所需的序列模式。综合实验表明,TCSP算法工作较好,可扩展性好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号