最大可删除项集快速挖掘算法  

A Fast Algorithm for Mining Maximal Erasable Itemsets

作　　者：赵群礼 郭玉堂 ZHAO Qunli;GUO Yutang(School of Computer Science,Hefei Normal University,Hefei 230601,China)

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

出　　处：《宿州学院学报》2021年第3期15-20,共6页Journal of Suzhou University

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

摘　　要：提出了一种挖掘最大可删除项集的快速算法MMEIA,充分利用可删除项目的产品集之间的包含关系,并结合搜索过程中的剪枝策略,有效减少了挖掘过程中产生的候选项集的数量和计算量,提高了挖掘效率。实验结果表明,文中提出的算法优于已有的算法,能够有效解决最大可删除项集挖掘问题。A fast algorithm MMEIA is proposed to mine the maximal erasable itemsets.The algorithm makes full use of the inclusion relationship between the product sets of the erasable itemsets,and combines with the pruning strategy in the search process,which effectively reduces the number of candidate itemsets produced in the mining process and the calculation amount,and improves the mining efficiency.Experiments show that the algorithm is better than the existing one,and can effectively solve the problem of mining the maximum erasable itemsets.

关 键 词：最大可删除项集 可删除项集 数据挖掘 产品集 

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