多最小支持度的加权关联规则挖掘算法  

Algorithm of mining weighted association rules with multiple minimum supports

作　　者：李彦伟[1] 戴月明[1] 王金鑫[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与设计》2011年第3期955-957,962,共4页Computer Engineering and Design

摘　　要：针对数据集中交易记录和数据项的重要性不同问题,提出了一种多最小支持度的加权关联规则挖掘算法,允许用户设定多个最小支持度,给出交易记录不同的权重,从而发现有价值的关联规则。该算法按项目的最小支持度升序对交易记录进行分类,按类别依次求出每一类别内的加权频繁集。在挖掘过程中由于剔除了冗余项目并对相同项集累加计数,且不需多次重复扫描数据库,从而提高了挖掘效率。实验结果表明,新算法能有效地从数据集中挖掘出加权关联规则。Algorithm of mining weighted association rules with multiple minimum supports is proposed to solve the problems that the transactions and data items have not the same importance in datasets.The algorithm allows user to specify multiple minimum supports and give the weights of the transactions to find the useful association rules.The transactions are classified as the items’ minimum support ascending order in the algorithm,and the weighted frequent itemsets in every classification are solved successively.The redundant items are deleted and the same itemsets are cumulated during the mining,and the new algorithm neednt ’scan the database many times repeatedly,so the efficiency of the mining is improved.The experiment shows that the algorithm is efficient in mining the weighted association rules from transaction dataset.

关 键 词：数据挖掘 多最小支持度 垂直权值 加权关联规则 加权频繁项集 

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