One Database Pass Algorithms of Mining Top-k Frequent Closed Itemsets

摘要：

The FP-growth algorithm is a powerful algorithm to mine frequent patterns and it is non-candidate generation algorithm using a special structure FP-tree. Many algorithms proposed recently are based on FP-tree. These algorithms include all frequent itemsets mining, closed frequent itemsets mining and top-k closed frequent itemsets mining. However, it still requires two database scans, Although it is not a problem for static database, it is not efficient for frequent pattern mining, interactive and incremental mining. In order to enhance the efficiency of FP-tree based algorithms, propose a novel algorithm called QFPC which can create FP-tree with one database pass. Also propose a novel algorithm PFPTC to create FP-tree parallelly.

关键词： Data mining Frequent Closed Itemsets Top-k

作者: Yong QIU Yong-Jie LAN

作者单位: School of Computer Sience & Technology Shandong Institute of Business and Technology, YanTai264005, China

会议类型: 国际会议

会议名称: 第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)

会议地点: 南京

会议语种:英文

页码: 828-833

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