CN102368215A - Single Web service matching method - Google Patents

Abstract

The invention discloses a single Web service matching method, belonging to the technical field of computer application. How to quickly and accurately discover target services from a large-scale service set is one of keys of a semantic Web service, and the one-to-one service matching judgment is one of main ways for discovering target services. In the invention, an operation of setting the dependence of output parameters of services on input parameters in the process of service requesting and setting the matched weight of an input interface and an output interface in the process of calculating the matching degrees of services by a user is allowed, therefore, the problems existing in the present method can be solved. The method disclosed by the invention has a broad application prospect in the discovery and matching of target services of a semantic Web service.

Description

A kind of single Web service matching process

Technical field: Computer Applied Technology.

Background technology: Web service finds it is that (Service-Oriented Computing, one of key issue in SOC) has two types of main method: based on the traditional grammar level with based on semantic reasoning to service-oriented computing at present.The former is representative with UDDI, but owing to only support the keyword coupling, the service matching precision is often not high.The latter then is that Web service combines with semantic net to produce; It can extract and utilize the semantic information of description Web service and mate according to the services request contract that the user provides; And then find satisfactory service, improved precision ratio, recall ratio and the automaticity of service discovery to a certain extent.At present, people have proposed many service discovery methods [1-8] based on semanteme, but not enough below the ubiquity:

(1) existing method is followed the service matching principle in the document [1] mostly, and promptly a service describing P and a user ask to describe the R successful match, and and if only if satisfies: 1. P can provide all outputs of R; 2. R can provide all inputs of P.But because this principle is too strict, the many services that cause satisfying customer requirements are eliminated.Although document [9] has proposed expansion WSDL and solved this problem with the supporting interface dependence, the precision of service matching is still not high in some cases, and algorithm still has bigger room for improvement.

(2) existing method is treated the input and output parameter of service by the principle of par; Do not consider service requester; Service output has prior meaning; Service requester has the control of different weights to the import of services parameter, and this causes the service matching precision not high to a certain extent.

[1]Pathak?J，Koulr?N，Garagea?D，et?al.A?framework?for?semantic?web?service?discovery[C]//Proc?of?the?7th?Annual?ACM?International?Workshop?on?Web?Information?and?Data?management.2005.45-50.

[2]Garofalakis?J，Panagis?Y，Sakkopoulos，et?al.Web?service?discovery?mechanisms：looking?for?a?needle?in?a?Haystack.http://www.ht04.org/workshops/WebEngineering/HT04WE-Garofalakis.pdf，2007.

[3]Xu?Z，Martin?P，Powley?W，Zulkernine?F.Reputation-enhanced?QoS-based?web?services?discovery[C]//Proc.of?the?International?Conference?on?Web?Service.Salt?Lake?City，Utah，USA，2007：249-25.

[4]Wang?X，Vitvar?T，Kerrigan?M，Toma?I.A?QoS-aware?selection?model?for?semantic?Web?services[C]//Proc.of?the?4th?International?Conference?on?Service-Oriented?Computing.Chicago，USA，2006：12-24.

[5]Paliwal?A，Adam?N，Bornh?C.Web?service?discovery：adding?semantics?through?service?request?expansion?and?latent?semantic?indexing[C]//Proc.of?the?International?Conference?on?Services?Computing.Vienna，Austria，2007：106-113.

[6] Wan Changlin, Shi Zhongzhi, Hu Hong magnifies roc. and the Semantic Web Services QoS based on body describes and finds. computer research and development, 2011,48 (6): 1059-1066.

[7] Ye Lei opens refined. based on the Web service discover method of functional semantics. and computer research and development, 2007,44 (8): 1357-1364.

[8] Liu Zhizhong, Wang Huaimin, week is refined. and a kind of semantic service of double-deck P2P structure is found model. software journal, 2007,18 (8): 1922-1932.

[9] Deng Shuiguang, Yin Jianwei, Li Ying, Wu Jian, Wu Chaohui. based on the semantic Web service finding method of bipartite graph matching. Chinese journal of computers, 2008,31 (8): 1364-1375.

Summary of the invention: the present invention is applicable to the situation that services request and advertising service are mated one to one; Purpose is to improve the precision ratio and the recall ratio of service discovery under this situation; Its innovative point is to allow the user service output parameter to be set to the dependence of input parameter and coupling weight that input interface and output interface are set in services request in the service matching degree calculates, and can overcome above deficiency.

