序列模式的一种挖掘算法

序列模式挖掘是数据挖掘中最重要的研究课题之一。基于记录数据库频繁集中各元素CtiD表的基础上，提出了序列模式挖掘的一种算法ISP。该算法考虑了项目集与序列之间的关系，利用时序连接法，采用不同的构造法，构造出相对应的候选集，从而计算出频繁集。由于算法ISP能够利用中间的挖掘结果，故提高了挖掘过程的效率。

Algorithm for Mining Sequential Pattern

Mining sequential pattern is an important topic in the data mining research. In this paper, on the basis of recording the Ctid scheme of the set in every frequent set, the authors propose an algorithm named ISP for mining sequential pattern. 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. The ISP algorithm takes full use of the existing and updated Ctid scheme, therefore the efficiency of the process is increased besides guaranteeing the validity of the algorithm. Comparing with the algorithm named IMSP,more efficient rules are obtained.