可无限分类的Web服务发现匹配算法.pdfVIP

Computer Engineering and Applications 计算机工程与应用 2010 ，46 （27 ） 109 可无限分类的Web 服务发现匹配算法 1 2 2 2 3 胥永康 ，赵友桥 ，龚四平 ，路松峰 ，魏筱毛 1 2 2 2 3 XU Yong-kang ，ZHAO You-qiao ，GONG Si-ping ，LU Song-feng ，WEI Xiao-mao 1.中国工程物理研究院 计算机应用研究所，四川 绵阳 621900 2.华中科技大学 计算机科学与技术学院，武汉 430074 3.恩威制药有限公司，成都 610041 1.Institute of Computer Application Technology ，China Academy of Engineering Physics ，Mianyang ，Sichuan 621900 ，China 2.School of Computer Science and Technology ，Huazhong University of Science and Technology ，Wuhan 430074 ，China 3.Enwei Pharmaceutical Co.Ltd. ，Chengdu 610041 ，China E-mail ：mailxyk@ XU Yong-kang ，ZHAO You-qiao ，GONG Si-ping ，et al.Matching algorithm for semantic Web service discovery based on infinite classification.Computer Engineering and Applications ，2010 ，46 （27 ）：109-113. Abstract ：The aim of the Web service is to connect all the services provided by the different organizations ，different compa- nies ，and even different persons seamless and to build the loosely-coupled Web application to make resources sharing maxi- mum.The key question is how to find and choose the suitable services quickly and effectively.In order to decrease the amount of the services finally participated in the matchmaking process so as to improve the discovery efficiency ，the match- ing algorithm do some preprocesses on the service set.And this paper also proposes an approach to compute the similarity between semantic web services based on the specific features of web services ，proposes the idea of infinite classification.At last the paper evaluates the performance in practice. Key words ：web service ；semantic web ；service discovery ；service match ；ontology 摘 要：Web 服务的目的是为了将不同组织、公司甚至个人提供的服务进行无缝的连接，建立一种松耦合的Web 应用，实现资源 共享的最大化。而在众多候选服务集中快速、准确地发现和选择所需要的服务即服务匹配成为其中关键的问题。在服务匹配过 程中，为了减少最终参与匹配的服务的数量，提高服务发现的效率