一种新的加权关联规则算法

A New Algorithm of Weighted Association Rule

为了解决MINWAL(O)算法存在的重复扫描数据库、挖掘出的加权频繁项集可能包含多个权值较低的项目等问题,提出一种新的加权关联规则算法.该算法定义了新的加权关联规则模型,提出最小支持期望的概念用于候选项集的修剪,挖掘出感兴趣的加权频繁项集.测试结果证明该算法有较高的时间效率.

This study is to address the problems in MINWAL （0 ） which include repeated scanning and the multiple low weight items contained in weighted frequent item sets. We pro- pose a new algorithm of weighted association rule, which defines a model of weighted associa- tion rule. The concept of k - support minimum value of item sets is set forth for candidate item sets pruning and the interesting weighted frequent item sets are mined. The test results indicate that the algorithm is highly efficient.