CN103198114A - WEB service matching method based on overlapped oriented graph - Google Patents

WEB service matching method based on overlapped oriented graph Download PDF

Info

Publication number
CN103198114A
CN103198114A CN2013101086999A CN201310108699A CN103198114A CN 103198114 A CN103198114 A CN 103198114A CN 2013101086999 A CN2013101086999 A CN 2013101086999A CN 201310108699 A CN201310108699 A CN 201310108699A CN 103198114 A CN103198114 A CN 103198114A
Authority
CN
China
Prior art keywords
overlapping
web service
digraph
seed
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2013101086999A
Other languages
Chinese (zh)
Other versions
CN103198114B (en
Inventor
唐雪飞
陈科
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201310108699.9A priority Critical patent/CN103198114B/en
Publication of CN103198114A publication Critical patent/CN103198114A/en
Application granted granted Critical
Publication of CN103198114B publication Critical patent/CN103198114B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides a WEB service matching method based on an overlapped oriented graph and relates to the field of computer information analysis and data processing. Description files (WSDL) of a large amount of WEB service nodes are loaded into a server side internal memory to form massive amounts of WEB description source data, a vacancy seed matching model for matching of specified service is built, the overlapped oriented graph is constructed on the basis, seeds are evaluated through two key indexes including connectivity and overlapping number to find optimal seeds, the WEB service matching is finished finally, and the WEB service matching method is quick in finding and appropriate. The WEB service matching method can be widely applied to an environment with a large amount of WEB service nodes and high WEB service finding requirement, such as a service oriented architecture (SOA) and a cloud computing environment.

Description

A kind of WEB service matching method based on overlapping digraph
Technical field
The invention belongs to computerized information analysis and data processing field, be specifically related to a kind of WEB service matching method based on overlapping digraph.
Background technology
Web service (WebService) is based on a kind of service of XML and HTTP, each web service is corresponding WSDL(WebServicesDescriptionLanguage) description document.The WSDL description document is one and is used for describing Web service and the XML language file that illustrates how client communicates by letter with Web service.
Each WSDL description document has all encapsulated some for calling interface and explanation document thereof, but when the WSDL description document exists in a large number, how to find the service interface that needs rapidly, is a problem that needs solution.
1.WEB service describing
(Service-OrientedArchitecture SOA) has brought a kind of new integrated thought to service-oriented architectural framework, can construct the framework of service-centric flexibly according to it.SOA relies on the characteristic of its loose coupling, can issue enterprise's existing application as service, and service has the interface that is independent of hardware platform, operating system and programming language.Therefore, can be by the communication between the mutual realization system of this definition favorable service between the different system, not only can realize the integrated collaborative work with heterogeneous service systems of mass data, can also add new service or upgrade existing service according to modular mode, to solve new business demand.
The core of SOA is exactly the WEB service, and it exposes the application programming interfaces that can call by Web, and (ApplicationProgramInterface, API), the method for the enough programmings of energy is called this application program by Web to the external world.The Web service platform is a cover standard, and it has defined application program and how to have realized interoperability at Web.You can write Web service at any platform that you like with any language that you like, as long as we can inquire about and visit these services by the Web service standard.
The Web service platform needs a cover agreement to realize the establishment of distributed application program.Any platform has its data representation method and type system.Realize interoperability, the Web service platform must provide the standard set type system, is used for linking up the dissimilar systems of different platform, programming language and component model.In traditional distributed system, provide certain methods to describe interface, method and parameter (as the IDL language among COM and the COBAR) based on the platform of interface (interface).Same, the Web service platform also must provide a kind of standard to describe Web service, allows the client can obtain enough information and calls this Web service.
Thereby how realize that mate and find the WSDL description document that these key wordses mate most from a large amount of WSDL description document that exist of service end in the key words of client and the network suitable web service is the Internet information search techniques field problem demanding prompt solution.
2.WEB service coupling
The quantity of WEB on network service may be very big, how searches out the WEB service of coupling according to key word or essential information, is an important problems.The WSDL description document of WEB service as data source, as fundamental, is sought the process of suitable WEB service with the key word of needs coupling and essential information, i.e. the WEB coupling of serving.
In order to find suitable WEB service (being the WSDL description document) rapidly under the situation in mass data source, the present invention introduces the information local search approach based on the room seed, finishes the coupling of WEB service.This method is mainly assessed matching sequence based on prior art " sequence alignment method ".
The definition of sequence alignment is that the two sequences character is mated in twos.In on matching process, following three kinds of situations may occur: (1) character has replaced another character, sudden change has namely taken place and generation character mismatch; (2) insert one or more characters; (3) delete one or more characters.Therefore, in the sequence alignment process, be not that simple character is corresponding one by one, except coupling and mismatch, can introduce in sequence also that room (representing with symbol "-") reflects the 2nd, 3 kind of variation.
As two sequence A ATCTATA and AAGATA, provided wherein 3 kinds of sequence alignment situations below:
AATCTATA AATCTATA AATCTATA
AAG-AT-A AA-G-ATA AA--GATA
For the sequence alignment result is quantized, introduce mark mechanism sequence alignment is given a mark, to obtain optimum sequence alignment.After introducing the room, the comparison situation according to different can obtain the sequence alignment score.It is defined as follows the marking rule:
Figure BDA00002988031400031
Score (S 1, S 2) two sequence S of expression 1, S 2Matching score, i is certain position that natural number is used for representing sequence, the max number of characters of the longer sequence of n representative, described character can also can be English character for Chinese character.
K wherein i〉=0 (1≤i≤3) have represented the situation in coupling, mismatch and room respectively.From the marking formula as can be seen, coupling will obtain a positive mark, and mismatch or room will obtain 0 fen or negative the branch.Because possible sequence alignment situation is ever-changing, different comparisons may obtain identical mark.
The WEB service technology is widely used in the modern information technologies such as Distributed Calculation, WebService, SOA, in the environment that WEB service magnanimity exists, how to find the WEB of coupling to serve fast according to key word, it is the important means of modern WEB framework development, but the method inefficiency of traditional keyword search can't adapt to the situation of magnanimity WEB information inquiry.
Summary of the invention
In order to overcome the drawback of traditional WEB service matching method, the present invention has designed a kind of WEB service matching method based on overlapping digraph, employing is based on matching technique and the overlapping digraph model of room seed, and service is mated to WEB, improves WEB service rate matched and treatment effeciency greatly.
Technical scheme of the present invention is: a kind of WEB service matching method based on overlapping digraph may further comprise the steps:
Step 1: being wsdl document with the description document of WEB service is written into the internal memory of server end by network, forms WEB and describes source data;
Step 2: set up room seed Matching Model, WEB service describing source data and the target service data form with the room seed is described, obtain room seed the matching frame;
Step 3: make up the overlapping digraph towards different rooms seed, calculate its connective and overlapping number at each overlapping digraph;
Step 4: connectedness and minimum overlapping number with maximum are that standard is sought optimum room seed, and describe optimum room seed by overlapping digraph weight ODW;
Step 5: optimum room seed and target WEB service describing source data are mated, obtain optimum WEA service matching result, find the WEB service station that needs.
As preferably: the concrete grammar of step 1 is: adopt HTML (Hypertext Markup Language) to connect the long-range wsdl document address of all needs, the WEB service description file is resolved by the document object tree-model, it resolves form is the hypertext tag format, document object tree at resolving comprises all<wsdl:documentation〉node be written into the internal memory of server end.
As preferably: the room seed described in the step 2, it is defined as:
A room seed S is defined on character set Α={ 1, the * }, and regulation is with 1 beginning, the fixed mode string of 1 end; Wherein 1 expression is mated, and * is an asterisk wildcard, and being illustrated in this position can be 1 coupling or 0 mismatch; S is expressed as:
S = ( 1 ) i 1 ( * ) k 1 ( 1 ) i 2 ( * ) k 2 . . . ( 1 ) i n - 1 ( * ) k n - 1 ( 1 ) i n
Wherein (1) j(*) kRepresent continuous j individual 1 and continuous k *;
The length of room seed (length) be among the S all 1 and the number of *, be expressed as | S|:
length ( S ) = | S | = Σ j = 1 n i j + Σ j = 1 n - 1 k j
The weight w of room seed is defined as all numbers of 1:
weight ( S ) = w = Σ j = 1 n i j
The pattern of room seed is that all * among the S are replaced with the 1 or 0 expression string that forms, and always has 2 | s|-wIndividual different pattern.
As preferably: step 3 may further comprise the steps:
A) set up the structure digraph: top-down node be according to the seed corresponding element from left to right 1 or 0,1 representation node 1 wherein, * represents two nodes: 1 and 0, every directed edge indicates similarity p or q=1-p;
B) markers step: in order from each node of sequence number 1 beginning label, be put into the nodal value back and bracket with bracket from the top node to the bottom, delete flag p or q simultaneously, are marked at first node ID on every directed edge then;
C) overlapping step: overlapping step is the process of a series of iterations, be 1 node joint structure structure digraph to start with every node layer value successively, next step is from second layer node intermediate value 1 node, by that analogy, finally rest on the L-1 layer, after the lap over step, obtain the overlapping digraph model of room seed.
As preferably: the connectedness of overlapping digraph is defined as:
Two limit e that common node is arranged are arranged 1And e 2, i.e. e 1End node be e 2Start node, establish B 1Be e 1The set of mark, B 2Be e 2The set of mark claims B 1And B 2And if only if to have connectedness or connection
Figure BDA00002988031400053
The overlapping number of overlapping digraph is defined as:
If B is the tag set of limit e, define overlapping number:
oc(e)=|B|。
As preferably: calculate overlapping digraph weight ODW and may further comprise the steps:
A) make up overlapping penalty:
Figure BDA00002988031400061
C=oc (e) wherein, as seen when p<1,
Figure BDA00002988031400062
It is the subtraction function of c;
B) make up " the award function " of rewarding the limit connectedness:
Figure BDA00002988031400063
Wherein
Figure BDA00002988031400064
It is overlapping penalty
Figure BDA00002988031400065
Value, for node N, definition w (N)=w (e) * w (e ') be used for to calculate the weights of node;
C) make up overlapping digraph weight:
ODW ( G ) = Σ j = 1 ϵ w ( N j )
According to this model, for the room seed of equal length and weight, more high quality seeds has higher overlapping digraph weight, just can find high quality seed in the ODW of calculated candidate seed (G) back.
As preferably: step 5 may further comprise the steps:
A) at first determine a stop value d, continuous seed length w and a threshold value t, the d value normally indicates the termination E value of an expection based on statistical principle, calculates suitable d value on the basis of considering search background character then;
B) according to the room spermotype WEB service describing source data in the internal memory is carried out the part coupling, when the score value of a coupling string is higher than t, then found a word string of choosing, namely strengthen a little;
C) after the word string that a score value is higher than t is chosen, carry out extending optimizing based on the part of dynamic programming algorithm, the minimum score value of regulation comparison is d, when extending, comparison can run into some negative score values, make the score value of comparison descend, when the score value that descends during less than d, the extension of hitting will stop, at this moment the fragment that has highest score in this section comparison just becomes one section coupling of hitting, thereby finds satisfactory WEB service station.
Beneficial effect of the present invention is: the present invention has designed a kind of method of mating target in a large amount of WSDL description document, has proposed room kind submodel, and has sought optimum room seed by overlapping digraph, finishes the coupling to target WEB service.When needs are sought target in magnanimity WSDL description document, overcome traditional slow-footed shortcoming of existing of matching way one by one successively, the present invention is by the good room seed of design performance, utilize kind of a submodel to go to mate the WSDL description document, thereby improve matching efficiency greatly, and then improving the performance of Web service effectively, this has great significance to growing Internet service expansion.
Description of drawings
Fig. 1 is the structure digraph of room seed 1*1*1;
Fig. 2 is the structure digraph of room seed 11**1;
Fig. 3 is the modification first of room seed 1*1*1 structure digraph;
Fig. 4 is the modification first of room seed 11**1 structure digraph;
Fig. 5 is the overlapping digraph of room seed 1*1*1;
Fig. 6 is the overlapping digraph of room seed 11**1.
Embodiment
For the ease of those skilled in the art's understanding, the present invention is described further below in conjunction with accompanying drawing and specific embodiment.
The present invention will be written into according to the WSDL description document, the calculating of the foundation of room seed, overlapping oriented map generalization, connectedness and overlapping number, be described in detail based on five steps of coupling of optimum room seed:
Step 1: the WEB server of server end from network is written into a large amount of WSDL description document and forms magnanimity WSDL description document source data at server end, and this step is prior art.
The concrete grammar of step 1 is: adopt HTML (Hypertext Markup Language) to connect the long-range wsdl document address of all needs, the WEB service description file is resolved by the document object tree-model, it resolves form is the hypertext tag format, document object tree at resolving comprises all<wsdl:documentation〉node be written into the internal memory of server end.
Step 2: the foundation of room seed
1) the room seed defines according to following formula:
A room seed S is defined on character set Α={ 1, the * }, and regulation is with 1 beginning, the fixed mode string of 1 end.Wherein 1 expression is mated, and * is an asterisk wildcard, and being illustrated in this position can be 1 (coupling) or 0 (mismatch).S can be expressed as:
S = ( 1 ) i 1 ( * ) k 1 ( 1 ) i 2 ( * ) k 2 . . . ( 1 ) i n - 1 ( * ) k n - 1 ( 1 ) i n
For embodiment: be exactly a room seed as 1**1*1.
Wherein (1) i(*) kRepresent continuous i individual 1 and continuous k *, i jThe different values of expression i, j ∈ [1, n], wherein n is natural number; k jThe different values of expression k, j ∈ [1, n-1] wherein n is natural number.As can be seen, seed S in room is made of " * piece (the * blocks) " that several continuous a plurality of 1 " 1 (1blocks) " that form and continuous a plurality of * form.Because regulation S must add 1 so the number of " 1 " equals the number of " * piece " with 1 beginning and 1 ending.
The length (length) of room seed S be among the S all 1 and the number of *, be expressed as | S|:
length ( S ) = | S | = Σ j = 1 n i j + Σ j = 1 n - 1 k j
The weight w of room seed is defined as all numbers of 1:
weight ( S ) = w = Σ j = 1 n i j
The pattern of room seed is that all * among the S are replaced with the 1 or 0 expression string that forms.Obviously, always have 2 | s|-wIndividual different pattern.
Step 3: overlapping oriented map generalization:
In order to find optimum fast or to approach optimum room seed, we have introduced the overlapping concept of seed.Hitting of seed can be overlapping, but the overlapping coupling that will detect same place of hitting.Therefore, seed sensitivity is inversely proportional to overlapping hits, and namely good seed should have low overlapping hits.Even different room seeds has identical length and weight, it still has different sensitivity and plyability.
1) structure room kernel texture digraph:
Top-down digraph by the kernel texture generation.Top-down node be according to the seed corresponding element from left to right 1 or 0,1 representation node 1 wherein, * represents two nodes: 1 and 0.Every directed edge indicates similarity p or q=1-p, pronounces " occurring with Probability p (or q) ".
In order to explain that different seeds has the different structure of identical length and weight, we do not adopt the simplest room seed 1*1 as our first example because it has only a candidate seed, i.e. 1*1, its length be 3 and weight be 2.We are that 5 weights are that 3 room seed begins with length.Two candidate seed (removing symmetry) are arranged: 1*1*1 and 11**1 here.
Fig. 1 and Fig. 2 have shown two different kernel texture digraphs of seed 1*1*1 and 11**1 correspondence.
According to the definition of room seed, each structure digraph is all by node 1 beginning and end.Room seed for a length L and weight w has the L layer from the top-level node to the bottom, each layer all has a node at least, as node 1.Lower level node links to each other with upper layer node with limit p (lower level node is 1) or limit q (lower level node is 0).Obviously, the individual node of w+2 (L-w) is arranged in a basic structure digraph.
The structure digraph of room seed is a basic model that is used for detecting the textural difference between equal length and the weight seed.Value in the node is 1 or 0, is called nodal value.The overlapping digraph of room seed is the expansion to the structure digraph.In order to make digraph preserve more kernel texture information, we need make amendment to it, comprise markers step and overlapping step.
2) markers step
At first, we in order from each node of sequence number 1 beginning label, are put into the nodal value back and bracket with bracket from the top node to the bottom, and delete flag p or q then are because we can obtain from lower level node (1 corresponding p, 0 corresponding q) analysis; Simultaneously, first node ID is marked on every directed edge.Because this is the first step of setting up overlapping digraph, so all limits all carry out mark with start node (1), and since second step, it is 1 node that start node will be changed into lower floor's intermediate value.
Fig. 3 and Fig. 4 have shown the modification result of room seed 1*1*1 and 11**1.The start node of structure digraph is top-level node.This digraph can be used as the elementary version of overlapping digraph, i.e. zero lap digraph.
3) overlapping step
Overlapping step is the process of a series of iterations.Iterative process is based on step, is 1 node joint structure structure digraph to start with every node layer value successively, is 1 point but start node adopts lower floor's intermediate value.The modification first of structure digraph is to begin to carry out from ground floor, so next step must be from second layer node intermediate value 1 node, by that analogy.
When to last one deck, its ground floor is identical as can be seen for we, so we are parked in the L-1 layer.
After the operation of lap over step, just created overlapping digraph.
Fig. 5 and Fig. 6 are the digraph full releases of room seed 1*1*1 and 11**1.The number of plies of overlapping digraph: N (layers)=2L-2.
Step 4: calculate connective and overlapping number
1) connective calculating: two limit e that common node is arranged are arranged 1And e 2, i.e. e 1End node be e 2Start node, establish B 1Be e 1The set of mark, B 2Be e 2The set of mark.Claim B 1And B 2And if only if to have connectedness or connection
Figure BDA00002988031400101
For example, in the overlapping digraph of room seed 1*1*1, there is connectedness on two limits of common node node (3), because B 1={ 1} and B 2={ 1} is so But be not communicated with for two limits (Far Left) with common node (2), because B 1={ 1} and B 2={ 2} is so
Figure BDA00002988031400116
All limits all are the paths that the path that is communicated with is called connection on the path.L bar limit in the path of a connection that and if only if all comprises certain identical mark, just says the pattern that comprises the room seed in the path.
2) overlapping number calculates: establishing B is the tag set of limit e, defines overlapping number:
oc(e)=|B|
Connective and overlapping number is two principal elements judging the room seed quality.If certain room seed has high connectedness, claim that it is high-quality, thereby can find more pattern because can detect more communication path.On the other hand, high-quality room seed will have low overlapping number, because the overlapping coupling that will detect same place of hitting, so low overlapping number will have high susceptibility.
Step 5: based on the coupling of optimum room seed
1) calculating of limit weight: the weight on limit is the function of connective and overlapping number.Be defined as follows:
Wherein oc (e) is the overlapping number of e,
Figure BDA00002988031400112
Be " overlapping penalty ";
2) function is rewarded in the overlapping punishment of definition and connection:
Figure BDA00002988031400113
C=oc (e) wherein.As seen when p<1,
Figure BDA00002988031400114
It is the subtraction function of c.
Figure BDA00002988031400117
Be " the award function " of rewarding the limit connectedness, that is to say, if e and its limit with common node be communicated with w (e) should increase.If being certain of e, e ' has the limit of common node, in the present invention, and definition
Figure BDA00002988031400118
As follows:
Figure BDA00002988031400121
Wherein
Figure BDA00002988031400122
It is overlapping penalty Value.
For node N, definition w (N)=w (e) * w (e ') is for the weights that calculate node.
3) calculate overlapping digraph weight
The weights sum that overlapping digraph weight definition is every limit among the figure.A given overlapping digraph G, the weight ODW (G) that establishes ε and be the so overlapping digraph of limit number of G is defined as follows:
ODW ( G ) = Σ j = 1 ϵ w ( N j )
The ODW of certain overlapping digraph (G) is worth mainly based on the structure of room seed, overlapping number, connectedness and similarity etc.Because relate to more parameter and allow User-Defined Functions to calculate, overlapping digraph model will be more complete, accurately and flexibly.
According to this model, for the room seed of equal length and weight, more high quality seeds has higher overlapping digraph weight, just can find high quality seed in the ODW of calculated candidate seed (G) back.
4) based on the coupling of optimum room seed
Calculate at each candidate seed according to overlapping digraph weight maximal value, seek optimum room seed, and to be that standard is carried out WEB service describing coupling a bit, it is characterized in that may further comprise the steps:
A) at first determine a stop value d, continuous seed length w and a threshold value t.The d value normally indicates the termination E value of an expection based on statistical principle, calculate suitable d value on the basis of considering search background character then.
B) according to the room spermotype WEB service describing source data in the internal memory is carried out the part coupling, when the score value of a coupling string is higher than t, then found a word string of choosing, namely strengthen a little.
C) after the word string that a score value is higher than t is chosen, carry out the part and extend optimizing, the minimum score value of regulation comparison is d, when extending, comparison can run into some negative score values, make the score value of comparison descend, when the score value that descends during less than d, the extension of hitting will stop, at this moment the fragment that has highest score in this section comparison just becomes one section coupling of hitting, thereby finds satisfactory WEB service station.
Those of ordinary skill in the art will appreciate that embodiment described here is in order to help reader understanding's principle of the present invention, should to be understood that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not break away from essence of the present invention according to these technology enlightenments disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.

