期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2009
卷号：9
期号：3
页码：247-253
出版社：International Journal of Computer Science and Network Security
摘要：In this paper, we propose a new algorithm which associates weight to each item in the transaction database based on the significance of the corresponding item. Weighted support is calculated using the weight and the frequency of occurrence of the item in the transactions. This weighted support is used to find the frequent itemsets. We partition the database among ��N�� processors and generate closed frequent itemsets in parallel. The parallel algorithm used minimizes communication by exchanging only weighted supports among the processors. We generate closed frequent itemsets to reduce the number of itemsets and also as all frequent itemsets can be obtained from closed frequent itemsets, we are not losing any interesting and significant itemsets. The performance of the proposed algorithm is compared to count distribution algorithm in terms of scaleup, speedup, sizeup and is shown that the proposed algorithm performs better.
关键词：frequent itemsets; support; confidence; association rules
Loading...
