改进的PrefixSpan算法在Web挖掘中的应用

针对PrefixSpan算法不足，本文采用修改Prefix策略与舍弃非频繁项的方法，减少内存与外存之间频繁地交换，减小在挖掘过程中产生的投影数据库规模，降低构建、扫描投影数据库的时空耗费，从而改进算法。实验结果表明，在长序列模式挖掘中，算法在改进后运行效率比原来提高35％以上，更适用于Web挖掘。

Application of Improved PrefixSpan Algorithm in Web Mining

Taking account of insufficiency of PrefixSpan algorithm, which is widely applied to data mining, this paper trys to optimize the algorithm by reducing frequency of exchanging between the memory and the external memory in the Prefix part, and reducing the size of the projection database by discarding the non-frequent items which created in the process of sequence patterns mining. The result of test demonstrates that the operating efficiency is enhanced more than 35%. The conclusion comes to shows that the improved algorithm is applicable to the Web Mining.