Web service technology allows access to advertised services despite of their location and implementation platform. However, considerable differences on structural, semantical and technical levels along with the growing number of available web services makes their discovery a significant challenge. Keyword-based matchmaking methods can help users to locate quickly the set of potentially useful services, but they are insufficient for automatic retrieval. On the other hand, the high cost of formal ontology-based methods alienates service designers from their use in practice. Several information retrieval approaches to assess the similarity of web services have been proposed. In this paper we proceed with such a study. In particular, we examine advantages of using Vector-Space Model, WordNet and semantic similarity metrics for this purpose. A matching algorithm relying on the above techniques is presented and an experimental study to choose the most effective approach is provided.
A Comparison of Web Service Interface Similarity Measures / Kokash, Natallia. - ELETTRONICO. - (2006), pp. 1-17.
A Comparison of Web Service Interface Similarity Measures
Kokash, Natallia
2006-01-01
Abstract
Web service technology allows access to advertised services despite of their location and implementation platform. However, considerable differences on structural, semantical and technical levels along with the growing number of available web services makes their discovery a significant challenge. Keyword-based matchmaking methods can help users to locate quickly the set of potentially useful services, but they are insufficient for automatic retrieval. On the other hand, the high cost of formal ontology-based methods alienates service designers from their use in practice. Several information retrieval approaches to assess the similarity of web services have been proposed. In this paper we proceed with such a study. In particular, we examine advantages of using Vector-Space Model, WordNet and semantic similarity metrics for this purpose. A matching algorithm relying on the above techniques is presented and an experimental study to choose the most effective approach is provided.File | Dimensione | Formato | |
---|---|---|---|
025.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
524.59 kB
Formato
Adobe PDF
|
524.59 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione