Aiming at the the inefficiency of traditional frequent itemsets mining algorithm in view of the big data environment
a solution to this problem parallel weighted mining of frequent itemsets using PWFIUT(Parallel Weighted Frequent Itemset Ultrametric Tree) algorithm is implemented on MapReduce framework. Support is counted by mapping the items from the candidate list into the buckets which is divided according to support known as Hash table structure
also to avoid building conditional patterns and to achieve compressed storage. Finally
the Algorithm is verified and analyzed on Hadoop platform. According to the compared experiment results
it shows that the proposed algorithm has high efficiency and good scalability.
关键词
Keywords
references
Tsay Y J, Hsu T J, Yu J R. FIUT: A new method for mining frequent itemsets[J]. Information Sciences, 2009, 179(11):1724-1737. DOI: 1724
Li H, Wang Y, Zhang D. Parallel fp-growth for query recommendation[C]// Proc of ACM Conference on Recommender Systems. Como, Italy, 2008: 107-114.