@Article{JICS-9-083,
author = {Rahul Moriwal},
title = {FP-growth Tree for large and Dynamic Data Set and Improve Efficiency},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {9},
number = {2},
pages = {083--090},
abstract = {FP-growth method is an efficient algorithm to mine  frequent patterns, in spite of long or short 
frequent  patterns.  By  using  compact  tree  structure  and  partitioning-based,  divide-and-conquer  searching 
method, it reduces the search costs substantially. But just as the analysis in Algorithm, in the process of FP-
tree construction, it is a strict serial computing process. Algorithm performance is related to the database size, 
the  sum  of  frequent  patterns  in  the  database:  ω.  this  is  a  serious  bottleneck.  People  may  think  using 
distributed parallel computation technique or multi-CPU to solve this problem. But these methods apparently 
increase the costs for exchanging and combining control information, and the algorithm complexity is also 
greatly  increased,  cannot  solve  this  problem  efficiently.  Even  if  adopting  multi-CPU  technique,  raising  the 
requirement of hardware, the performance improvement is still limited.  
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22584.html}
}