基于网格服务的GEP分布式函数挖掘算法  

Distributed Function Mining for GEP on Grid Services

作　　者：邓松[1] 王汝传[1,2] 任勋益[1] 

机构地区：[1]南京邮电大学计算机学院,南京210003 [2]南京大学计算机软件新技术国家重点实验室,南京210093

出　　处：《计算机科学》2009年第11期177-181,共5页Computer Science

基　　金：国家自然科学基金(60573141和60773041);江苏省自然科学基金(BK2008451);国家高科技863项目(2006AA01Z201;2007AA01Z404;2007AA01Z478);现代通信国家重点实验室基金(9140C1105040805);江苏省高校自然科学研究计划(07KJB520083);江苏省博士后基金(0801019C);江苏高校科技创新计划项目(CX08B-085Z;CX08B-086Z)资助

摘　　要：提出了一种基于网格服务的GEP分布式函数挖掘算法(DFMGEP-GS),它将网格服务与GEP算法相结合,既成功地实现了在网格平台下的GEP函数挖掘,又提高了每个网格节点上GEP算法的全局寻优性;同时证明了在网格环境下由局部数据模型生成全局数据模型的方法。仿真实验结果表明,对于函数类型已知的数据,随着数据集的增大,在成功挖掘到目标函数的情况下,DFMGEP-GS算法的平均耗时最少,而且随着网格节点的增加,DFMGEP-GS的收敛速度最大提高了约17倍;对于函数类型未知的复杂数据集,DFMGEP-GS算法挖掘所得到的模型的误差最小。This paper presented distributed function mining for GEP on grid services（DFMGEP-GS）, which combined grid services and GEP algorithm to realize not only function finding for GEP on grid platform successfully,improve but also global optimization of GEP algorithm with every grid node, Meanwhile, it proved the method by which global data model is obtained by means of local data model on grid. By simulation experiment, it is showed that for data with known function type, and with the augmentation of datasets, average consumptive time of DFMGEP-GS is less than other three algorithms under the condition of mining target function successfully, and that with the increment of grid nodes, the convergent speed of DFMGEP-GS is improved about 17 times maximally. For very complex data with unknown function type, the error which is mined by DFMGEP-GS algorithm is minimum.

关 键 词：基因表达式编程 分布式挖掘 网格服务 函数挖掘 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]