The Study And Implementation Of Semantic Web Serivces Matchmaking

As a new Web application model and remote access standard, Web Services have good performance in application communicating and data sharing between different platforms. To locate the Web Services that match client's requirements, traditional Web Services matching is mainly based on key words comparing. However, the lack of semantic information leads to low recall and precision, thereby to provide a more effective and efficient matchmaking mechanism based on semantic description of Web Services is becoming a very important issue in automatic Web Services Discovery.Firstly this paper states a similarity measure between two ontology concepts by considering all the determination such as ontology relationship and concept's depth, based on which an algorithm of computing similarity degree between two concepts sets are presented. Experimental evaluation demonstrates that the proposed algorithm outperforms traditional similarity measures and accords with Semantic Web Services matchmaking.On the foundation of similarity measure algorithms, this paper proposes a Semantic Web Services matchmaking algorithm according to the characteristics of semantic description. The "similarity" is used to describe how much the candidate services match the client's request constrains.Then, a filtering mechanism is introduced in the process of matchmaking to reduce the similarity computing of irrelative Web Services, which greatly improves the performance of the matchmaking algorithm.At last, this paper provides a solution to facilitate the design and realization of Semantic Web Services matchmaking System. Traveling domain ontology and taxonomy ontology are built up to test the performance of different matchmaking mechanism.