Abstract
In service-based systems, one of the most important problems is how to discover desired web services. In this paper, we propose a novel IR-Style mechanism for discovering and ranking web services automatically. In particular, we introduce the notion of preference degree for web services and then we define service relevance and service importance as two desired properties for measuring the preference degree. Furthermore, various algorithms are given for computing the relevance and importance of services, respectively. Experimental results show the proposed IR-style search strategy is efficient and practical. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Hao, Y., Cao, J., & Zhang, Y. (2009). Efficient IR-style search over web services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5565 LNCS, pp. 305–318). https://doi.org/10.1007/978-3-642-02144-2_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