Claims (7)

1. WEB service matching method based on overlapping digraph is characterized in that: may further comprise the steps:
Step 1: being wsdl document with the description document of WEB service is written into the internal memory of server end by network, forms WEB and describes source data;
Step 2: set up room seed Matching Model, WEB service describing source data and the target service data form with the room seed is described, obtain room seed the matching frame;
Step 3: make up the overlapping digraph towards different rooms seed, calculate its connective and overlapping number at each overlapping digraph;
Step 4: connectedness and minimum overlapping number with maximum are that standard is sought optimum room seed, and describe optimum room seed by overlapping digraph weight ODW;
Step 5: optimum room seed and target WEB service describing source data are mated, obtain optimum WEA service matching result, find the WEB service station that needs.
2. a kind of WEB service matching method based on overlapping digraph according to claim 1, it is characterized in that: the concrete grammar of step 1 is: adopt HTML (Hypertext Markup Language) to connect the long-range wsdl document address of all needs, the WEB service description file is resolved by the document object tree-model, it resolves form is the hypertext tag format, document object tree at resolving comprises all<wsdl:documentation〉node be written into the internal memory of server end.
3. a kind of WEB service matching method based on overlapping digraph according to claim 1 and 2 is characterized in that: the room seed described in the step 2, and it is defined as:
A room seed S is defined on character set Α={ 1, the * }, and regulation is with 1 beginning, the fixed mode string of 1 end; Wherein 1 expression is mated, and * is an asterisk wildcard, and being illustrated in this position can be 1 coupling or 0 mismatch; S is expressed as:
S = ( 1 ) i 1 ( * ) k 1 ( 1 ) i 2 ( * ) k 2 . . . ( 1 ) i n - 1 ( * ) k n - 1 ( 1 ) i n
Wherein (1) j(*) kRepresent continuous j individual 1 and continuous k *;
The length of room seed (length) be among the S all 1 and the number of *, be expressed as | S|:
length ( S ) = | S | = Σ j = 1 n i j + Σ j = 1 n - 1 k j
The weight w of room seed is defined as all numbers of 1:
weight ( S ) = w = Σ j = 1 n i j
The pattern of room seed is that all * among the S are replaced with the 1 or 0 expression string that forms, and always has 2 | s|-wIndividual different pattern.
4. according to claim 1 or 2 described a kind of WEB service matching methods based on overlapping digraph, it is characterized in that: step 3 may further comprise the steps:
A) set up the structure digraph: top-down node be according to the seed corresponding element from left to right 1 or 0,1 representation node 1 wherein, * represents two nodes: 1 and 0, every directed edge indicates similarity p or q=1-p;
B) markers step: in order from each node of sequence number 1 beginning label, be put into the nodal value back and bracket with bracket from the top node to the bottom, delete flag p or q simultaneously, are marked at first node ID on every directed edge then;
C) overlapping step: overlapping step is the process of a series of iterations, be 1 node joint structure structure digraph to start with every node layer value successively, next step is from second layer node intermediate value 1 node, by that analogy, finally rest on the L-1 layer, after the lap over step, obtain the overlapping digraph model of room seed.
5. a kind of WEB service matching method based on overlapping digraph according to claim 4, it is characterized in that: the connectedness of overlapping digraph is defined as:
Two limit e that common node is arranged are arranged 1And e 2, i.e. e 1End node be e 2Start node, establish B 1Be e 1The set of mark, B 2Be e 2The set of mark claims B 1And B 2And if only if to have connectedness or connection
Figure FDA00002988031300037
The overlapping number of overlapping digraph is defined as:
If B is the tag set of limit e, define overlapping number:
oc(e)=|B|。
6. a kind of WEB service matching method based on overlapping digraph according to claim 1 is characterized in that: calculate overlapping digraph weight ODW and may further comprise the steps:
A) make up overlapping penalty:
Figure FDA00002988031300031
C=oc (e) wherein, as seen when p<1,
Figure FDA00002988031300032
It is the subtraction function of c;
B) make up " the award function " of rewarding the limit connectedness:
Figure FDA00002988031300033
Wherein
Figure FDA00002988031300034
It is overlapping penalty
Figure FDA00002988031300035
Value, for node N, definition w (N)=w (e) * w (e ') be used for to calculate the weights of node;
C) make up overlapping digraph weight:
ODW ( G ) = Σ j = 1 ϵ w ( N j )
According to this model, for the room seed of equal length and weight, more high quality seeds has higher overlapping digraph weight, just can find high quality seed in the ODW of calculated candidate seed (G) back.
7. according to claim 1 or 6 described a kind of WEB service matching methods based on overlapping digraph, it is characterized in that step 5 may further comprise the steps:
A) at first determine a stop value d, continuous seed length w and a threshold value t, the d value normally indicates the termination E value of an expection based on statistical principle, calculates suitable d value on the basis of considering search background character then;
B) according to the room spermotype WEB service describing source data in the internal memory is carried out the part coupling, when the score value of a coupling string is higher than t, then found a word string of choosing, namely strengthen a little;
C) after the word string that a score value is higher than t is chosen, carry out extending optimizing based on the part of dynamic programming algorithm, the minimum score value of regulation comparison is d, when extending, comparison can run into some negative score values, make the score value of comparison descend, when the score value that descends during less than d, the extension of hitting will stop, at this moment the fragment that has highest score in this section comparison just becomes one section coupling of hitting, thereby finds satisfactory WEB service station.
CN201310108699.9A 2013-03-29 2013-03-29 A kind of WEB service matching process based on overlapping directed graph Active CN103198114B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310108699.9A CN103198114B (en) 2013-03-29 2013-03-29 A kind of WEB service matching process based on overlapping directed graph

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310108699.9A CN103198114B (en) 2013-03-29 2013-03-29 A kind of WEB service matching process based on overlapping directed graph

