Research On Matching Algorithm In Semantic Web Services Based On Group Preference

Semantic web services (SWSs) add semantic describe information for tradition web services, it enhance the ability of service discovery and matching of web services. Matching is the kernel of finding and composition, researcher pays close attention to the recall and precision ratio of service matching, and put evaluation into web service also is very important research direction.The emphasis of semantic web services matching is ontology matching. Usually, it is an operation based on dictionary similarity and distance between words. Every service requester will evaluate the factors of the service they used. If we put the evaluating factors into SWSs, it would increase the indexes in the process of services matching, and improve the precision and recall rate. Meanwhile the results of services matching will fit the demand of service requester. The evolution facts have timeliness, so only collecting the information, the results of services matching would make more sense.This paper studies SWSs, OWL-S. SWSs register and matching. It proposes some lacks of tradition SWSs m atching like classification suppleness, inefficient. Based on the group decision theory analysis of the development and current situation, dynamic order of Analytic Hierarchy Process, this paper propose put the group decision into SWSs matching, change the weight and its relationship dynamically. Then it matching the ad services and request service deeply.Finally, this paper gives a SWSs finding model and SWSs matching of four-layer structure, and detailed analysis of the functions and features of each. Finally, this paper presents the semantic services based on group preference matching algorithm, Experimental results show that the algorithm improves the precision and recall.