基于访问路径树的Web频繁访问路径挖掘算法研究

Research on Algorithm of Frequent Web Access Path Mining Based on Access Path Tree

频繁访问路径发现是Web数据挖掘的重要研究内容。提出了一种挖掘连续频繁访问路径的高效算法:PS2算法,该算法利用访问路径树挖掘频繁扩展子路径,只需一次数据库扫描,试验表明该算法在效率上优于类Apriori的算法。

The frequent access paths discovery is an important task of Web mining study. Proposes a new efficient algorithm for mining consecutive frequent Web access path, the algorithm use access path tree to find frequent Web access path and need database scanning only once. The experiment shows that the algorithm is better than other algorithms which is based on Apriori algorithm.