Publications (2)

Publication Number Publication Date
CN103198114A true CN103198114A (en) 2013-07-10
CN103198114B CN103198114B (en) 2016-06-22

Family

ID=48720672

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310108699.9A Active CN103198114B (en) 2013-03-29 2013-03-29 A kind of WEB service matching process based on overlapping directed graph

Country Status (1)

Country Link
CN (1) CN103198114B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106095854A (en) * 2016-06-02 2016-11-09 腾讯科技(深圳)有限公司 A kind of method and device of the positional information determining block of information

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070288469A1 (en) * 2006-06-12 2007-12-13 Research In Motion Limited System and method for mixed mode delivery of dynamic content to a mobile device
CN101393563A (en) * 2008-09-26 2009-03-25 复旦大学 Web data processing method based on form concept analysis
CN102945283A (en) * 2012-11-19 2013-02-27 武汉大学 Semantic Web service combination method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070288469A1 (en) * 2006-06-12 2007-12-13 Research In Motion Limited System and method for mixed mode delivery of dynamic content to a mobile device
CN101393563A (en) * 2008-09-26 2009-03-25 复旦大学 Web data processing method based on form concept analysis
CN102945283A (en) * 2012-11-19 2013-02-27 武汉大学 Semantic Web service combination method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106095854A (en) * 2016-06-02 2016-11-09 腾讯科技(深圳)有限公司 A kind of method and device of the positional information determining block of information

