一种网格环境下的FP-树分布式构造算法  

Distributed constructing algorithm of frequent pattern tree based on grid

作　　者：荀亚玲[1] 吴晓婷[1] 张继福[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《计算机工程与应用》2011年第31期128-131,147,共5页Computer Engineering and Applications

基　　金：山西省自然科学基金(No.2010011021-2);太原科技大学校青年基金项目(No.20093015)~~

摘　　要：针对分布式环境下FP-tree的构造及合并,给出了一种网格环境下FP-tree的分布式构造算法GridDBMA。该算法中,各站点根据全局项目头表,独立构造局部频繁模式树BFP-tree,然后,利用合并算法将各局部树合并为一棵全局频繁模式树,并在全局频繁模式树上提取出所求的频繁项目集,通过对传统频繁模式树的存储结构的改进,减少了树的规模及站点间的网络通信量,并使树的遍历更加方便有效,提高了合并效率,从而提高了整个频繁项目集的挖掘效率。最后,采用天体光谱数据作为形式背景,实验验证了该算法的正确性和有效性。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 mergealgorithm 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-树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]