一种网络日志挖掘的高效算法

An Efficient Algorithm with Incremental Data Mining for Web Usage Mining

提出了一种网络日志挖掘算法PWU,其采用了异构树结构。通过对异构树叶子节点进行编号,使得对候选集计数时只需对具有相同编号的叶子节点进行计数,极大地简化了候选集计数过程。在此基础上,算法还具有增量挖掘功能。最后,从理论分析和实验两方面证明了算法的高效性以及增量挖掘功能的高效性和完备性。

Mining server access data can provide significant and useful information. This paper presents an algorithm called PWU,which adopts the data structure named Heterogeneity. The data structure uses a set of rules to number the branches of the Heterogeneity Tree. The rules simplify the process of counting the support of candidates. Finally ,the completeness of the mined set and efficiency of the algorithm PWU are proved both in theory and experiment.