CN102006320A - Grid geographic information service matching method based on semantics - Google Patents

Abstract

The invention discloses a grid geographic information service matching method based on semantics. The method comprises the following steps: 1) the similarity of the semantic description clauses of a service advertisement and a customer service request is calculated, wherein each semantic description clause is used to describe the functional characteristics of the grid geographic information service and contains service interface clause, operating condition clause and program logic clause; 2) the final similarity of the service advertisement and the customer service request is calculated synthetically according to the similarity of the service interface clause, the similarity of the operating condition clause and the similarity of the program logic clause; and 3) the final similarity is compared with a preset similarity threshold, and if the final similarity is more than the similarity threshold, the service advertisement is returned to the customer. The invention can describe the functional characteristics of the grid geographic information service more comprehensively from different angles; and by adopting the similarity matching method of the functional characteristics of the grid geographic information service, the precision rate of the service discovery can be increased.

Description

Grid geographic information services matching process based on semanteme

Technical field

The present invention relates to grid geographic information services technical field, particularly a kind of grid geographic information services matching process based on semanteme.

Background technology

High speed development along with network technology, increasing geospatial information is externally issued with the form of service, various geospatial information services have different semantemes under grid environment, press for a kind of effective description and matching process at present, make the user can be from the geospatial information set of service of numerous complexity precise and high efficiency retrieve the service of satisfying semantic requirement.

Research both at home and abroad at present concentrates on the grid geographic information service discovery based on semantic body, Ontology Language (Ontology Web Language for Services based on the web service, OWL-S) service describing and the coupling of description logic ontology such as, though yet description logic can accurately define service concept, break through traditional ambiguity and ambiguity problem of being brought based on plain text service describings such as keywords, but can only be used for the service interface expression because function is limit, cause the precision ratio of the similar set of service of docking port lower.

Summary of the invention

(1) technical problem that will solve

The technical problem to be solved in the present invention is: the service precision ratio of service request in service system of gis that how to improve the user.

(2) technical scheme

For addressing the above problem, the invention provides a kind of grid geographic information services matching process based on semanteme, may further comprise the steps:

S1: each semantic description clause's similarity in calculation services advertisement and the user's service request, described semantic description clause is used to describe grid geographic information services functional character, comprising:

The service interface clause is used for the semantic description by service shared dictionary realization input;

Service conditions clause, comprise precondition and postcondition, precondition adopts the first order logic instrument of asserting to describe the feature of the preceding geographical spatial data of service operation, and the necessary condition of service operation, postcondition adopts the first order logic instrument of asserting mainly to describe the change of geographical spatial data behind the service operation;

The programmed logic clause is used for the operating process of formalized description grid geographic information services for spatial data;

S2: according to the final similarity of service interface clause similarity, service conditions clause's similarity and programmed logic clause similarity COMPREHENSIVE CALCULATING service advertisement and user's service request;

S3: described final similarity and predefined similarity threshold are compared,, then return described service advertisement and give the user if greater than this threshold value.

Wherein, calculating service interface clause similarity step among the described step S1 comprises:

The corresponding relation of service interface clause's input parameter in calculation services advertisement and the user's service request: { (Ia _i, Ir _j) | 1＜i＜m, 1＜j＜n}, wherein, Ia _iBe the input parameter in the service advertisement, Ir _jBe the input parameter in the service request, m is the total number of the input parameter in the service advertisement, and n is the total number of the input parameter in the service request, and then the input parameter similarity is:

${\mathrm{Similarity}}_{\mathrm{input}}=\frac{\mathrm{\Σsc}({\mathrm{Ia}}_i,{\mathrm{Ir}}_i)}{k}$

Wherein, k is { (Ia _i, Ir _j) | 1＜i＜m, the key element quantity among 1＜j＜n},

The similarity of service interface clause's output parameter is in calculation services advertisement and the user's service request:

Similarity _output＝sc(Oa，Or)

Wherein, Oa and Or are respectively the output parameter in service advertisement and the service request,

Service interface clause similarity is in service advertisement and the user's service request:

${\mathrm{Similarity}}_{\mathrm{interface}}=\frac{{\mathrm{Similarity}}_{\mathrm{input}}+{\mathrm{Similarity}}_{\mathrm{output}}}{2}$

