一种改进的加权关联规则挖掘算法  

An Improved Mining Algorithm of Weighted Association Rules

作　　者：刘海蓉[1] 闫仁武[1] 

机构地区：[1]江苏科技大学计算机学院,江苏镇江212000

出　　处：《现代电子技术》2011年第12期51-54,共4页Modern Electronics Technique

摘　　要：基于经典Apriori算法的加权关联规则挖掘算法New-Apriori存在3个问题,需要多次扫描数据库,权值定义不合理和权值的引入导致Apriori基本性质不再成立。为了解决这些问题,采用将矩阵和加权关联规则算法相结合的方法,该改进算法具有只需要扫描一次数据库,权值的定义既考虑到了权重大的项目,也没有忽略频繁出现而权重小的项目,并引入K-项支持期望作为减枝的依据的特点。The weighted association rule mining algorithm-New-Apriori which is based on the classic Apriori algorithm has three problems： the repeat scanning on database is needed,the weight definition is not logical and the basic properties of Apriori no longer come into existence due to the introduction of weight.In order to solve these problems,a method that combines matrix and weighted association rules is adopted.The feature of this improved algorithm is that the only one scanning on database is needed.The algorithm does not ignore the items which appears with low frequency but high weight value,and what＇s more,K support expectation is introduced as the reference of pruning step.

关 键 词：数据挖掘 APRIORI算法 加权关联规则 频繁项集 

分 类 号：TN919-34[电子电信—通信与信息系统] TP311[电子电信—信息与通信工程]