Paper Title:
Mining of Global Maximum Frequent Itemsets Based on FP-Tree
  Abstract

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
$32.00
Share

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

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

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765