TY - JOUR
T1 - Context-sensitive Web service discovery over the bipartite graph model
AU - Zhang, Rong
AU - Zettsu, Koji
AU - Kidawara, Yutaka
AU - Kiyoki, Yasushi
AU - Zhou, Aoying
N1 - Funding Information:
Acknowledgements This work was partially supported by National Basic Research Program of China (Grant Nos. 2010CB328106, 2012CB316200), the Key Program of the National Natural Science Foundation of China (Grant No. 61232002), the National Science Foundation of China (Grant Nos.61103039, 60925008, 61021004) and the Key Lab Project of Wuhan University.
PY - 2013/12
Y1 - 2013/12
N2 - As service oriented architecture (SOA) matures, service consumption demand leads to an urgent requirement for service discovery. Unlike Web documents, services are intended to be executed to achieve objectives and/or desired goals of users. This leads to the notion that service discovery should take the "usage context" of service into account as well as service content (descriptions) which have been well explored. In this paper, we introduce the concept of service context which is used to represent service usage. In query processing, both service content and service context are examined to identify services. We propose to represent service context by a weighted bipartite graph model. Based on the bipartite graph model, we reduce the gap between query space and service space by query expansion to improve recall. We also design an iteration algorithm for result ranking by considering service context-usefulness as well as content-relevance to improve precision. Finally, we develop a service search engine implementing this mechanism, and conduct some experiments to verify our idea.
AB - As service oriented architecture (SOA) matures, service consumption demand leads to an urgent requirement for service discovery. Unlike Web documents, services are intended to be executed to achieve objectives and/or desired goals of users. This leads to the notion that service discovery should take the "usage context" of service into account as well as service content (descriptions) which have been well explored. In this paper, we introduce the concept of service context which is used to represent service usage. In query processing, both service content and service context are examined to identify services. We propose to represent service context by a weighted bipartite graph model. Based on the bipartite graph model, we reduce the gap between query space and service space by query expansion to improve recall. We also design an iteration algorithm for result ranking by considering service context-usefulness as well as content-relevance to improve precision. Finally, we develop a service search engine implementing this mechanism, and conduct some experiments to verify our idea.
KW - Web service
KW - bipartite graph model
KW - context-usefulness
KW - usage context
UR - http://www.scopus.com/inward/record.url?scp=84888365711&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84888365711&partnerID=8YFLogxK
U2 - 10.1007/s11704-013-1256-x
DO - 10.1007/s11704-013-1256-x
M3 - Article
AN - SCOPUS:84888365711
SN - 2095-2228
VL - 7
SP - 875
EP - 893
JO - Frontiers of Computer Science
JF - Frontiers of Computer Science
IS - 6
ER -