Effect of Candidate Hashing and Transaction Trimming in Distributed Mining of Association Rules

Association rules mining is one of the most popular data mining tasks which has wide application areas and is redefined in distributed environment. Computation and communication are two important factors in distributed association rules mining. In this paper two techniques have been exploited to reduce communication and improve the running time in a distributed environment. These techniques were proposed previously for centralized setting and here they are adopted in the FDM algorithm as one of the well-known distributed association rules mining algorithm. The proposed algorithm uses Trie data structure for better performance. Experimental evaluations on different sort of distributed data show the effect of using these adopted techniques.

کلیدواژه ها:

Data mining ، Association rule mining ، Distributed ، Hash Filtering ، FDM