【摘要】 研究了如何从W eb-Logs中高效挖掘出连续频繁访问路径,提出了一种快速有效的OB-M ine算法。该算法借助于访问路径树进行挖掘,只需扫描一次数据库,且通过构建频繁1-项集pi的HBP-树,能一次性挖掘出以pi为后缀的频繁访问路径,简化了挖掘过程,实验表明在执行效率上要优于WAP算法。更多还原

【Abstract】 The frequent access paths discovery is an important task of Web mining study.Focusing on how to discover the continuous frequent access paths form the Web-Logs,an algorithm named Ob-Mine was proposed.The Ob-Mine algorithm needed only one pass scanning over database.By creating the HBP-tree of Frequent Item,the Frequent Access Paths could be got.Experiments indicate that the OB-Mine algorithm is better than WAP algorithm.更多还原