The Algorithm of Mining Frequent Patterns Based on Vertical Bitmap

摘要：

By utilizing vertical bitmap diagram map the database of transaction, a new NBFP-Tree structure based on bitmap diagram is raised. As a result we create a new maximal frequent pattern mining algorithm named NBFP-mine. This algorithm does not generate any candidate sets. By depth-first traversing through the NBFP-tree once, we can obtain the maximal frequent item-sets from the NBFP-Tree structure. The efficiency and accuracy of the algorithm are effectively demonstrated both in theory and experiments.

作者: Cheng Lv Chu-yuan Wei

作者单位: Dept. of Computer Science & Technology Beijing Institute of Architecture and Engineering Beijing, 100044

会议类型: 国际会议

会议名称: Fourth International Conference on Impulsive and Hybrid Dynamical Systems(ICIHDS 2007)(第四届国际脉冲和混合动力系统学术会议)

会议地点: 南宁

会议语种:英文

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