The Improvement of the Ontology-based Bipartite Graph Matching Semantic Web Service Discovery Algorithm
As the current registration and discovery of Web services protocols such as UDDI is a keyword-based and precisely matching service discovery mechanism,and it cant describe the semantic information of a Web service,which makes the traditional protocol of the Web-based service discovery algorithm can not automatically match the services that meet the requirements. In order to solve the above problems,this paper proposes an ontology-based bipartite graph matching semantic Web service discovery algorithm,which making the computer can recognize the semantics of Web services information and match the services automatically. The algorithm also contributes to the improvement of the recall rate and precision rate of the service discovery.
UDDI ontology-based bipartite graph matching semantic Web service
Bingyue Liu Yuejin Lin
Department of Computer,Dalian Neusoft Institute of Information,Dalian,China
国际会议
西安
英文
2141-2144
2011-12-23(万方平台首次上网日期,不代表论文的发表时间)