Semantic web service matching method and system

A technology of semantic matching and matching method, which is applied in the field of semantic web service matching, can solve the problems of low precision and recall of service matching, and the inability to distinguish service matching in more detail, so as to achieve accuracy and response efficiency Improvement, performance-enhancing effects

Inactive Publication Date: 2009-04-01
BEIJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 35 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0029] In view of this, one of the purposes of the present invention is to provide a semantic Web service matching method, which solves the problem of inability to distinguish the degree of service matching within t...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Semantic web service matching method and system
  • Semantic web service matching method and system
  • Semantic web service matching method and system

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0154] Example 1: Calculate the semantic distance distance(H, D) between nodes H and D

[0155] Satisfying the third case of the algorithm, there are two indirect path relationships from H to D {(H, E, C, F, D, A)(1.25, 1.5, 2.5, 1.5, 2)}; {(H, E , F, D, A)(1.125, 1.25, 1.5, 2)}, thus:

[0156] Dis1(H, D)=sum(1.25+1.5+2.5+1.5)=6.75;

[0157] Dis2(H, D)=sum(1.125+1.25+1.5)=3.875;

[0158] Therefore Dis(H, D)=min{Dis1, Dis2}=Dis1=3.875;

example 2

[0159] Example 2: Calculate the semantic distance Dis(B, E) between nodes B and E

[0160] Satisfy the fourth condition,

[0161] Dis(B,E)=min{Dis(B,A)}+min{Dis(E,A)}=2+(2+1.5)=5.5

[0162] 4. Calculate the similarity

[0163] After obtaining the semantic distance between two concepts, it is necessary to construct a reasonable similarity function to convert the semantic distance into similarity. Consider the requirement of descending rate, the similarity function of the present invention structure adopts formula:

[0164] SF=1 / (factor*distance+1)(factor<1)

[0165] This formula satisfies several properties that the similarity function needs to satisfy:

[0166] When the semantic distance is 0, the similarity is 1, that is, when the two concepts are the same, the similarity is 1;

[0167] This function decreases with the increase of semantic distance, that is, the similarity between concepts with large semantic distance is smaller than the similarity between concepts with ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a matching method of semantic WEB service and a system thereof. Based on similarity between request and candidate service, the matching method and the system synthetically consider functional and non-functional factors, and introduce a phasing filtering mechanism. The matching method and the system adopt single-concept semantic matching algorithm, take depth, inheritance relation and binary relation into full account so that a body relationship structure is formed into a graphic structure rather than a tree-shaped structure, and the multiple inheritance problems and loop problems are processed during calculation of semantic distance based on the graph. The adopted multi-concept semantic matching algorithm has introduced a processing of repeated matching. During input and output matching, the number of parameters are taken into account, a method for calculating similarity in three levels is adopted, therefore,, the matching is more efficient; and the matching method and the system also takes into account factors of user preferences and service quality, therefore, the precision of matching and efficiency of response can be further improved.

Description

technical field [0001] The present invention relates to the field of Semantic Web Service (SWS), in particular to a matching method and system for Semantic Web Service. Background technique [0002] In the prior art, there are mainly the following methods for semantic matching of Web services: [0003] Method 1: Documents [1, 2, 3, 4, 5] use OWL-S (Ontology Web Language for Services) to divide the service matching degree into four types according to the input and output matching between requests and services: exact matching, insertion matching, Contains matches and mismatches. The matching between service requests and candidate services depends on the matching between all their outputs and inputs. The matching between each output or input depends on the inclusion relationship between their concepts. The accuracy and efficiency of this method are very high, but the degree of service matching within the same level cannot be more finely differentiated. [0004] Method 2: Li...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 双锴于晓燕杨放春刘倩陈炜苏森程珊珊
Owner BEIJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products