Enhancing FP-Growth Performance Using Multi-threading based on Comparative Study

Yousef K. Abu Samra, Ashraf Y. A. Maghari
2015 International Journal of Intelligent Computing Research  
The time required for generating frequent patterns plays an important role in mining association rules, especially when there exist a large number of patterns and/or long patterns. Association rule mining has been focused as a major challenge within the field of data mining in research for over a decade. Although tremendous progress has been made, algorithms still need improvements since databases are growing larger and larger. In this research we present a performance comparison between two
more » ... quent pattern extraction algorithms implemented in Java, they are the Recursive Elimination (RElim) and FP-Growth, these algorithms are used in finding frequent itemsets in the transaction database. We found that FP-growth outperformed RElim in term of execution time. In this context, multithreading is used to enhance the time efficiency of FP-growth algorithm. The results showed that multithreaded FP-growth is more efficient compared to single threaded FP-growth.
doi:10.20533/ijicr.2042.4655.2015.0076 fatcat:qow7zf7bpbazxema7jr6aajvcu