Wherein, Wherein, C ₁And C ₂For describing the logical concept of input, l ₁And l ₂Be respectively C ₁And C ₂The logical concept level, Dis (C ₁, C ₂) be the paths of two notions in body frame, its computing formula is: Dis (c ₁, c ₂)=length (c ₁, c _a)+length (c ₂, c _a), wherein, C _aBe C ₁And C ₂Common ancestor node, length (c _i, c _j) be its path on the conceptional tree in body frame, a, b, c are respectively the adjusting parameter, and a＞0, b＞0, c＞0.

Wherein, calculating service conditions clause similarity step among the described step S1 comprises:

According to the Hall rule with description logic notion C ₁And C ₂Be converted into set i ₁And i ₂, set i ₁And i ₂Similarity be:

$\mathrm{sf}(i_1,i_2)=\mathrm{sf}(p,l,q)=w\×\frac{l+1}{l+p+2}+(1-w)\×\frac{l+1}{l+q+2}$

Wherein p is for being included in i ₁In but be not included in i ₂In key element quantity; L is for being included in i ₁In be also contained in i ₂In key element quantity; Q is for being included in i ₂In but be not included in i ₁In key element quantity, w is a weight;

The minimum of extracting then among the described service conditions clause is summarized the clause, for Hall rule C ₁And C ₂, if C=i ₀∧ ... ∧ i _wThe minimum that is C1 and C2 is summarized the clause, and its calculating formula of similarity is as follows:

fs(C ₁，C ₂)＝sf(v ₁-v，v，v ₂-v)×sf(o ₁-o，o，o ₂-o)+avg({sf _s(l _1i，l _2i)} _i＝1...v)

V wherein ₁, v ₂With v be respectively C ₁, C ₂With the number of predicate among the C, o ₁, o ₂With o be respectively C ₁, C ₂, and C in the number of variable, sf (k ₁-k, k, k ₂-k) and sf (o ₁-o, o, o ₂-o) weighed predicate and variable similarity in the Hall rule.l _1i∈ C ₁, l _2i∈ C ₂Be l among the minimum clause of summary _i(i=1 ... w) at C ₁, C ₂In the mapping predicate, sf _s(l _1i, l _2i) be the minimum clause of summary similarity, weigh the similarity between the pairing mapping predicate of the minimum clause of summary.

Then the precondition similarity is:

Similarity _Pre＝fs(C?Pr?e _adv，C?Pr?e _req)

Wherein, C Pr e _AdvBe the pairing Hall rule of service advertisement precondition, C Pr e _ReqBe the pairing Hall rule of service request precondition,

Then the postcondition similarity is:

Similarity _Post＝fs(C?P?ost _adv，C?P?ost _req)

Wherein, C P ost _AdvBe the pairing Hall rule of service advertisement precondition, C P ost _ReqBe the pairing Hall rule of service request precondition,

Service conditions clause's similarity is:

${\mathrm{Similarity}}_{\mathrm{condition}}=\frac{{\mathrm{Similarity}}_{\mathrm{Pre}}+{\mathrm{Similarity}}_{\mathrm{Post}}}{2}.$

Wherein, program logical sub sentence similarity is among the described step S1:

Similarity _program＝fs(C?Pr?ogram _adv，C?Pr?ogram _req)

Wherein, C Pr ogram _AdvBe the pairing Hall rule of the programmed logic clause of service advertisement, C Pr ogram _ReqHall rule for the programmed logic clause correspondence of service request.

Wherein, the final similarity of calculating service advertisement and user's service request is specially among the described step S2:

Similarity＝a ₁×Similarity _interface+a ₂×Similarity _condition+a ₃×Similarity _program

Wherein, a ₁, a ₂, a ₃Be respectively the adjusting parameter, a ₁＞0, a ₂＞0, a ₃＞0, and a ₁+ a ₂+ a ₃=1.

Wherein, described service interface clause, service conditions clause and programmed logic clause are specially by expansion semantic web service description language (sdl) WSDL-S definition:

Use the acquiescence extended method of WSDL-S, at＜types〉input in the label among the definition service interface clause;

At＜interface〉expand subtab＜wssem:precondition in the label〉and＜wssem:postcondition〉the preposition and postcondition of definition;

