• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2010, Vol. 32 ›› Issue (6): 138-141.doi: 10.3969/j.issn.1007130X.2010.

• 论文 • Previous Articles     Next Articles

A Ranking Mechanism for Semantic Web Service Matchmaking Based on the Semantic Distance Metric Model

ZENG ZhiHao1,YING Shi1,CHEN Rui1,NI Youcong1,2,ZHAO Kai1,3   

  1. (1.State Key Laboratory of Software Engineering,Wuhan University,Wuhan 430072;2.Department of Mathematics and Physics,Anhui Institute of Architecture and  Industry,Hefei 230018;3.School of Information Science and Engineering,Xinjiang University,Urumqi 830046,China)
  • Received:2009-11-13 Revised:2010-02-10 Online:2010-06-01 Published:2010-06-01

Abstract:

With the Semantic Web Services technology research work going on, the number of Semantic Web Services on the Internet have dramatically increased, and how to locate available Semantic Web Services quickly and easily has become an urgent and key issue. Among the Semantic Web Service matchmaking technology researches, one of the important research themes is the Semantic Web Service matchmaking result ranking mechanism. In this paper, a novel Semantic Web Service ranking mechanism based on the semantic distance metric model is proposed. The calculation of semantic similarity measure can be realized by using this threedimensional semantic distance metric model.Therefore, the Semantic Web Service matchmaking results can be ranked in accordance with the semantic similarity measure. The semantic relationship of concepts referred by Semantic Web Services can be converted into quantified degrees according to the metric model, and can achieve high performance of the user experience of the Semantic Web Services search.

Key words: semantic web service;semantic web service search;semantic web service matchmaking;semantic web service ranking

CLC Number: