CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

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

عنوان مقاله: Effect of Candidate Hashing and Transaction Trimming in Distributed Mining of Association Rules
شناسه ملی مقاله: IDMC01_053
منتشر شده در اولین کنفرانس داده کاوی ایران در سال 1386
مشخصات نویسندگان مقاله:

Ebrahim Ansari Chelche - Department of computer Science and Engineering, Shiraz University, Shiraz, Iran.
Mohammad Hadi Sadreddini - Department of computer Science and Engineering, Shiraz University, Shiraz, Iran.
Mahmood Deypir - Department of computer Science and Engineering, Shiraz University, Shiraz, Iran.

خلاصه مقاله:
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

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/33030/