Also Published As

Publication number Publication date
CN103198114B (en) 2016-06-22

Similar Documents

Publication Publication Date Title
CN111159395B (en) Chart neural network-based rumor standpoint detection method and device and electronic equipment
JP6838161B2 (en) End-to-end modeling methods and systems
CN108491228B (en) Binary vulnerability code clone detection method and system
CN106021366A (en) API (Application Programing Interface) tag recommendation method based on heterogeneous information
CN109902274A (en) A kind of method and system converting json character string to thrift binary stream
CN103942308A (en) Method and device for detecting large-scale social network communities
CN107391542A (en) A kind of open source software community expert recommendation method based on document knowledge collection of illustrative plates
CN105550171A (en) Error correction method and system for query information of vertical search engine
CN104881285A (en) Code snippet marking and reusing system based on body
CN101751385A (en) Multilingual information extraction method adopting hierarchical pipeline filter system structure
CN105654144A (en) Social network body constructing method based on machine learning
CN112286575A (en) Intelligent contract similarity detection method and system based on graph matching model
CN103838857A (en) Automatic service combination system and method based on semantics
CN107480115B (en) Method and system for format conversion of caffe frame residual error network configuration file
CN110245349A (en) A kind of syntax dependency parsing method, apparatus and a kind of electronic equipment
CN102663108B (en) Medicine corporation finding method based on parallelization label propagation algorithm for complex network model
CN102496033B (en) Image SIFT feature matching method based on MR computation framework
Yu et al. Hgprompt: Bridging homogeneous and heterogeneous graphs for few-shot prompt learning
CN110609936A (en) Intelligent classification method for fuzzy address data
CN103198114A (en) WEB service matching method based on overlapped oriented graph
CN113283243B (en) Entity and relationship combined extraction method
CN109784308A (en) A kind of address error correction method, device and storage medium
CN115544307A (en) Directed graph data feature extraction and expression method and system based on incidence matrix
CN109325159A (en) A kind of microblog hot event method for digging
Luo et al. Evaluation and improvement of routing procedure for nonlinear Muskingum models

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant