Title: Construction of Frequent Tree Based on Linked List Structure
Abstract: FP-Growth algorithm is the most typical and the most commonly used construction algorithms of frequent pattern tree(FP-Tree).This article presents a realization method of FP-Growth algorithm based on linked list structure,in which the node of tree is organized by linked list structure,and the frequent pattern tree is stored by using children-brother data structure.On this basis,the quick search for the common and former nodes in the frequent pattern tree by using indexed table becomes true.Accordingly,the time efficiency of the construction of frequent pattern tree is improved,and the bottleneck of data store in the FP-tree construction algorithm is solved.Finally,through the use of the stellar data and urban soil data as the experimental data,the experiment results show that the method is evidently prior to the construction efficiency of the FP-Growth algorithm based on the sequential structure.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot