Improvement of GITC Algorithm on Web Log Mining
Wei Guo · Jisuanji gongcheng · 2008
The GITC algorithm and the Tree-DM algorithm are both based on the intersection relation.The paper analyzes the performance of both algorithms deeply,and puts forward an improved algorithm named GI.It stores the information of support number in appropriate data structure so as to spare a mass of time of getting the support number of each candidate by scanning the original database.It also solves the problem of getting the intersections repeatedly and redundantly in the Tree-DM algorithm.Experimental results show that the GI algorithm can discover user frequent access patterns more effectively than GITC.