A New Algorithm for Mining Frequent Itemset Using Efficient Data Structure

摘要：

　　In this paper,based on analyzing many previous algorithms such as Apriori,DHP,dEclat,Fp-growth,we propose a novel algorithm named Fp-Search to mining the frequent itemset.By using a novel data structure named PE_Graph,the new coding strategy and pruning method,Fp-Search algorithm can be used to efficiently mine all frequent itemset.The experimental results show that Fp-Search algorithm is more efficient than Fp-growth algorithm.

关键词： Data mining Frequent itemsets PE_Graph Fp-Search

作者: Hao JIANG You-Jin LIAO Shi-Meng NI

作者单位: School of Computer Science and Engineering Southeast University Nanjing,Jiangsu Province 210096,China

会议类型: 国内会议

会议名称: 2014年国际计算机科学与软件工程学术会议

会议地点: 杭州

会议语种:英文

页码: 1-6

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