A Survey Paper on Efficient FP-growth Tree for Large Data Set |
Author(s): |
Asha Patel , SAL Institute Of Technology And Engineering research |
Keywords: |
Association rules; FP-tree; Frequent Pattern Tree; Modified header table; Frequent Item Set |
Abstract |
FP-growth method is a efficient algorithm to mine frequent patterns, in spite of long or short frequent patterns. If we use compact tree structure, divide-and-conquer searching method and partitioning-based, it reduces the searching costs gradually. But just as the analysis in Algorithm, in the process of FP-tree construction, it is a strict serial computing process. That is, the algorithm performance is related to the database size, the sum of frequent patterns in the database: ω. this is a serious bottleneck. Some People may think multi-CPU multi-CPU or using distributed parallel computation technique to solve this type of problem. But these methods apparently increase the costs for exchanging and combining control information, and the algorithm complexity is also greatly increased, that cannot solve this problem efficiently. Even if we adopt multi-CPU technique, that raising the requirement of hardware, the performance improvement is still limited. |
Other Details |
Paper ID: IJSRDV4I50518 Published in: Volume : 4, Issue : 5 Publication Date: 01/08/2016 Page(s): 1586-1588 |
Article Preview |
|
|