Web日志挖掘中GITC算法的改进  

Improvement of GITC Algorithm on Web Log Mining

作　　者：郭维[1] 

机构地区：[1]安徽理工大学计算机科学与技术系,淮南232001

出　　处：《计算机工程》2008年第4期60-62,共3页Computer Engineering

摘　　要：GITC算法和Tree-DM算法都是基于交集关系的挖掘算法。文章分析这2个算法的性能特点,提出一种GITC算法的改进算法:GI算法。该算法利用适当的数据结构来保存支持数信息,省去了扫描原数据库来统计支持数耗费的大量时间,并解决了Tree-DM算法在二次求交、冗余求交等方面存在的问题。经过实验验证,较GITC算法而言,GI算法可以更高效地挖掘用户频繁访问模式。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.

关 键 词：WEB日志挖掘 频繁访问模式 交集关系 

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