A distributed frequent itemset mining algorithm based on Spark
暂无分享,去创建一个
Fei Li | Weiming Shen | Min Liu | Feng Gui | Yunlong Ma | Feng Zhang | Hua Bai | Weiming Shen | Min Liu | Yunlong Ma | Feng Zhang | Feng Gui | Fei Li | Huanchen Bai
[1] Yongge Shi,et al. An Improved Apriori Algorithm , 2010, 2010 IEEE International Conference on Granular Computing.
[2] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[3] Xun Yi,et al. Distributed Association Rule Mining with Minimum Communication Overhead , 2009, AusDM.
[4] Michael J. Franklin,et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.
[5] Matei A. Zaharia,et al. An Architecture for and Fast and General Data Processing on Large Clusters , 2016 .
[6] Edward Y. Chang,et al. Pfp: parallel fp-growth for query recommendation , 2008, RecSys '08.
[7] Srinivasan Parthasarathy,et al. Mining frequent itemsets in distributed and dynamic databases , 2003, Third IEEE International Conference on Data Mining.
[8] Ming-Yen Lin,et al. Apriori-based frequent itemset mining algorithms on MapReduce , 2012, ICUIMC.
[9] Zhenyu Liu,et al. Efficiently Using Matrix in Mining Maximum Frequent Itemset , 2010, WKDD.