Mining of Global Maximum Frequent Itemsets Based on FP-Tree

Bo He

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

Paper Titles

Experimental Study on Influence of High-Borosilicate Glass Transmittance on Solar Cooling Tube Thermal Performances
p.324

An Improved PSO-GA Employing Crossover Operation for Parameter Optimization of Storm Intensity Formula
p.328

Study on Harmonic Analysis and Error Correction in Synchro to Digital Conversion
p.334

Dynamic Pricing Model of Power Options in a Fractional Market
p.338

Mining of Global Maximum Frequent Itemsets Based on FP-Tree
p.342

Gender Differences in E-Mail Communication
p.346

Particle-Filter Tracking of Motion Vector to Locate Objects and Pattern Matching over Particles Based on Mpeg2
p.350

Study on Remote Distributed Fault Diagnosis System in Modern Agricultural Machinery
p.356

A Brief Study on Successful Reform of English Teaching in China Based on Web
p.360

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 225-226Mining of Global Maximum Frequent Itemsets Based...

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.

You might also be interested in these eBooks

Advanced Research on Automation, Communication, Architectonics and Materials

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Pages:

342-345

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.225-226.342

Citation:

Cite this paper

Online since:

April 2011

Authors:

Bo He

Keywords:

Association Rule, FP-Tree, Global Maximum Frequent Itemsets

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Han J, Kamber M. Data Mining: Concepts and Techniques[M]. Beijing: High Educattion Press, (2001).

Google Scholar

[2] Bayardo RJ. Efficiently mining long patterns form databases[C]. In: Haas LM, Tiwary A, eds. Proc. Of the ACM SIGMOD International Conference on Management of Data. Dallas: ACM Press, 2000. 1~12.

DOI: 10.1145/276304.276313

Google Scholar

[3] Lu SF, Lu ZD. Fast mining maximum frequent itemsets[J]. Journal of software, 2001, 12(2): 293~297(in Chinese with English abstract).

Google Scholar

[4] Song YQ, Zhu ZH, Chen G. An algorithm and its updating algorithm based on FP-tree for mining maximum frequent itemsets[J]. Journal of software, 2003, 14(9): 1586~1592(in Chinese with English abstract).

Google Scholar