In this paper, we present a fine-grained matching method of the services based on a hybrid similarity measure. We propose a novel encoding of the services descriptions, allowing the match between a request and an advertisement in order to make more efficient publishing and searching process of Web services and reduce the number of comparisons required. By this kind of similarity between concepts of profile, a precise matching method is developed to match the profile of the Web services and user. Searching process in the UDDI registry is done via an algorithm that allows us to extract the search concepts and retrieve the top-k services, thereby further reducing the search engine's response time. The approach is illustrated through some experiments both on real and synthetic data to demonstrate its consistency and effectiveness.
展开▼
