A fast and resource efficient mining algorithm for discovering frequent patterns in distributed computing environments
The algorithm is parameter-less and able to determine the appropriate number of computing nodes automatically. The algorithm requires only 54.3% execution time of PSWS when using 20 nodes. The algorithm achieves better load balancing as compared with existing methods. The nodes do not need to exchange any transactions or sub databases with each other.
data mining frequent pattern mining distributed mining parallel mining