Have a personal or library account? Click to login
The Mining Algorithm of Frequent Itemsets based on Mapreduce and FP-tree Cover

The Mining Algorithm of Frequent Itemsets based on Mapreduce and FP-tree

By: Bo He,  Jianhui Pei and  Hongyuan Zhang  
Open Access
|Apr 2018

Abstract

The date mining based on big data was a very important field. In order to improve the mining efficiency, the mining algorithm of frequent itemsets based on mapreduce and FP-tree was proposed, namely, MAFIM algorithm. Firstly, the data were distributed by mapreduce. Secondly, local frequent itemsets were computed by FP-tree. Thirdly, the mining results were combined by the center node. Finally, global frequent itemsets were got by mapreduce and the search strategy. Theoretical analysis and experimental results suggest that MAFIM algorithm is fast and effective.

Language: English
Page range: 68 - 71
Published on: Apr 11, 2018
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2018 Bo He, Jianhui Pei, Hongyuan Zhang, published by Xi’an Technological University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.