Matchmaking OWL-S processes

• DOI: 10.1145/2077489.2077521
• Publication Date: 2011-12-13T15:46:00Z
• Authors: S. Lagraa; H. Seba; H. Kheddouci
• Keywords: Similarity (geometry); Service discovery; Similarity measure

With the development of e-commerce over Internet, web service discovery received much interest. A critical aspect is similarity search or matchmaking. To enhance precision, several solutions that do not limit to a syntactic comparison inputs and outputs compared services have been proposed. Most them introduce structure operations in measure. In this paper, we analyze these approaches point out their time complexity drawback. Then, propose more efficient matching algorithm based on concept decomposition kernels graphs. We study our approach present performance analysis.