负关联规则增量更新算法  

Incremental Update Algorithm for Negative Association Rules

作　　者：孙宝友[1] 姜合[1] 赵园园[1] 

机构地区：[1]山东轻工业学院信息科学与技术学院,济南250353

出　　处：《计算机工程》2009年第13期69-71,共3页Computer Engineering

基　　金：山东省自然科学基金资助项目(Y2008G26)

摘　　要：讨论负关联规则的更新问题。与正关联规则增量更新不同,负关联规则不仅存在于频繁项集中,更多存在于非频繁项集中。针对该问题提出一种负关联规则增量更新算法NIUA,利用改进的Apriori算法以及集合的性质挖掘出频繁、非频繁项集和负关联规则。实验结果表明,该算法是可取的。This paper discusses the incremental update for negative association rules. The incremental update for negative association rules and the positive association rules is different. That is the negative association rules not only exist in the frequent itemsets, but more exist in the infrequent itemsets. This paper proposes an incremental update for the negative association rules algorithm, NIUA. The algorithm uses the improved Apriori algorithm and the set nature to mine the frequent and infrequent itemsets and mines the negative association rules by algorithms. Experimental result show that the algorithm is retrievable.

关 键 词：负关联规则 增量更新 非频繁项集 NIUA算法 改进的Apriori算法 

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