A high-performance distributed algorithm for mining association rules

作     者：Schuster, A Wolff, R Trock, D 

作者机构：Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel 

出 版 物：《KNOWLEDGE AND INFORMATION SYSTEMS》 (知识和信息系统季刊)

年 卷 期：2005年第7卷第4期

页      面：458-475页

核心收录：

学科分类：0711[理学-系统科学] 07[理学] 08[工学] 070105[理学-运筹学与控制论] 081101[工学-控制理论与控制工程] 0701[理学-数学] 071101[理学-系统理论] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：UK Research and Innovation  UKRI  (104623) 

主　　题：association rule data mining distributed data mining high-performance computing 

摘      要：We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the first D-ARM algorithm to perform a single scan over the database. As such, its performance is unmatched by any previous algorithm. Scale-up experiments over standard synthetic benchmarks demonstrate stable run time regardless of the number of computers. Theoretical analysis reveals a tighter bound on error probability than the one shown in the corresponding sequential algorithm. As a result of this tighter bound and by utilizing the combined memory of several computers, the algorithm generates far fewer candidates than comparable sequential algorithms-the same order of magnitude as the optimum.