一种Web流频繁模式挖掘算法  

A Web Stream Algorithm for Mining Web Access Patterns

作　　者：郭建奎[1] 黄震华[1] 阮备军[1] 朱扬勇[1] 

机构地区：[1]复旦大学计算机信息与技术系,上海200433

出　　处：《模式识别与人工智能》2007年第6期757-762,共6页Pattern Recognition and Artificial Intelligence

基　　金：国家973计划资助项目(No.2005CB321905)

摘　　要：基于自顶向下的投影挖掘策略,提出一种无需多遍扫描数据库的 Web 访问模式算法 TAM-WAP.其特点是用当前所挖掘数据的特征去驱动一个预测算法,根据预测结果,有选择性地生成中间数据.对多种实际数据和模拟数据的实验表明,本文算法优于传统算法.Discovering interesting web access patterns from web logs is a web usage-mining problem with many practical applications. Some conventional algorithms, such as GSP, HPrefix and WAP-mine have low efficiency on low support thresholds. An algorithm based on the top-down manner is proposed for mining web access pattern. Instead of stubbornly building intermediate data for each step of mining process, it selectively builds intermediate data according to the features of current area. The experimental results on various datasets show that the proposed algorithm has better performance than WAP-mine.

关 键 词：WEB挖掘 WEB使用挖掘 WEB访问模式 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]