MAXSeq:一个新的最大频繁序列挖掘算法

An Algorithm for Mining Maximal Frequent Sequences

最大频繁序列发现是数据挖掘中的一个重要分支.本文提出一种发现最大频繁序列集的算法MAXSeq,该算法通过对潜在的最大频繁序列进行选择性的扩展,直接判断其是否为最大序列,无须对候选最大序列进行维护,从而显著减小了存储开销.同时,优化策略的恰当运用对降低CPU时间起着至关重要的作用.

Discovering the maximal frequent sequence is an important branch in data mining. An new algorithm, named MAXSeq, for mining maximal frequent sequences is proposed. The algorithm uses a new checking scheme, which directly checks whether the current sequence is MAX or not without the candidate maintenance. Thus that consumes less memory than the previous algorithms. Moreover, the times of database scanning and the number of potential maximal sequence are greatly decreased by using the optimization strategy.