Fast Distributed Algorithm of Mining Global Frequent Itemsets

Bo He

doi:10.4028/www.scientific.net/AMR.219-220.191

Paper Titles

The Diversification Performance Evaluation of Listed Electric Power Corporations Based on DEA Model
p.174

The Implementation of Lunar Rover’s Trajectory Tracking Control of Based on Trigonometric Spline Wavelet
p.179

Personalized Web Data Mining System
p.183

Study on Intermittent Target Tracking in Fire-Control Radar Network
p.187

Fast Distributed Algorithm of Mining Global Frequent Itemsets
p.191

The Effect of Aging Heat Treatment on the Sliding Wear Behavior of Cu-Al-Fe-(x) Alloys
p.195

Constructing Domain Ontology of E-Business Based on Rough Concept Lattices
p.202

Diagnosis and Reconstruction on Institutional Culture of State-Owned Forestry Enterprises
p.206

Combining Grey Relation Analysis and TOPSIS for Evaluating the Survivability of Networked Information System
p.210

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 219-220Fast Distributed Algorithm of Mining Global...

Fast Distributed Algorithm of Mining Global Frequent Itemsets

Abstract:

Most distributed algorithms of mining global frequent itemsets worked on net structure network and adopted Apriori-like algorithm. Whereas there were some problems in these algorithms: a lot of candidate itemsets and heavy communication traffic. Aiming at these problems, this paper proposed a fast distributed algorithm of mining global frequent itemsets, namely, FDMGFI algorithm, which set centre node. FDMGFI algorithm made computer nodes compute local frequent itemsets independently with FP-growth algorithm, then the centre node exchanged data with other computer nodes and combined, finally, global frequent itemsets were gained. FDMGFI algorithm required far less communication traffic by the searching strategies of top-down and bottom-up. Theoretical analysis and experimental results suggest that FDMGFI algorithm is fast and effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Pages:

191-194

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.219-220.191

Citation:

Cite this paper

Online since:

March 2011

Authors:

Bo He

Keywords:

Data Mining (DM), FP-Tree, Global Frequent Itemset

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Chen ZB, Han H, Wang JX. Data Warehouse and Data Mining[M]. Beijing: Tsinghua University Press, (2009).

Google Scholar

[2] Agrawal, R. Shafer, J.C. Parallel mining of association rules[C]. IEEE Transaction on Knowledge and Data Engineering, 1996, 962-969.

DOI: 10.1109/69.553164

Google Scholar

[3] Cheung, D.W., Han, J.W., Ng, W.T., Tu, Y.J.A fast distributed algorithm for mining association rules[C]. In: Proceedings of IEEE 4th International Conference on Management of Data, Miami Beach, Florida,1996, 31-34.

Google Scholar

[4] Han, J.W., Pei, J., Yin, Y. Mining frequent patterns without Candidate Generation[C]. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, Dallas, Texas, United States,2000,1-12.

DOI: 10.1145/342009.335372

Google Scholar

[5] Bo H, Yue W, Yang W and Yuan C. Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database [C]. Rough Sets and Knowledge Technology, Chongqing, 2006, 415-420.

DOI: 10.1007/11795131_60

Google Scholar