DocumentCode :
2253230
Title :
Discovering Web service operations by index tables and bipartite graphs
Author :
Li, Ji-hui
Author_Institution :
Fac. of Inf. Sci. & Eng., Yanshan Univ., China
Volume :
3
fYear :
2010
fDate :
11-14 July 2010
Firstpage :
1279
Lastpage :
1283
Abstract :
Index tables on key words and bipartite graph matching are two existing methods on Web service discovery, but both of them have certain limitations. On the basis of common Web service descriptive standardized WSDL, a novel two-stage Web service discovery method is proposed in this paper. Related service is discovered based on index tables in the first stage. By taking semantic information into account together with bipartite graph matching, the needed Web service operations are discovered efficiently in the second stage. Experiments show that our method can not only discover required Web service operations accurately, but also provide alternative service operations.
Keywords :
Web services; graph theory; bipartite graph matching; common Web service descriptive standardized WSDL; index tables; semantic information; Bipartite graph; Cybernetics; Indexes; Libraries; Machine learning; Semantics; Web services; Best match; Bipartite graph; Invert indexed; Service operation discovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2010 International Conference on
Conference_Location :
Qingdao
Print_ISBN :
978-1-4244-6526-2
Type :
conf
DOI :
10.1109/ICMLC.2010.5580889
Filename :
5580889
Link To Document :
بازگشت