Technical scheme of the present invention is described below:

The interface dependence is meant the dependence of output interface to input interface.An output of given operation can obtain the input set that this output relies on through the interface dependence.For an operation,, when then this service is called in explanation,, must comprise i in the input set that the user provides in order to obtain this output of o if an input i is relied on by an output o.

An advertising service P is a five-tuple P={n, d, I ^p, O ^p, F ^p.Wherein, n is the title of this service; D is the textual description information of this service; I ^pBe to call the input parameter collection that this service must be satisfied; O ^pIt is the output parameter collection of this service;

The interface of representing this service relies on function, promptly for

Represent the input collection that this output relies on.

A services request R is a five-tuple

Wherein, I ^rIt is the input parameter collection that the user provides; O ^rIt is the output parameter collection that user expectation obtains; F ^r: Or → 2I ^rBe that the interface that this request is described relies on function, promptly for

Represent the input collection that this output relies on; W is the weighing factor collection of input parameter to output parameter, satisfies | W|=|O ^r|, and for

Be the service matching threshold value, and

Can be described as sim:C * C → [0,1] on the notion semantic similarity functional form.Wherein, C representes the set of all notions in the domain body; Promptly for any concept set C ' in this field; There is

notion semantic similarity big more, similar more between the expression notion.

Given advertising service p={n, d, I ^p, O ^p, F ^pAnd services request If the similarity (matching degree) between P and the R

Claim that then but P is the match service of R.

Be provided with two Ontological concept collection C={c ₁, c ₂..., c _nAnd C '=c ' ₁, c ' ₂..., c ' _m, n≤m wherein.If there be the injection f of C, make to C ' Maximum claims that then this group injection collection is the optimum matching collection, and note is made BM, and

＜c _t, f (c _t)＞∈ BM.

Provide the calculating formula of output interface optimum matching degree and input interface optimum matching degree below respectively.

The calculating formula of output interface optimum matching degree is:

$S_{\mathrm{output}}(O^r,O^p)={\mathrm{\Σ}}_{k=1}^{\left|O^r\right|}\max \left(\mathrm{sim}(o_k^r,o_j^p)\right)---\left(1\right)$

1≤j in the following formula≤O ^p|, | O ^r|≤| O ^p|.

If

With O ^pIn

There is maximum notion semantic similarity, and

Then the calculating formula of input interface optimum matching degree is:

$S_{\mathrm{input}}(I^{p^{\&prime;}},I^{r^{\&prime;}})=\left\{\begin{array}{cc}{\mathrm{\&Sigma;}}_{u=1}^{\left|I^{p^{\&prime;}}\right|}{W}_{\mathrm{ku}}\max \left(\mathrm{sim}(i_u^{p^{\&prime;}},i_v^{r^{\&prime;}})\right)& \mathrm{if}\left|I^{p^{\&prime;}}\right|\&le;\left|I^{r^{\&prime;}}\right|\\ \frac{\left|I^{r^{\&prime;}}\right|}{\left|I^{p^{\&prime;}}\right|}{\mathrm{\&Sigma;}}_{v=1}^{\left|I^{r^{\&prime;}}\right|}{W}_{\mathrm{kv}}\max \left(\mathrm{sim}(i_v^{r^{\&prime;}},i_u^{p^{\&prime;}})\right)& \mathrm{if}\left|I^{r^{\&prime;}}\right|<\left|I^{p^{\&prime;}}\right|\end{array}\right.---\left(2\right)$

In the following formula

| I ^r' |＜| I ^pAlthough ' | the output of expression services request

Output with advertising service

There is maximum semantic similarity, but

The number of the input collection that is relied on is less than

The number of the input collection that is relied on, this moment, we were not regarded as 0 with its matching degree.

Provide service matching degree sim (P, calculating formula R) below.

$\mathrm{sim}(P,R)={\mathrm{\&Sigma;}}_{k=1}^{\left|O^r\right|}[y\&times;\max \left(\mathrm{sim}(o_k^r,o_j^p)\right)+x\&times;S_{\mathrm{input}}(I^{p^{\&prime;}},I^{r^{\&prime;}})]/\left|O^r\right|---\left(3\right)$

In the following formula;

x and y are respectively the weights of input interface matching degree and output interface matching degree; Because it is more meaningful than input that the user it is generally acknowledged output; So y>=x, and x+y=1.

Based on above theoretical analysis, given advertising service P is { n, d, I ^p, O ^p, F ^p, request service R does

The weight of input interface matching degree and output interface matching degree is respectively x and y, and services request of the present invention and advertising service matching degree computing method one to one may further comprise the steps:

Step 1 adds the DependOn attribute in the Process.owl of OWL-S module, make the statement of its supporting interface dependence;

It is 0 that step 2 is provided with variable fitvalue;

Step 3 if | O ^r|＞| O ^p|, return matching degree fitvalue;

Step 4 uses the bipartite graph best match algorithm to calculate output interface optimum matching set B M;

Step 5 is for any among the BM<o ^r, o ^p>, I is set ^r'=F ^r(o ^r), I ^p'=F ^p(o ^p), use formula (2) is calculated S _Input(I ^p', I ^r'), and calculate fitvalue=fitvalue+y * max (sim (o ^r, o ^p))+x * S _Input(I ^p', I ^r');

Then P and R can mate step 6 as if .

Embodiment: how rapid and precise finds that destination service is one of key of Semantic Web Services from extensive set of service, and man-to-man service matching judges it is one of main means of finding destination service.The inventive method allows the user service output parameter to be set to the dependence of input parameter and coupling weight that input interface and output interface are set in services request in the service matching degree calculates; The problem that existing method exists can be solved, thereby the destination service discovery of Semantic Web Services can be widely used in.Concrete available any Object-Oriented Programming Language (like Java, C++ etc.) is translated into program, operates in then in Web2.0 with semantic function, the Web3.0 server, thereby can realize that single Web destination service finds.

List of references:

[1] Zhouning County, Song Zilin, Ai Weihua, Chen Li. the research of three grades of matching process of a kind of semantic web service. system emulation journal, 2009,21 (7): 2081-2089.

Claims (8)

1. in the Process.owl of OWL-S module, add the DependOn attribute, make the statement of its supporting interface dependence, it is characterized in that: in Process.owl, add the DependOn attribute

<owl:ObjectProperty?rdf:ID＝″DependOn″>

<rdfs:domain?rdf:resource＝″#Output″/>

<rdfs:range?rdf:resource＝″#Input″/>

</owl:ObjectProperty>。

2. it is 0 that variable fitvalue is set, and it is characterized in that: fitvalue is for calculating the intermediate variable of single service matching degree.

If | Or|＞| O ^p|, return matching degree fitvalue, it is characterized in that: O ^rAnd O ^pBe respectively the output parameter set of services request R and advertising service P, | O ^r| with | O ^p| represent the number of output parameter collection separately respectively.

4. use the bipartite graph best match algorithm to calculate output interface optimum matching set B M; It is characterized in that: the bipartite graph best match algorithm is a kind of algorithm that these claims list of references [1] is proposed, and optimum matching set B M is for establishing two Ontological concept collection C={c ₁, c ₂..., c _nAnd C '=c ' ₁, c ' ₂..., c ' _m, if there be the injection f of C, make to C '

Maximum claims that then this group injection collection is optimum matching collection BM.

5. BM definition according to claim 3, it is characterized in that: sim is a notion semantic similarity computing function, c _tA notion for concept set C.

6. for any among the BM<o ^r, o ^p>, I is set ^r'=F ^r(o ^r), I ^p'=F ^p(o ^p), use formula (2) is calculated S _Input(I ^p', I ^r'), and calculate fitvalue=fitvalue+y * max (sim (o ^r, o ^p))+x * S _Input(I ^p', I ^r'), it is characterized in that: I ^r' and I ^p' represent respectively services request R one of them output o ^rOne of them output o with advertising service P ^pThe input set that is relied on separately, F ^rAnd F ^pThe interface that is respectively R and P relies on function, and formula (2) does X and y are respectively the weight of input interface matching degree and output interface matching degree.

7. formula according to claim 5 (2) is characterized in that: described W is the weighing factor collection of services request R input parameter to output parameter.

if

then P and R can mate, it is characterized in that:

is service matching threshold value set among the services request R.

List of references:

[1] Zhouning County, Song Zilin, Ai Weihua, Chen Li. the research of three grades of matching process of a kind of semantic web service. system emulation journal, 2009,21 (7): 2081-2089.