An efficient frequent itemsets finding in distributed datasets with minimum communication overhead

Abstrak

Finding frequent itemsets is an essential researched technique and a challenging task of data mining. Traditional approaches for distributed frequent itemsets require massive communication overhead among different distributed datasets. In this paper, we adopt a new strategy for optimizing the time of communications/synchronizations from large datasets and, we present a novel algorithm for discovering frequent itemsets in different distributed datasets on the slave sites called finding efficient distributed frequent itemsets (FEDFI). The proposed algorithm is capable of generating the important frequent itemsets by applying an efficient technique for pruning the candidate itemsets. The experimental results confirm that our algorithm FEDFI performs better than Apriori and candidate distribution (CD) algorithms in terms of communication and computation costs.