Intelligent matching for public internet web services ? towards semi-automatic internet services mashup

In this paper, we propose an Internet public Web service matching approach that paves the way for(semi-)automatic service mashup. We will first provide the overview of the solution, which requires a detailed review of two fundamental models ? schema/graph matching and semantic space. Based on the conceptual model and the literature study, the complete service matching approach is then provided with four essential steps ? semantic space, parameter tree, similarity measures, and WSDL operation matching. The system demonstration that proves the concept proposed in this approach is finally presented. The solution has the potential to facilitate the Internet services mashup

Semantic API Matching for Automatic Service Composition

In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes. 1