GSP与PrefixSpan算法的比较与分析

Comparison and Analysis between Algorithm of GSP and PrefixSpan

针对序列模式挖掘中的两种经典算法GSP算法与PrefixSpan算法执行过程及其特点进行了比较,并对这两种算法的时空执行效率进行了定性分析比较,指出了两种算法各自的适用范围,得出的结果对序列模式挖掘系统的设计有重要的参考价值。

The execution process and features of the two classic algorithms： GSP and PrefixSpan in the sequence model excavation were compared each other. Further more, a qualitative analysis and a comparison of the time and the space excavation efficiency between the two algorithms were done. The application scope of each algorithm was defined. The result gained can be of important value as reference to the design of sequence model mining system.