Indexed by:
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
Keyword:
Reprint Author's Address:
Email:
Source :
2011 35TH IEEE ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC)
ISSN: 0730-3157
Year: 2011
Page: 14-19
Language: English
Cited Count:
WoS CC Cited Count: 1
SCOPUS Cited Count: 3
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 7