A Frequent Itemset Storing Structure

摘要：

Many decision support systems need to support online interactive frequent itemset mining, however, frequent itemset mining is an intensive computation process. This paper proposes an Fp-tree-based structure —BFp-tree to store frequent itemsets. This structure store pre-computed frequent itemsets on a disk to support online mining requests.

关键词： decision support system frequent item mining BFp-tree

作者: Chen Zuyi Zhao Taixiang

作者单位: Department of Foundation, The First Aeronautic Institute of Air Force, Xinyang, China

会议类型: 国际会议

会议名称: 2011 International Conference on Image Analysis and Signal Processing(2011第三届图像分析与信号处理国际会议 IASP 2011)

会议地点: 武汉

会议语种:英文

页码: 680-683

在线出版日期: 2011-10-21（万方平台首次上网日期，不代表论文的发表时间）