最大频繁项目序列集的生成是影响关联规则挖掘的关键问题，传统的算法是通过对事务数据库的多次扫描实现的。
Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
该算法考虑了项目集与序列之间的关系，利用时序连接法，采用不同的构造法，构造出相对应的候选集，从而计算出频繁集。
In the algorithm the items and the sequence are discussed respectively, and the time join method is used to introduce the candidate sets, so the frequent sets can be gotten.
应用推荐