By Topic

A Semantic Similarity Measure between Web Services Based on Google Distance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Huirong Yang ; Coll. of Comput. Sci., Beijing Univ. of Technol. Beijing, Beijing, China ; Pengbin Fu ; Baocai Yin ; Mengduo Ma
more authors

In order to get a better semantic matching degree for web services, in this paper, we try to deal with the problems of web services matching through calculating the Normalized Google Distance (NGD) between concepts, based on the semantic description of web service's name, input and output parameters. This measure method takes advantage of the Google massive terms and open Google search engine to compute the NGD between concepts, and calculates the similarity between web services. Compared with the existing algorithm, we adopt Google terms which present merits of more abundance and updating in a relatively faster speed. This method is simpler and greatly decreases the complexity of calculation because there is no ontology and taxonomy tree, no need to judge the foliatory order, path length, depth and local density. The preliminary results have shown that our algorithm can highly improve the recall and precision of the web service.

Published in:

Computer Software and Applications Conference (COMPSAC), 2011 IEEE 35th Annual

Date of Conference:

18-22 July 2011