全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

FP-Growth的并行加权关联规则挖掘算法

DOI: 10.11830/ISSN.1000-5013.2014.05.0523

Keywords: 关联规则挖掘, 并行加权, FP-Growth算法, MapReduce, 加权频繁项集

Full-Text   Cite this paper   Add to My Lib

Abstract:

基于FP-Growth算法,提出一种并行加权的关联规则挖掘(PWARM)算法,证明其满足加权向下封闭性.使用MapReduce计算模型,在分布式集群中并行挖掘出关联规则.实验结果表明:该算法可以满足数据权重不同的需求,且在处理大数据集时能有效地提高挖掘的效率.

References

[1]  AGRAWAL R,SRIKANT R.Fast algorithms for mining association rules[C]//International Conference on Very Large Data Bases(VLDB 94).San Francisco: Morgan Kaufmann Publishers Inc,1994:487-499.
[2]  HAN Jia-wei,PEI Jian,YIN Yi-wen,et al.Mining frequent patterns without candidate generation[C]//Data Mining and Knowledge Discovery.Hingham M A:Kluwer Academic Publishers,2000:53-87.
[3]  CAI C H,ADA W C F,CHENGTAL C H.Mining association rules with weighted item[C]//Proc of International Symposium on Database.Washington D C:Engineering & Applications,1998:178-186.
[4]  FENG Tao,MURTAGH F,FARID M.Weighted association rule mining using weighted support and significance framework[C]//Proc of 9ths ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.[S.I]:ACM Press,2003:661-666.
[5]  邹力?,张其善.基于多最小支持度的加权关联规则挖掘算法[J].北京航空航天大学学报,2007,33(5):590-593.
[6]  CHEN Wen.Mining algorithm for weighted frequent pattern based on FP-tree[J].Computer Engineering,2012,38(6):24-27.
[7]  PRAMUDIONO I,KITSUREGAWA M.Parallel FP-growth on PC cluster[C]//PAKDD.Heidelberg:Springer-Verlag Berlin,2003:141-144.
[8]  ZAIANE O R,El-HAJJ M,LU P.Fast parallel association rule mining without candidacy generation[C]//ICDM.Washington D C:IEEE Computer Society,2001:21-26.
[9]  ZHOU Le,Balanced parallel FP-Growth with MapReduce information computing and telecommunications[C]//2020 IEEE.New York:ACM Press,2008:243-246.
[10]  LI Hao-yuan,WANG Yi,ZHANG Dong.Chang PFP: Parallel FP-growth for query recommendation[C]//ACM.New York:ACM Press,2008:107-114.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133