摘要
首先介绍了由ChristianHidber提出的在线挖掘关联规则算法Carma,然后提出了对该算法的若干改进.减弱了原算法第一步中当前交易的子集v被插入集合V的条件,同时改进了maxMissed的计算公式,使其计算更为简单.实验表明。
This paper first introduces the online association rule mining algorithm named Carma presented by Christian Hidber,and then proposes some improvements of this algorithm.We weaken the condition of inserting a subset v of cur-rent transaction in lattice of potentially large itemsets V.We modify the expression of maxMissed to make the calculation more simple.Experiments showthe improvements speed up the algorithm.
出处
《韶关学院学报》
2004年第3期51-55,共5页
Journal of Shaoguan University