摘要
提出了一种从Web日志中快速挖掘连续可重复频繁访问路径的新算法ICAP.该算法通过构造以频繁项目p为根的SAP树,能一次挖掘出所有以p为前缀的连续可重复频繁访问路径.最后通过实验验证了算法的正确性和有效性.
A new algorithm ICAP was proposed to mine continuous repeated frequent access paths from Web logs. By constructing SAP tree rooted at frequent item p, all continuous repeated frequent access paths prefixed by p can he got. At last the experiments show its accuracy and efficiency.
出处
《福州大学学报(自然科学版)》
CAS
CSCD
北大核心
2007年第2期180-184,共5页
Journal of Fuzhou University(Natural Science Edition)