一种基于Fp-tree的压缩存储频繁项集结构

A Fp-Tree Based Structure to Compress Storing Frequent Itemsets

很多决策支持系统需要支持在线的、交互式的频繁项集挖,但是频繁项集挖掘是一个运算量非常庞大的过程。提出一种基于Fp-tree存储频繁项集结构——BFp-tree对频繁项集进行预处理,并将其存储在磁盘上,以支持在线挖掘要求。

Many decision support systems need to support online interactive frequent itemset mining, however, frequent itemset mining is a computation intensive process. Proposes a Fp-tree- based structure, BFp-tree to store frequent itemsets, this structure store precomputed frequent itemsets on a disk to support online mining requests.