最小频繁闭树的增量式更新算法  

Incremental Updating Algorithm for Least Frequent Closed Tree

作　　者：郭鑫[1] 黄云[1] 刘介丹 周清平[1] 

机构地区：[1]吉首大学信息管理与工程学院,湖南张家界427000 [2]北京市海淀区用友软件园,北京100094

出　　处：《计算机工程》2010年第21期73-75,共3页Computer Engineering

基　　金：湖南省大学生研究性学习和创新性实验计划基金资助项目(JSU-CX-2009-26);湖南省教育厅基金资助项目(06C658)

摘　　要：针对树挖掘算法产生大量频繁子树和树数据库随时间变化的问题,提出最小频繁闭树增量式更新算法以及增量式更新策略,能充分利用已有挖掘知识,无须重新运行树挖掘算法,并且只需进行一次数据库扫描操作。给出一种候选子树剪枝方法,能减少树同构判别次数,有效提高算法的运行效率。通过大量实验结果表明,该算法有效可行且效率较高。Tree mining algorithm always produces a lot of problems such as frequent subtrees and tree database changing over time. This paper proposes least frequent closed tree mining algorithm and incremental updating algorithm for frequent subtrees. It proposes incremental strategy, makes full use of exists data, without re-running tree mining algorithm during update mining, and needs scaning database only once. It proposes tree pruning method, which can lessen the time of distinguishing isomorphism, and improve the efficiency of algorithm working. The final adoption of a large number of experiments shows that incremental updating algorithm proposed in this paper is effective and feasible.

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

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