一种无冗余的Web日志挖掘算法  

A New Web Log Mining Algorithm without Redundancy

作　　者：秦东霞[1] 姚遥[2] 

机构地区：[1]周口师范学院计算机科学与技术学院,河南周口466001 [2]周口师范学院物理与电子工程系,河南周口466001

出　　处：《智能计算机与应用》2012年第1期31-34,共4页Intelligent Computer and Applications

基　　金：周口师范学院青年科研基金资助项目(zknuqn201031A)

摘　　要：Web日志挖掘是Web数据挖掘的一个重要研究领域。Web日志挖掘通过发现Web日志中用户的访问规律和模式,可以提取出其中潜在的规律和信息,人们对这个领域的研究也日益重视。然而,传统的基于关联规则的Web日志挖掘算法都是基于所有关联规则的。这种方式往往挖掘产生大量的候选规则,而且存在大量冗余的规则。提出了一种新的无冗余的Web日志挖掘算法,该算法通过引入频繁闭项集合最小关联规则的概念,从而解决了以往基于所有关联规则挖掘算法中出现的上述问题。Web log mining is one of the important research areas in Web data mining,through which the access law and mode of the user could be found. More attention is also paid to the Web log mining. However, the traditional Web log mining algorithm are all based on all of the association rules. And the traditional way often produces not only large amounts of the candidate frequent itemsets, but also lots of redundant rules. This paper puts forward a new Web log mining algorithm without redundancy,and the concept of frequent closed itemsets and minimal association rules are proposed to solve the problems appeared in mining Web log based on all frequent itemset association rules.

关 键 词：WEB日志挖掘 闭频繁项集 格结构 最小关联规则 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]