A New Web Service Discovery Algorithm Based on Similarity Degree


Article Preview

To discover requested web services in Internet, this paper proposes a new web service discovery algorithm based on ontology. It uses tree-form data structure to describe the web services and give all the nodes a weight value by certain strategy, then compute the semantic similarity between the web services requested and the services registered. To validate the feasibility and effectiveness of the algorithm, the paper constructs a self-developed prototype system to show how well it works. The experiments prove that this algorithm has high recall rate and precision than other methods.



Edited by:

Wenya Tian and Linli Xu




Z. J. Xu and S. Zhang, "A New Web Service Discovery Algorithm Based on Similarity Degree", Advanced Materials Research, Vol. 186, pp. 606-610, 2011

Online since:

January 2011





[1] Deng ShuiGuang, Wu ZhaoHui: Lecture Notes in Computer Science Vol 45(2006), p.428.

[2] K. Sivashanmugam, K. Verma, A. Sheth and J. Miller: In Proceedings of the 1st International Conference on Web services Vol 1(2007), p.105.

[3] Dipanjan Chakraborty, Filip Perich: Proceedings of the Workshop on Reliable and Secure Applications in Mobile Environment Vol 2(2008), p.28.

[4] Klein M, Bernstein: Proceedings of the International Semantic Web Working Symposium Vol 5(2006), p.159.

[5] Jian Wu and Zhaohui Wu: proceedings of the 2005 IEEE International Conference on Services Computing Vol 3(2005), p.123.

Fetching data from Crossref.
This may take some time to load.