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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Mining Algorithm of Global Maximum Frequent Itemsets


    Additional title:

    Adv.Intel.,Soft Computing


    Contributors:
    Xie, Anne (editor) / Huang, Xiong (editor) / He, Bo (author)


    Publication date :

    2012-01-01


    Size :

    6 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Fast Mining Algorithm for Distributed Global Frequent Itemsets

    Baoli, S. / Zheng, Q. | British Library Online Contents | 2006


    Maximal frequent itemsets mining algorithm based on effective pruning mechanisms

    Peng, C. / Weifeng, L. | British Library Online Contents | 2006


    Online mining frequent closed itemsets over data stream

    Chun, L. / Zheng, Z. / Kaiyuan, C. et al. | British Library Online Contents | 2008


    Double-layer bayesian classifier ensembles based on frequent itemsets

    Yi, W. G. / Duan, J. / Lu, M. Y. | British Library Online Contents | 2012


    Building the Data Warehouse of Frequent Itemsets in the DWFIST Approach

    Monteiro, R. S. / Zimbrao, G. / Schwarz, H. et al. | British Library Conference Proceedings | 2005