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.

关键词： data mining sequential pattern time constraints

作者: Zaiping Tao

作者单位: Information Technology Department of Zhejiang Financial College,Hangzhou,P.R China

会议类型: 国际会议

会议名称: 2011 2nd International Conference on Material and Manufacturing Technology(2011第二届材料与制造技术国际会议 ICMMT2011)

会议地点: 厦门

会议语种:英文

页码: 530-534

在线出版日期: 2011-07-08（万方平台首次上网日期，不代表论文的发表时间）