High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Survey Performance Improvement Construct FP-Growth Tree


Asha D. Patel , SAGAR Institute of Research and Technology, Bhopal; Yogadhar Pandey, SAGAR Institute of Research and Technology, Bhopal


FP-tree ensures, frequent-pattern growth, Parallel projection, Partition projection.


Construction of a compact FP-tree ensures that subsequent mining can be performed with a rather compact data structure. This does not automatically guarantee that it will be highly efficient since one may still encounter the combinatorial problem of candidate generation if one simply uses this FP-tree to generate and check all the candidate patterns. we study how to explore the compact information stored in an FP-tree, develop the principles of frequent-pattern growth by examination of our running example, explore how to perform further optimization when there exit a single prefix path in an FP-tree, and propose a frequent- pattern growth algorithm, FP-growth, for mining the complete set of frequent patterns using FP-tree.

Other Details

Paper ID: IJSRDV1I5012
Published in: Volume : 1, Issue : 5
Publication Date: 01/08/2013
Page(s): 1086-1087

Article Preview

Download Article