A New Web Log Mining Algorithm without Redundancy
Yao Yao · Intelligent Computer and Applications · 2012
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.