一种新的频繁子树增量式更新方法  

Novel incremental updating algorithm for frequent subtrees

作　　者：郭鑫[1] 黄云[1] 颜一鸣[1] 周清平[1] 

机构地区：[1]吉首大学信息管理与工程学院,湖南张家界427000

出　　处：《计算机应用》2010年第5期1300-1303,共4页journal of Computer Applications

基　　金：湖南省教育厅资助项目(06C658)

摘　　要：讨论频繁子树增量式更新问题,提出一种新的频繁子树增量式更新算法。提出有效树集概念和增量式更新策略,在更新挖掘时,无须重新运行子树挖掘程序,能充分利用已有的挖掘结果,算法只需要进行一次数据库遍历操作。提出候选子树剪枝策略,在更新挖掘过程中,能大幅减少子树同构次数,有效地提高了算法的运行效率。通过大量实验分析表明,算法有效可行且具有较高的运行效率。The incremental update for frequent subtrees was discussed and a novel incremental updating algorithm for frequent subtrees was proposed.The concept of effective tree collection and incremental strategy were put forward,which did not need re-run tree mining algorithm during update mining and could make full use of the existing data,and need scan database only once.Subtree pruning strategy was put forward to reduce the number of subtrees distinguishing isomorphism during update mining,which improved the operational efficiency of the algorithm.The experimental results show that the proposed algorithm is effective and feasible and has significant operation efficiency.

关 键 词：数据挖掘 有序树 频繁子树 子树同构 增量更新 

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