电子学报Issue(8)：1545-1554,10.DOI:10.3969/j.issn.0372-2112.2015.08.012
基于项权值变化的完全加权正负关联规则挖掘
AII-Weighted Positive and Negative Association RuIes Mining Based on Dynamic Item Weight
摘要
Abstract
This paper proposes a mining algorithm of all-weighted positive and negative association rules based on dynamic item weight,which can solve the problems of negative patterns mining based on dynamic item weight.This algorithm took the dy-namic item weight dependent on transaction records into consideration,and adopted the itemset pruning method and pattern evalua-tion framework so as to discover effective all-weighted positive &negative association rules via simple calculation and comparison of weight ratio and dimension ratio from the itemset.The experimental results show that this algorithm can prevent ineffective patterns, which makes the maximal declines of the mining time and number of the candidate itemsets by up to 94.09% and 88.16% respec-tively compared with the existing unweighted positive and negative association rule mining algorithms.关键词
数据挖掘/完全加权关联规则/负关联规则/频繁项集Key words
data mining/all-weighted association rule/negative association rule/frequent itemset分类
信息技术与安全科学引用本文复制引用
周秀梅,黄名选..基于项权值变化的完全加权正负关联规则挖掘[J].电子学报,2015,(8):1545-1554,10.基金项目
国家自然科学基金（No．61262028，No．61363037）；广西自然科学基金（No．2012GXNSFAA053235）；广西财经学院数量经济学创新团队项目 （）
