Trade-off between complexity of structured tagging and effectiveness of web service retrieval

  • Authors:

  • Maciej Gawinecki;Giacomo Cabri;Maria Ganzha;Marcin Paprzycki

  • Affiliations:

  • Department of Information Engineering, University of Modena and Reggio Emilia, Italy;Department of Information Engineering, University of Modena and Reggio Emilia, Italy;Systems Research Institute, Polish Academy of Sciences, Poland and Institute of Informatics, University of Gdańsk, Poland;Systems Research Institute, Polish Academy of Sciences, Poland

  • Venue:
  • ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Searching for services often starts from the exploration of the service space. Community generated tags can support such exploration. Researchers attracted by the community-available "free manpower" proposed more complex tagging models. Those models tag specific parts of the Web service definition: single operations, their inputs and outputs. However, there is no evidence whether the annotation effort is justified by the performance improvement of retrieval (based on those annotations). In this paper we apply similarity-based search to estimate the trade-off between retrieval effort and the annotation effort. Our experiments shows that exploiting similarity metrics for service ranking can compensate missing information and thus be more realistic solution than passing burden of tagging about more aspects on the community.