Improving Grade Match to Value Match for Semantic Web Service Discovery

In the semantic Web services discovery (SWSD), the algorithm proposed by Paolucci is a well-known service matching algorithm, in which the advertised service matches the request service at one certain grade of four defined grades. However, this algorithm cannot further rank the advertised services matched in the same grade, which makes it difficult to select the most satisfying service. In this paper, we propose an improved matching algorithm based on the grade match to compute the matching degree of two Web services into a fine value denoted by a real number. Different match grade of the grade algorithm is mapped into different value range in the improved algorithm. Case study and applications show the effectiveness of our algorithm in service selection.