Research On The Matchmaking Of Web Services Based On Semantics

With the rapid improvement and development of society, information sharing becomes the theme of people's life. The open web environment has been an important source of gaining and sharing kinds of information. A lot many web services rise up quickly. How to find the expected web serivce from plenties of web service, which is called web service discovery, should be solved urgently at present whether in scientific community or in business circles. Web service discovery is based on service matchmaking. So, service matchmaking is the important part of the service discovery. The paper researched into web service matchmaking.Traditional matchmaking algorithms have low recall ratio and precision ratio. Integrating ontology denotation and ontology reason into web service matchmaking is named web service matchmaking based on semantics, which is a hot spot in recent. But two issues are existed in recent research as following.(1) There is less research on precondition matchmaking in the matchmaking scheme. The paper adopted the stratification matching framework and weeded out the web services that were not expected. Precondition became one of screening standards. Precondition matchmaking degree is 0 or 1 using the exited precondition matchmaking algorithm. So, we improved the algorithm in order to promote the accuracy of precondition matchmaking.(2) Inputs and outputs are the main arguments on description of web services' concrete functionality. So IO matchmaking is the most important part of overall matchmaking scheme. Recent research on IO matchmaking adopted the concept similarity algorithm based on semantic distance, which was lack of semantic asymmetry with a lot of calculation. Dynamic changes in the resource environment composed of web services and the efficiency of business requirements need web services matchmaking has good time efficiency. When accuracy is guaranteed, we improved the algorithm in order to promote time efficiency.This paper concluded and analyzed the related research recently, set up matchmaking system and adopted the stratification matchmaking framework and weeded out the services whose matchmaking degree was lower than threshold in order to induce the calculation. The concrete matchmaking scheme was category matchmaking, precondition matchmaking, Inputs/Outputs matchmaking and quality of service matchmaking. In precondition matchmaking process, the paper utilized SWRL-FOL to describe preconditions, analyzed the probilities that may happen and calculated precondition matchmaking degree. In Inputs/Outputs matchmaking process, the paper improved the concept similarity algorithm based on the semantic distance, and added semantic asymmetry factor into the algorithm to make the result more accurate and close to fact. Based on it, the paper built the index and screening mechanism to propose an I/O matchmaking optimization method with the index. Then, the paper proved the algorithm feasibility via the experiment, summarized the work and the main contributes of the work, and proposed to the future work.