摘要
加权关联规则算法存在2个不足:(1)不满足向下封闭性要求,即频繁集的子集未必是频繁集;(2)加权关联规则不能很好地处理不同项目的不同重要性,真正地体现不同项目重要性的不同。针对上述问题,提出一种动态加权关联规则算法,算法根据项目的重要性和最大频繁项目集数量确定项目不同阶段的不同权重,充分体现不同项目的重要性是不同的,从而使算法的向下封闭性得到证明。实验结果表明,该算法具有较高的准确性及效率。
Weighted association rule algorithm for less than two： one does not meet the requirement of closed down,that is a subset of frequent sets may not be frequent sets;another weighted association rules can not handle the different importance of different items,and truly embody the the importance of different items different.In this paper,the dynamic weighted association rules algorithm,algorithm based on the importance of the project and the largest number of frequent itemsets at different stages of the project to determine the different weights,fully reflect the importance of different items are different,and algorithms are proven closed down.Experimental results show that the algorithm improves the high accuracy and efficiency.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第23期79-81,共3页
Computer Engineering
基金
深圳市科技基金资助重点项目(06KJh041)
关键词
动态加权
关联规则
向下封闭性
dynamic weighted
association rule
downward closure
