基于事务权重与布尔矩阵的Apriori改进算法  

An Improved Apriori Algorithm Based on Item Sets weights and Boolean Matrix

作　　者：曹宋阳 刘磊[1] 王亚刚[1] CAO Song-yang;LIU Lei;WANG Ya-gang(School of Optical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China)

机构地区：[1]上海理工大学光电信息与计算机工程学院,上海200093

出　　处：《软件导刊》2018年第12期65-68,共4页Software Guide

基　　金：国家自然科学基金项目(61074087)

摘　　要：关联规则可在大量数据中找出事务的隐藏联系,其中,Apriori算法是关联规则分析中较为有效的方法。然而,经典Apriori算法需频繁扫描数据库和事务集,使在生成频繁项集的过程中产生大量候选项集。针对该问题,利用事务集对应权重和初始数据库映射形成的布尔矩阵,在经典Apriori算法的基础上,提出一种改进算法。数值算例结果表明,改进后的算法能较为明显地减少计算时间,从而提升经典Apriori算法效率。Association rule mining can find the hidden relationship from a huge number of data,among which the Apriori algorithm is very effective.However,the classical Apriori algorithm needs to scan the database repeatedly,which leads to a large candidate sets when generating the frequent item sets.Aiming at this problem,based on the classical Apriori algorithm,we proposed an improved algorithm via Boolean matrix constructed by the weights of the related item sets and initial mapping of the database.Numerical experiments show that the proposed algorithm is more efficient than the classical Apriori algorithm.

关 键 词：关联规则 APRIORI算法 事务权重 布尔矩阵 

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