.png){kind=icon}
返回
Scalable parallel data mining for association rules
.png){kind=icon}
PRE
AI
DOI：10.1109/69.846289.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose two new parallel formulations of the Apriori algorithm that is used for computing association rules. These new formulations, IDD and HD, address the shortcomings of two previously proposed parallel formulations CD and DD. Unlike the CD algorithm, the IDD algorithm partitions the candidate set intelligently among processors to efficiently parallelize the step of building the hash tree. The IDD algorithm also eliminates the redundant work inherent in DD, and requires substantially smaller communication overhead than DD. But IDD suffers from the added cost due to communication of transactions among processors. HD is a hybrid algorithm that combines the advantages of Co and DD. Experimental results on a 128-processor Gray T3E show that HD scales just as well as the CD algorithm with respect to the number of transactions, and scales as well as IDD with respect to increasing candidate set size.
Keyword:
data mining
parallel processing
association rules
load balance
scalability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Semi-analytic contact technique in a non-linear parametric model order reduction method for gear simulations.png)
Meccanica
MeccanicaIF0
PREAI
分享收藏The role of task repetition and learner self-assessment in technology-mediated task performance
PREAI
分享收藏 没有更多内容
没有更多内容