计算机工程与应用2011，Vol.47Issue(31)：128-131,147,5.DOI:10.3778/j.issn.1002-8331.2011.31.036
一种网格环境下的FP-树分布式构造算法
Distributed constructing algorithm of frequent pattern tree based on grid
摘要
Abstract
For FP-tree constructing and merging based on distributed computing platform,a distributed algorithm of constructing FP-tree(GridDBMA) is presented based on the grid.At first,the global item head table is made,then the local frequent pattern tree(BFP-tree) is constructed independently according to the order of the item head table in each node.The merge-algorithm is used to unite the local frequent pattern trees into a global tree,which can extract the global frequent item sets. Through improving the traditional storage structures of frequent pattern tree, the size of the tree and the communication between nodes are reduced, the traversal of tree is more convenient and effective, and the mining efficiency of frequent item sets is improved.The experiments show the validity and effectiveness of the algorithm by using star spectral data set.关键词
网格/分布式数据挖掘/频繁模式/关联规则/FP-树Key words
grid/distributed data mining/frequent pattern/association rule/FP-tree分类
信息技术与安全科学引用本文复制引用
荀亚玲,吴晓婷,张继福..一种网格环境下的FP-树分布式构造算法[J].计算机工程与应用,2011,47(31):128-131,147,5.基金项目
山西省自然科学基金(the Natural Science Foundation of Shanxi Province of China under Grant No.2010011021-2) （the Natural Science Foundation of Shanxi Province of China under Grant No.2010011021-2）
太原科技大学校青年基金项目(No.20093015). （No.20093015）