At＜interface〉expand subtab＜wssem:program in the label〉the define program logic.The clause.

(3) beneficial effect

The present invention is by service interface clause, service conditions clause and programmed logic clause, use the stronger first order logic of ability to express to describe grid geographic information services functional character more all sidedly, with multi-angle, and improved the precision ratio of service discovery by grid geographic information services functional character similarity matching process.

Description of drawings

Fig. 1 is a kind of grid geographic information services matching process flow chart based on semanteme of embodiments of the invention.

Embodiment

Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples are used to illustrate the present invention, but are not used for limiting the scope of the invention.

As shown in Figure 1, a kind of grid geographic information services matching process flow chart based on semanteme of embodiments of the invention comprises:

Step S101, each semantic description clause's similarity in calculation services advertisement and the user's service request, described semantic description clause is used to describe grid geographic information services functional character, comprise: service interface clause, service conditions clause and programmed logic clause, describe the clause for these three grid geographic information services functional character carried out the multi-angle expression

The service interface clause describes the external data stream of service, i.e. input, and this clause has inherited service semantics describing method at present commonly used and technology, uses description logic ontology definition service interface data type.In describing, the grid geographic information services uses description logic definition geographical spatial data type concept hierarchical relationship usually, and realize that field ontology library is as the service shared dictionary that can embody semantic feature, and by serving the semantic description of shared dictionary realization input, wherein, the service shared dictionary comprises the required Key Term of service describing.

The service interface clause is divided into input parameter clause and output parameter clause, is expressed as:

IN：PI1：T1，...，PIn：Tn

OUT：PO：T

Wherein IN, OUT are respectively input clause keyword, and PI1...PIn, PO are respectively the input name variable, and T1...Tn, T are respectively to being corresponding data type.

Service conditions clause, the feature of description input is described the variation of input in form.Comprise precondition (PRECONDTION) and postcondition (POSTCONDITION), precondition adopts the first order logic instrument of asserting to describe the feature of the preceding geographical spatial data of service operation, and the necessary condition of service operation, postcondition adopts the first order logic instrument of asserting mainly to describe the change of geographical spatial data behind the service operation.

The first order logic that service conditions clause uses is asserted by variable declarations predicate C (a _i) and data judgement predicate P (a _i..., a _l) form, be expressed as:

PRECONDTION/POSTCONDITION：C1(a ₁)∧...∧Cn(a _n)∧P1(a _i，…，a _l)∧...∧Pm(a _k，…，a _j)

Wherein the variable declarations predicate is used to state the title and the data type of variable; Data judge that predicate then by the relationship expression geodata feature between the variable, comprises spatial relationship (position relation, metric relation and topological relation), spatial dimension, network connectivty etc.

