As far as we know, a little research of global maximum frequent itemsets had been done. Therefore, a fast mining algorithm of global maximum frequent itemsets was proposed, namely, FMAGMFI algorithm. Firstly, each computer nodes compute local maximum frequent itemsets with DMFIA algorithm and local FP-tree. Secondly, the center node combined local maximum frequent itemsets. Finally, global maximum frequent itemsets were gained by the searching strategy of top-bottom. Adopting FP-tree structure, FMAGMFI algorithm greatly reduces runtime compared with Apriori-like algorithms. Theoretical analysis and experimental results suggest that FMAGMFI algorithm is efficient.
Fast Mining Algorithm of Global Maximum Frequent Itemsets
Adv.Intel.,Soft Computing
2012-01-01
6 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Double-layer bayesian classifier ensembles based on frequent itemsets
British Library Online Contents | 2012
|Building the Data Warehouse of Frequent Itemsets in the DWFIST Approach
British Library Conference Proceedings | 2005
|Vehicle frequent track mining method and system based on prefixspan algorithm
Europäisches Patentamt | 2020
|