DocumentCode
3480030
Title
A Semantic Similarity Measure between Web Services Based on Google Distance
Author
Yang, Huirong ; Fu, Pengbin ; Yin, Baocai ; Ma, Mengduo ; Tang, Yanyan
Author_Institution
Coll. of Comput. Sci., Beijing Univ. of Technol. Beijing, Beijing, China
fYear
2011
fDate
18-22 July 2011
Firstpage
14
Lastpage
19
Abstract
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.
Keywords
Web services; computational complexity; search engines; semantic Web; Google terms; Web service matching; calculation complexity; normalized Google distance; open Google search engine; semantic matching degree; semantic similarity measures; Google; Ontologies; Quality of service; Search engines; Semantics; Vehicles; Web services; Google Distance; Semantic similarity; Web Services; web service matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference (COMPSAC), 2011 IEEE 35th Annual
Conference_Location
Munich
ISSN
0730-3157
Print_ISBN
978-1-4577-0544-1
Electronic_ISBN
0730-3157
Type
conf
DOI
10.1109/COMPSAC.2011.97
Filename
6032319
Link To Document