And in order to express the operating effect of service to geographical spatial data, the present invention introduces name predicate LET (o, o '), and to be kept at the data mode of specific time point, wherein LET is a name predicate name, and o is an object oriented, and o ' is by named object.

The programmed logic clause is used for the operating process of formalized description grid geographic information services for spatial data, to express the inner details that realizes of service function.Even two service functions are from input or service conditions clause, form is identical, but actual semantic different, and the present invention reaches the purpose of distinguishing different Service Instances by the inner details that realizes of expose portion.The term expansion of utilizing the first order logic expression formula that first order logic is carried out is asserted to describe programmed logic, mainly to comprise, sequential control, branch's control and loop control.

The present invention expands WSDL-S, the functional character that uses the foregoing description clause can express the grid geographic information services, by the corresponding label of expansion in WSDL-S, realize describing clause and service-oriented architecture (Service-Oriented Architecture, SOA) compatibility of standard comprises the expansion of service interface clause, service conditions clause and three aspects of programmed logic clause.

(1) service interface clause uses the acquiescence extended method of WSDL-S, at＜types〉define input in the label.

(2) service conditions clause is at＜interface〉expand subtab＜wssem:precondition in the label〉and＜wssem:postcondition〉define preposition postcondition.

(3) programmed logic clause is at＜interface〉expand subtab＜wssem:program in the label〉the define program logic.

Above-mentioned the grid geographic information services is described the expression realized the service function feature, the service issue is a service advertisement with the service function characterizing definition, and the service function requirement definition that service describing also is used for the user simultaneously is a service request.

Step S102 is according to the final similarity of service interface clause similarity, service conditions clause's similarity and programmed logic clause similarity COMPREHENSIVE CALCULATING service advertisement and user's service request.Specifically comprise:

(1) calculation services interface clause similarity:

The corresponding relation of service interface clause's input parameter in calculation services advertisement and the user's service request: { (Ia _i, Ir _j) | 1＜i＜m, 1＜j＜n}, wherein, Ia _iBe the input parameter in the service advertisement, Ir _jBe the input parameter in the service request, m is the total number of the input parameter in the service advertisement, and n is the total number of the input parameter in the service request, and then the input parameter similarity is:

${\mathrm{Similarity}}_{\mathrm{input}}=\frac{\mathrm{\Σsc}({\mathrm{Ia}}_i,{\mathrm{Ir}}_i)}{k}$

Wherein, k is { (Ia _i, Ir _j) | 1＜i＜m, the key element quantity among 1＜j＜n},

The similarity of service interface clause's output parameter is in calculation services advertisement and the user's service request:

Similarity _output＝sc(Oa，Or)

Wherein, Oa and Or are respectively the output parameter in service advertisement and the service request,

Service interface clause similarity is in service advertisement and the user's service request:

${\mathrm{Similarity}}_{\mathrm{interface}}=\frac{{\mathrm{Similarity}}_{\mathrm{input}}+{\mathrm{Similarity}}_{\mathrm{output}}}{2}$

Wherein, Wherein, C ₁And C ₂For describing the logical concept of input, l ₁And l ₂Be respectively C ₁And C ₂The logical concept level, Dis (C ₁, C ₂) be the paths of two notions in body frame, its computing formula is: Dis (c ₁, c ₂)=length (c ₁, c _a)+length (c ₂, c _a), wherein, C _aBe C ₁, C ₂Common ancestor's node, length (c _i, c _j) be its path on the conceptional tree in body frame.A, b, c are respectively and regulate parameter (a＞0, b＞0, c＞0);

(2) calculate service conditions clause similarity:

According to the Hall rule with description logic notion C ₁And C ₂Be converted into set i ₁And i ₂, set i ₁And i ₂Similarity be:

$\mathrm{sf}(i_1,i_2)=\mathrm{sf}(p,l,q)=w\×\frac{l+1}{l+p+2}+(1-w)\×\frac{l+1}{l+q+2}$

Wherein p is for being included in i ₁In but be not included in i ₂In key element quantity; L is for being included in i ₁In be also contained in i ₂In key element quantity; Q is for being included in i ₂In but be not included in i ₁In key element quantity, w is a weight;

The minimum of extracting then among the service conditions clause is summarized the clause, for Hall rule C ₁And C ₂, if C=i ₀∧ ... ∧ i _wThe minimum that is C1 and C2 is summarized the clause, and its calculating formula of similarity is as follows:

fs(C ₁，C ₂)＝sf(v ₁-v，v，v ₂-v)×sf(o ₁-o，o，o ₂-o)+avg({sf _s(l _1i，l _2i)} _i＝1..v)

V wherein ₁, v ₂With v be respectively C ₁, C ₂With the number of predicate among the C, o ₁, o ₂With o be respectively C ₁, C ₂, and C in the number of variable, sf (k ₁-k, k, k ₂-k) and sf (o ₁-o, o, o ₂-o) weighed predicate and variable similarity in the Hall rule.l _1i∈ C ₁, l _2i∈ C ₂Be l among the minimum clause of summary _i(i=1 ... w) at C ₁, C ₂In the mapping predicate, sf _s(l _1i, l _2i) be the minimum clause of summary similarity, weigh the similarity between the pairing mapping predicate of the minimum clause of summary.

Then the precondition similarity is:

Similarity _Pre＝fs(C?Pr?e _adv，C?Pr?e _req)

Wherein, C Pr e _AdvBe the pairing Hall rule of service advertisement precondition, C Pr e _ReqBe the pairing Hall rule of service request precondition,

Then the postcondition similarity is:

Similarity _Post＝fs(C?P?ost _adv，C?P?ost _req)

Wherein, C P ost _AdvBe the pairing Hall rule of service advertisement precondition, C P ost _ReqBe the pairing Hall rule of service request precondition,

Service conditions clause's similarity is:

${\mathrm{Similarity}}_{\mathrm{condition}}=\frac{{\mathrm{Similarity}}_{\mathrm{Pre}}+{\mathrm{Similarity}}_{\mathrm{Post}}}{2}$

(3) calculation procedure logic clause similarity:

Similarity _program＝fs(C?Pr?ogram _adv，C?Pr?ogram _req)

Wherein, C Pr ogram _AdvBe the pairing Hall rule of the programmed logic clause of service advertisement, C Pr ogram _ReqHall rule for the programmed logic clause correspondence of service request.

Three clauses' that obtain according to above-mentioned (1) (2) (3) similarity, the final similarity of calculation services advertisement and user's service request is specially:

Similarity＝a ₁×Similarity _interface+a ₂×Similarity _condition+a ₃×Similarity _program

Wherein, a ₁, a ₂, a ₃Be respectively the adjusting parameter, a ₁＞0, a ₂＞0, a ₃＞0, and a ₁+ a ₂+ a ₃=1

Step 103 with described final similarity and predefined similarity threshold relatively, if greater than this threshold value, is then returned described service advertisement and is given the user, and wherein, threshold value can dynamically be specified when the retrieval service by the user.

Above execution mode only is used to illustrate the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; under the situation that does not break away from the spirit and scope of the present invention; can also make various variations and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.

Claims (6)

1. the grid geographic information services matching process based on semanteme is characterized in that, may further comprise the steps:

S1: each semantic description clause's similarity in calculation services advertisement and the user's service request, described semantic description clause is used to describe grid geographic information services functional character, comprising:

The service interface clause is used for the semantic description by service shared dictionary realization input;

Service conditions clause, comprise precondition and postcondition, precondition adopts the first order logic instrument of asserting to describe the feature of the preceding geographical spatial data of service operation, and the necessary condition of service operation, postcondition adopts the first order logic instrument of asserting mainly to describe the change of geographical spatial data behind the service operation;

The programmed logic clause is used for the operating process of formalized description grid geographic information services for spatial data;

S2: according to the final similarity of service interface clause similarity, service conditions clause's similarity and programmed logic clause similarity COMPREHENSIVE CALCULATING service advertisement and user's service request;

S3: described final similarity and predefined similarity threshold are compared,, then return described service advertisement and give the user if greater than this threshold value.

2. the grid geographic information services matching process based on semanteme as claimed in claim 1 is characterized in that, calculates service interface clause similarity step among the described step S1 and comprises:

The corresponding relation of service interface clause's input parameter in calculation services advertisement and the user's service request: { (Ia _i, Ir _j) | 1＜i＜m, 1＜j＜n}, wherein, Ia _iBe the input parameter in the service advertisement, Ir _jBe the input parameter in the service request, m is the total number of the input parameter in the service advertisement, and n is the total number of the input parameter in the service request, and then the input parameter similarity is:

${\mathrm{Similarity}}_{\mathrm{input}}=\frac{\mathrm{\Σsc}({\mathrm{Ia}}_i,{\mathrm{Ir}}_i)}{k}$

Wherein, k is { (Ia _i, Ir _j) | 1＜i＜m, the key element quantity among 1＜j＜n},

The similarity of service interface clause's output parameter is in calculation services advertisement and the user's service request:

Similarity _output＝sc(Oa，Or)

Wherein, Oa and Or are respectively the output parameter in service advertisement and the service request,

Service interface clause similarity is in service advertisement and the user's service request:

${\mathrm{Similarity}}_{\mathrm{interface}}=\frac{{\mathrm{Similarity}}_{\mathrm{input}}+{\mathrm{Similarity}}_{\mathrm{output}}}{2}$

Wherein, Wherein, C ₁And C ₂For describing the logical concept of input, l ₁And l ₂Be respectively C ₁And C ₂The logical concept level, Dis (C ₁, C ₂) be the paths of two notions in body frame, its computing formula is: Dis (c ₁, c ₂)=length (c ₁, c _a)+length (c ₂, c _a), wherein, C _aBe C ₁And C ₂Common ancestor node, length (c _i, c _j) be its path on the conceptional tree in body frame, a, b, c are respectively the adjusting parameter, and a＞0, b＞0, c＞0.

3. the grid geographic information services matching process based on semanteme as claimed in claim 2 is characterized in that, calculates service conditions clause similarity step among the described step S1 and comprises:

According to the Hall rule with description logic notion C ₁And C ₂Be converted into set i ₁And i ₂, set i ₁And i ₂Similarity be:

$\mathrm{sf}(i_1,i_2)=\mathrm{sf}(p,l,q)=w\×\frac{l+1}{l+p+2}+(1-w)\×\frac{l+1}{l+q+2}$

Wherein p is for being included in i ₁In but be not included in i ₂In key element quantity; L is for being included in i ₁In be also contained in i ₂In key element quantity; Q is for being included in i ₂In but be not included in i ₁In key element quantity, w is a weight;

The minimum of extracting then among the described service conditions clause is summarized the clause, for Hall rule C ₁And C ₂, if C=i ₀∧ ... ∧ i _wThe minimum that is C1 and C2 is summarized the clause, and its calculating formula of similarity is as follows:

fs(C ₁，C ₂)＝sf(v ₁-v，v，v ₂-v)×sf(o ₁-o，o，o ₂-o)+avg({sf _s(l _1i，l _2i)} _i＝1...v)

V wherein ₁, v ₂With v be respectively C ₁, C ₂With the number of predicate among the C, o ₁, o ₂With o be respectively C ₁, C ₂, and C in the number of variable, sf (k ₁-k, k, k ₂-k) and sf (o ₁-o, o, o ₂-o) weighed predicate and variable similarity in the Hall rule.l _1i∈ C ₁, l _2i∈ C ₂Be l among the minimum clause of summary _i(i=1 ... w) at C ₁, C ₂In the mapping predicate, sf _s(l _1i, l _2i) be the minimum clause of summary similarity, weigh the similarity between the pairing mapping predicate of the minimum clause of summary.

Then the precondition similarity is:

Similarity _Pre＝fs(C?Pr?e _adv，C?Pr?e _req)

Wherein, C Pr e _AdvBe the pairing Hall rule of service advertisement precondition, C Pr e _ReqBe the pairing Hall rule of service request precondition,

Then the postcondition similarity is:

Similarity _post＝fs(C?Post _adv，CPost _req)

Wherein, C P ost _AdvBe the pairing Hall rule of service advertisement precondition, C P ost _ReqBe the pairing Hall rule of service request precondition,

Service conditions clause's similarity is:

${\mathrm{Similarity}}_{\mathrm{condition}}=\frac{{\mathrm{Similarity}}_{\mathrm{Pre}}+{\mathrm{Similarity}}_{\mathrm{Post}}}{2}.$

4. the grid geographic information services matching process based on semanteme as claimed in claim 3 is characterized in that, program logical sub sentence similarity is among the described step S1:

Similarity _program＝fs(C?Pr?ogram _adv，C?Pr?ogram _req)

Wherein, C Pr ogram _AdvBe the pairing Hall rule of the programmed logic clause of service advertisement, CProgram _ReqHall rule for the programmed logic clause correspondence of service request.

5. the grid geographic information services matching process based on semanteme as claimed in claim 4 is characterized in that, the final similarity of calculating service advertisement and user's service request among the described step S2 is specially:

Similarity＝a ₁×Similarity _interface+a ₂×Similarity _condition+a ₃×Similarity _program

Wherein, a ₁, a ₂, a ₃Be respectively the adjusting parameter, a ₁＞0, a ₂＞0, a ₃＞0, and a ₁+ a ₂+ a ₃=1.

6. as each described grid geographic information services matching process among the claim 1-5 based on semanteme, it is characterized in that, described service interface clause, service conditions clause and programmed logic clause are specially by expansion semantic web service description language (sdl) WSDL-S definition:

Use the acquiescence extended method of WSDL-S, at＜types〉input in the label among the definition service interface clause;

At＜interface〉expand subtab＜wssem:precondition in the label〉and＜wssem:postcondition〉the preposition and postcondition of definition;

At＜interface〉expand subtab＜wssem:program in the label〉the define program logic.The clause.

Images