Home > Papers

 
 
HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm
CHEN Xiaoyun,HE Yanshan *,CHEN Pengfei,MIAO Shengfa,YUE Min,SONG Weiguo
School of Information Science and Engineering,Lanzhou University
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online: 8 April 2009
Accepted by: none
Citation: CHEN Xiaoyun,HE Yanshan,CHEN Pengfei.HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm[OL]. [ 8 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31153
 
 
Frequent itemset mining is a fundamental and essential issue in data mining field and can be used in many data mining tasks. Most of these mining tasks require multiple passes over the database and if the database size is large, which is usually the case, scalable high performance solutions involving multiple processors are required. In this paper, we present a novel parallel frequent itemset mining algorithm which is called HPFP-Miner. The proposed algorithm is based on FP-Growth and introduces little communication overheads by efficiently partitioning the list of frequent elements list over processors. The results of experiment show that HPFP-Miner has good scalability and performance.
Keywords:frequent itemset;parallel;FP_Growth;HPFP-Miner
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 461
Bookmarked 0
Recommend 5
Comments Array
Submit your papers