摘要
匹配是网格服务动态发现和集成的关键问题。针对"网格服务发现"对服务低层数据抽象和分类不足的问题,该文给出了一种基于语义的模糊匹配网格服务发现框架算法。仿真实验结果表明,该算法提高了服务发现的查全率和查准率。
Matching is considered as one of the crucial factors to ensure dynamic discovery and composition of grid services. Current matching methods are inadequate given their inability to abstract and classify the underlying data of grid services. This paper proposes a semantic grid services discovery arithmetic which exploits FMD in order to abstract and classify the underlying data of grid services. Experimental results show FMD has more precision ratio and recall ratio.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第18期178-180,183,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60573127)
关键词
网格服务
匹配相似度
查全率
grid services
degree of matching
precision ratio
