基于改进频繁模式树的最大频繁项目集更新挖掘算法  

AN UPDATING ALGORITHM FOR MINING MAXIMAL FREQUENT ITEM SETS BASED ON IMPROVED FREQUENT PATTERN TREE

作　　者：赵群礼 郭玉堂 史君华 ZHAO Qun-Li;GUO Yu-Tang;SHI Jun-Hua(The Department of Computer Science and Technology,Hefei Normal University,Hefei,Anhui 230061,China)

机构地区：[1]合肥师范学院计算机学院,安徽合肥230061

出　　处：《井冈山大学学报（自然科学版）》2018年第4期43-48,64,共7页Journal of Jinggangshan University (Natural Science)

基　　金：国家自然科学基金(61503116);安徽省高校自然科学研究重点项目(KJ2016A585)

摘　　要：在挖掘最大频繁项目集的过程中,通过改变最小支持度阈值可以挖掘更有用的最大频繁项目集,为此提出了一种最大频繁项目集更新挖掘算法UAMMFI(Updating Algorithm for Mining Maximal Frequent Itemsets)。算法基于改进后的频繁模式树结构,在更新挖掘过程中,不需产生候选项目集和条件模式树,并且充分利用先前已挖掘的最大频繁项目集中包含的信息,快速更新挖掘出最小支持度阈值变化后的最大频繁项目集。实验结果表明,算法能够高效更新挖掘最大频繁项目集。In mining the maximal frequent item sets, we can get more useful maximal frequent item sets by changing the minimum support threshold. Furthermore, we proposed a new algorithm UAMMFI（updating algorithm for mining maximal frequent item sets） for mining maximal frequent item sets for the demand. The algorithm didn＇t generate candidate item sets and construct conditional pattern tree based on improved frequent tree. We also make full use of the information contained in maximal frequent item sets previously mined in the process of updating mining maximal frequent item sets. Finally, we can efficient mining new maximal frequent item sets after the minimum support threshold change. Based on experiment results, we can see that the algorithm has excellent performance.

关 键 词：关联规则 最大频繁项目集 改进频繁模式树 最小支持度阈值 

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