摘要
提出了一种基于堆栈的频繁闭项集挖掘算法SBFCI(StackBasedFrequentClosedItemsetsGeneration),该算法采用栈技术避免了以往基于FP-tree的算法需对每个后缀模式递归构造FP-tree,并在上挖掘的弊端。从而大幅缩减了生成频繁闭项集的时间与空间开销。
A stack-based algorithm for mining frequent closed itemsets, called SBFCI, is proposed. In this algorithm, the slack technique is used to avoid generating suffix pattern FP-free recursively, which is usually adopted by former algorithm. The spending of time and space is saved dramaiically in this algorithm.
出处
《计算机与数字工程》
2005年第9期52-56,共5页
Computer & Digital Engineering
关键词
数据挖掘
关联规则
频繁闭项集
data mining, association rule, frequent closed itemsets
