计算机工程与应用2011，Vol.47Issue(14)：149-151,173,4.DOI:10.3778/j.issn.1002-8331.2011.14.043
并行的关联规则增量式更新优化算法研究
Research on optimization of parallel incremental updating algorithm for association rules.
摘要
Abstract
Pruning and Fast Updating algorithm(PFUP) always overloads the processor and decreases executing efficiency. An improved Parallel,Pruning and Fast Updating(PPFUP) algorithm is presented to solve these problems of PFUP. PPFUP algorithm based on shared-nothing workstations,partitions the locally-large itemsets and assigns them to different workstations,and synchronizes the tasks of computing on two databases to reduce the stress of memory. Simulation shows that the execution time of PPFUP algorithm reduces to 11％ compared with PFUP algorithm in the case of the same database and low support threshold.关键词
关联规则/基于并行计算快速更新(PPFUP)算法/并行计算/快速剪枝更新(PFUP)算法Key words
association rule/Parallel and Pruning and Fast Updating(PPFUP) algorithm/parallel computation/Pruning and Fast Updating(PFUP) algorithm分类
信息技术与安全科学引用本文复制引用
陈秋阳,金连甫..并行的关联规则增量式更新优化算法研究[J].计算机工程与应用,2011,47(14):149-151,173,4.
