%0 Journal Article
%T Algorithm of mining frequent access paths from Web-Logs<br>Web-Logs中连续频繁访问路径的快速挖掘算法
%A CAO Zhong-sheng
%A TANG Shu-guang
%A YANG Liang-cong
%A <br>曹忠升
%A 唐曙光
%A 杨良聪
%J 计算机应用
%D 2006
%I 
%X 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. Exoeriments indicate that the OB-Mine algorithm is better than WAP algorithm.
%K frequent access path
%K continuous frequent access path
%K WAP-Tree<br>频繁访问路径
%K 连续频繁访问路径
%K 访问路径树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=E9965E62BA1FF329&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=CA4FD0336C81A37A&sid=CEC789B3C68C3BB3&eid=0C8048FCD078FD6D&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=5