Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (27): 109-113.DOI: 10.3778/j.issn.1002-8331.2010.27.030

• 网络、通信、安全 • Previous Articles     Next Articles

Matching algorithm for semantic Web service discovery based on infinite classification

XU Yong-kang1,ZHAO You-qiao2,GONG Si-ping2,LU Song-feng2,WEI Xiao-mao3   

  1. 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
  • Received:2010-07-15 Revised:2010-09-03 Online:2010-09-21 Published:2010-09-21
  • Contact: XU Yong-kang



  1. 1.中国工程物理研究院 计算机应用研究所,四川 绵阳 621900
    2.华中科技大学 计算机科学与技术学院,武汉 430074
    3.恩威制药有限公司,成都 610041
  • 通讯作者: 胥永康

Abstract: The aim of the Web service is to connect all the services provided by the different organizations,different companies,and even different persons seamless and to build the loosely-coupled Web application to make resources sharing maximum.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 matching 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.

摘要: Web服务的目的是为了将不同组织、公司甚至个人提供的服务进行无缝的连接,建立一种松耦合的Web应用,实现资源共享的最大化。而在众多候选服务集中快速、准确地发现和选择所需要的服务即服务匹配成为其中关键的问题。在服务匹配过程中,为了减少最终参与匹配的服务的数量,提高服务发现的效率,匹配算法对参与匹配的服务集进行了预处理。并且依据服务描述本身的特点,对服务匹配中基于语义的Web服务相似度计算方法进行了研究,提出了无限分类的思想。最后实现了匹配算法并对性能进行了对比。

CLC Number: