Mining of Global Maximum Frequent Itemsets Based on FP-Tree

Abstract:

Article Preview

As far as we know, a little research of mining global maximum frequent itemsets has been done. The paper proposed an algorithm for mining global maximum frequent itemsets based on FP-tree, namely, AMGMFI algorithm. AMGMFI algorithm makes computer nodes computed local maximum frequent itemsets independently with DMFIA algorithm, then other computer nodes exchanged data with the center node, finally, global maximum frequent itemsets were gained. AMGMFI required far less communication traffic by the search strategy of top-down. Theoretical analysis and experimental results suggest that AMGMFI algorithm is effective.

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

342-345

DOI:

10.4028/www.scientific.net/AMR.225-226.342

Citation:

B. He "Mining of Global Maximum Frequent Itemsets Based on FP-Tree", Advanced Materials Research, Vols. 225-226, pp. 342-345, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.