CN104166670A - Information inquiry method based on semantic network - Google Patents

Information inquiry method based on semantic network Download PDF

Info

Publication number
CN104166670A
CN104166670A CN201410268256.0A CN201410268256A CN104166670A CN 104166670 A CN104166670 A CN 104166670A CN 201410268256 A CN201410268256 A CN 201410268256A CN 104166670 A CN104166670 A CN 104166670A
Authority
CN
China
Prior art keywords
body class
semantic
inquiry
ontology
represent
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.)
Pending
Application number
CN201410268256.0A
Other languages
Chinese (zh)
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.)
Qingdao Agricultural University
Original Assignee
Qingdao Agricultural University
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 Qingdao Agricultural University filed Critical Qingdao Agricultural University
Priority to CN201410268256.0A priority Critical patent/CN104166670A/en
Publication of CN104166670A publication Critical patent/CN104166670A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • G06F16/3331Query processing

Abstract

The invention discloses an information inquiry method based on a semantic network. The information inquiry method is used for searching for ontology instances matched with semantic inquiry statements in an ontology library according to specific semantic inquiry statements and ranking the inquiry results. The method includes the following steps that first, ontology instance graphs are traversed; second, according to the weight and the number of semantic relation paths between the ontology instances and all inquiry keywords, the dependency between the current ontology instance and the current keyword is comprehensively calculated; third, according to the dependency between the ontology instances and all the inquiry keywords and the weight of all the inquiry keywords, the dependency between each ontology instance and an inquiry keyboard set is comprehensively calculated; fourth, the ontology instances are ranked according to the high-to-low sequence of the dependency. With the information inquiry method, the precision ratio and the recall ratio of semantic network information inquiry can be effectively increased.

Description

A kind of information query method based on semantic net
Technical field
The present invention relates to information network technique field, particularly relate to a kind of information query method based on semantic net.
Background technology
Traditional information query technique mainly uses the querying method based on key word, and the method mainly characterizes the key word of user's inquiry request and the information content of resource by handle and carries out strict mechanical matching and realize.Because the querying method of key word itself lacks the representation of knowledge and semantic processing ability, the coupling of only carrying out key word cannot reflect the semantic relation in user's inquiry request, thereby causes the precision ratio of Query Result on the low side.Semantic net is a kind of new network architecture being proposed by Tim Berners-Lee, and it can be the source document interpolation semantic information in network, thereby makes computing machine can understand semantic information document.Body is the gordian technique that realizes semantic net, and it is the important method of the representation of knowledge, can be with a kind of formal, accessible semanteme that represents to describe between concept of machine.Because body has good concept hierarchy and the support to reasoning from logic, thereby be widely used in information retrieval.
In recent years, there is the research of many inquiring technologies based on semantic net both at home and abroad.Liu etc. by build one based on keyword and between the concept relation graph of semantic relation, realized the identification to semantic relation in keyword query process, but this algorithm lacks the weight analysis to semantic relation and the sequence to Query Result.Castells etc. have proposed a kind of information retrieval framework based on body, this framework uses tf*idf algorithm to compose with weight each semantic relation, and Query Result is sorted according to vector space model, but this algorithm is thicker to the weight calculation granularity of semantic relation, and ignore the difference between semantic relation.Zhou etc. have proposed a kind of link sort method based on relational model, this algorithm has link structure main, external key relational model by structure, thereby realize sequence to Query Result, but this algorithm is not considered specificity between link and the problem such as covering scope and recognition capability of diversity and key word.Therefore, how to improve the validity of semantic net inquiry and accuracy and be still the Focal point and difficult point of information retrieval field research.
Body is the data model of describing semantic relation between concept and concept, it can describe by the relation between concept the semanteme of concept, body is made up of Schema and example thereof conventionally, it is indicated in an OWL-Lite subset that comprises RDF feature, object properties, data type attribute and backward attribute, conventionally has to give a definition:
Definition 1Schema S is defined as tlv triple <C, D, and P>, wherein C is class set, and D is data type collection, and P is property set.All classes, attribute and data type are all accurately represented by URI, and for any d ∈ C, r ∈ C ∪ D, has attribute p (d, r) ∈ P, and wherein d and r are called as respectively field and the scope of p.
Define 2 based on Schema S=<C, D, the instance graph of P> is defined as a digraph G=<V, E>, wherein V is example set, E is the set of relations between example in V.In sterogram, the example of a class of a resource representation.Make a set of [c] expression example c ∈ C ∪ D, for each v ∈ V, in the time of v.type=c, v ∈ [c].Make the set of [p (d, r)] expression attribute instance p (d, r) ∈ P, for each e (v i, v j) ∈ E, work as e=p, v i∈ [d], v jwhen ∈ [r], e (v i, v j) ∈ [p (d, r)], wherein v iand v jbe respectively the subject and object of e.
Defining 3 semantic path sp is Schema S=<C, D, a sequence of attributes p in P> 1(d 1, r 1) p 2(d 2, r 2) ... p m(d m, r m), wherein p i(d i, r i) ∈ P and r iand d i+1be identical class or there is identical parent.
Definition 4 is for semantic path sp=p 1(d 1, r 1) p 2(d 2, r 2) ... p m(d m, r m), ip=e 1(s 1, o 1) e 2(s 2, o 2) ... e m(s m, o m) be a semantic path examples of sp, work as e i(s i, o i) ∈ [p i(d i, r i)] and for all e ithere is o i=s i+1time, s 1, o mit is respectively the source and destination of ip.
Define 5 users and inquire about Q and be defined as two tuple <T, K>, wherein T is class set, K is set of keywords.For a given Schema S=<C, D, P> and an instance graph G=<V based on S, E>, semantic search is searched Q=<T exactly, the answer set A of K>, wherein T ∈ C.For each resource a ∈ A, need in G, have at least one to be the semantic path examples of s from resource a to numerical value, wherein a ∈ [T] and numerical value s comprise key word k ∈ K.
Summary of the invention
For overcoming the problem of above existence, the present invention proposes following technical scheme:
Based on an information query method for semantic net, for searching the body class example matching with semantic query statement and Query Result is sorted at ontology library according to specific semantic query statement, it comprises the following steps:
S101, traversal instances of ontology figure, and return with semantic query statement in body types match, and the body class example being associated with the key word of the inquiry in semantic query statement.
S102, search respectively all semantic relation paths between current body class example and each key word of the inquiry for described each body class example, and the weight of computing semantic relation path respectively.
S103, according to the weight in semantic relation path between described body class example and each key word of the inquiry and the quantity in semantic relation path, the correlativity between COMPREHENSIVE CALCULATING current body class example and key word of the inquiry.
S104 is according to the correlativity between described body class example and each key word of the inquiry and the weight of each key word of the inquiry, the correlativity between COMPREHENSIVE CALCULATING each body class example and key word of the inquiry set.
S105, according to described correlativity order from big to small, described body class example is sorted.
Further, the weight of the computing semantic relation described in step 102 specifically comprises:
S2011, calculate in body frame figure the weight of attribute between each body class and between body class and data type.
S2012, weight according to the weight calculation body class of the each attribute in body frame figure to the semantic relation path between data type.
The weight in the semantic relation path in S2013, use body frame figure substitutes the weight of corresponding semantic relation path examples in instances of ontology figure.
Further, described step S2011 circular is:
w(p(d,r))=α·I(p(d,r))+β·MI(p(d,r))
In formula, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure, I (p (d, r)) represent the quantity of information that attribute p (d, r) produces while generation, MI (p (d, r)) represent attribute p (d, r) the mutual information metric between d and r, α, β is respectively weight parameter, and 0≤α, β≤1.
Wherein, described I (p (d, r)) circular is:
I ( p ( d , r ) ) = - log 2 pr ( p ( d , r ) ) pr ( p ( d , r ) ) = | sub ( p ( d , r ) ) | | N |
(p (the d of pr in formula, r)) be attribute p (d, r) probability of occurrence, sub (p (d, r) be) that in instances of ontology figure, all examples from body class d are to the quantity of the attribute instance of the example of body class or data type r, N is the quantity of all class examples in instances of ontology figure.
Described MI (p (d, r)) circular is:
MI ( p ( d , r ) ) = &Sigma; o &Element; r &Sigma; s &Element; d pr ( s , o ) &CenterDot; log 2 ( pr ( s , o ) pr ( s ) pr ( o ) )
Pr (s in formula, o) be the probability of occurrence from the example s of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure, pr (s) is the probability of occurrence from the example s of body class d to the attribute instance of all examples of body class or data type r in instances of ontology figure, and pr (o) is the probability of occurrence from all examples of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure.
Further, described step S2012 circular is:
w ( sp ) = ( &Pi; p ( d , r ) &Element; sp w ( p ( d , r ) ) ) &CenterDot; &delta; length ( sp ) - 1
In formula, sp represents that body class is to the semantic relation path of data type from body frame figure, w (p (d, r)) represent the weight of each attribute that this relation path comprises, δ is interval for (0,1) damped expoential, the number of attributes that length (sp) comprises for semantic path sp, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure.
Further, described step S2013 circular is:
w(ip)=w(sp)
In formula ip represent with body frame figure in the corresponding instances of ontology figure of semantic relation path sp in semantic relation path examples.
Further, described step S103 circular is:
R ( a , k i ) = &Sigma; ip &Element; IP ( a , k i ) ( w ( ip ) &CenterDot; spec ( ip ) )
In formula, a represents body class example, k irepresent searching keyword, ip represents semantic relation path examples, IP (a, k i) represent to be key word k from class example a to data value isemantic relation path examples set w (ip) represent the weight of semantic relation path ip, spec (ip) represents the specificity of path examples ip, computing formula is as follows:
spec ( ip ) = &Pi; i = 1 m 1 degree ( s i , e i )
In formula, s irepresent the body class example that path examples ip comprises, e irepresent with body class example s ifor the attribute instance of main body, degree (s i, e i) represent with body class example s ifor all properties example e of main body iquantity, m represents the quantity of the body class example that path examples ip comprises.
Further, described step S104 circular is:
R ( a , K ) = 1 - [ &Sigma; 1 &le; i &le; | K | ( D ( k i ) &CenterDot; ( 1 - NR ( a , k i ) ) ) p &Sigma; 1 &le; i &le; | K | D ( k i ) p ] 1 p
In formula, a represents body class example, and K represents key word of the inquiry set, k irepresent i key word in K, | K| represents to gather the number of elements in K, D (k i) expression key word k iweight, D (k i) computing formula is as follows:
D ( k i ) = log | DV | | DV k i |
In formula, | DV| represents the quantity of all data values in semantic instance graph, | DV ki| represent all key word k that comprise in semantic instance graph ithe quantity of data value;
NR (a, k i) represent body class example a and key word of the inquiry k after equalization ibetween correlativity, NR (a, k i) computing formula is as follows:
NR ( a , k i ) = R ( a , k i ) max { R ( a , k 1 ) , R ( a , k 2 ) , &CenterDot; &CenterDot; &CenterDot; , R ( a , k | K | ) }
In formula, R (a, k i) represent that body class example a is to key word of the inquiry k icorrelativity, max{} represents to get maximal value; P is for regulating parameter, and p>0.
Brief description of the drawings
Fig. 1 is the body frame figure in the scientific research information field of Staffs in University
Fig. 2 be with Fig. 1 in the corresponding this subject instance graph of body frame figure
Fig. 3 is the process flow diagram of the information query method based on semantic net
Fig. 4 is the comparison diagram of the present invention and existing method test result.
Embodiment
Further illustrate technical scheme of the present invention below in conjunction with accompanying drawing and by embodiment.
Fig. 3 is the process flow diagram of the information query method based on semantic net described in the present embodiment, for searching the body class example matching with semantic query statement and Query Result is sorted at ontology library according to specific semantic query statement.As shown in Figure 3, the present embodiment said method comprising the steps of:
S101, traversal instances of ontology figure, and return with semantic query statement in body types match, and the body class example being associated with the key word of the inquiry in semantic query statement.
S102, search respectively all semantic relation paths between current body class example and each key word of the inquiry for described each body class example, and the weight of computing semantic relation path respectively.
Semantic relation path is made up of multiple attributes, and the weight in semantic relation path need to be added and be obtained by the weight of attribute that semantic relation path is comprised, comprises the following steps:
S2011 calculates in body frame figure the weight of attribute between each body class and between body class and data type, and computing formula is as follows:
w(p(d,r))=α·I(p(d,r))+β·MI(p(d,r))
In formula, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure, I (p (d, r)) represent the quantity of information that attribute p (d, r) produces while generation, computing formula is as follows:
I ( p ( d , r ) ) = - log 2 pr ( p ( d , r ) ) pr ( p ( d , r ) ) = | sub ( p ( d , r ) ) | | N |
In formula, pr (p (d, r)) be attribute p (d, r) probability of occurrence, sub (p (d, r) be) that in instances of ontology figure, all examples from body class d are to the quantity of the attribute instance of the example of body class or data type r, N is the quantity of all class examples in instances of ontology figure.MI (p (d, r)) represents the mutual information metric of attribute p (d, r) between d and r, and computing formula is as follows:
MI ( p ( d , r ) ) = &Sigma; o &Element; r &Sigma; s &Element; d pr ( s , o ) &CenterDot; log 2 ( pr ( s , o ) pr ( s ) pr ( o ) )
Pr (s in formula, o) be the probability of occurrence from the example s of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure, pr (s) is the probability of occurrence from the example s of body class d to the attribute instance of all examples of body class or data type r in instances of ontology figure, and pr (o) is the probability of occurrence from all examples of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure.α, β is respectively weight parameter, and 0≤α, β≤1.
S2012, weight according to the weight calculation body class of the each attribute in body frame figure to the semantic relation path between data type, computing formula is as follows:
w ( sp ) = ( &Pi; p ( d , r ) &Element; sp w ( p ( d , r ) ) ) &CenterDot; &delta; length ( sp ) - 1
In formula, sp represents that body class is to the semantic relation path of data type from body frame figure, w (p (d, r)) represent the weight of each attribute that this relation path comprises, δ is interval for (0,1) damped expoential, the number of attributes that length (sp) comprises for semantic path sp, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure.
The weight in the semantic relation path in S2013, use body frame figure substitutes the weight of corresponding semantic relation path examples in instances of ontology figure, and computing formula is as follows:
w(ip)=w(sp)
In formula ip represent with body frame figure in the corresponding instances of ontology figure of semantic relation path sp in semantic relation path examples.
S103, according to the weight in semantic relation path between described body class example and each key word of the inquiry and the quantity in semantic relation path, the correlativity between COMPREHENSIVE CALCULATING current body class example and key word of the inquiry, computing formula is as follows:
R ( a , k i ) = &Sigma; ip &Element; IP ( a , k i ) ( w ( ip ) &CenterDot; spec ( ip ) )
In formula, a represents body class example, k irepresent searching keyword, ip represents semantic relation path examples, IP (a, k i) represent to be key word k from class example a to data value isemantic relation path examples set w (ip) represent the weight of semantic relation path ip, spec (ip) represents the specificity of path examples ip, computing formula is as follows:
spec ( ip ) = &Pi; i = 1 m 1 degree ( s i , e i )
In formula, s irepresent i the body class example that path examples ip comprises, e irepresent with body class example s ifor the attribute instance of main body, degree (s i, e i) represent with body class example s ifor all properties example e of main body iquantity, m represents the quantity of the body class example that path examples ip comprises.
S104 is according to the correlativity between described body class example and each key word of the inquiry and the weight of each key word of the inquiry, the correlativity between COMPREHENSIVE CALCULATING each body class example and key word of the inquiry set, and computing formula is as follows:
R ( a , K ) = 1 - [ &Sigma; 1 &le; i &le; | K | ( D ( k i ) &CenterDot; ( 1 - NR ( a , k i ) ) ) p &Sigma; 1 &le; i &le; | K | D ( k i ) p ] 1 p
In formula, a represents body class example, and K represents key word of the inquiry set, k irepresent i key word in K, | K| represents to gather the number of elements in K, D (k i) expression key word k iweight, D (k i) computing formula is as follows:
D ( k i ) = log | DV | | DV k i |
In formula, | DV| represents the quantity of all data values in semantic instance graph, | DV ki| represent all key word k that comprise in semantic instance graph ithe quantity of data value.NR (a, k i) represent body class example a and key word of the inquiry k after equalization ibetween correlativity, NR (a, k i) computing formula is as follows:
NR ( a , k i ) = R ( a , k i ) max { R ( a , k 1 ) , R ( a , k 2 ) , &CenterDot; &CenterDot; &CenterDot; , R ( a , k | K | ) }
In formula, R (a, k i) represent that body class example a is to key word of the inquiry k icorrelativity, max{} represents to get maximal value.P is for regulating parameter, and p>0.
S105, according to described correlativity order from big to small, described body class example is sorted.
Performance index
(1) method of testing
The scientific research information that in test, we choose the above academic title personnel of the associate professor of Qingdao Agricultural University is as data resource, and by semantic relation, these data resources being configured to body form, the ontology library after structure has 7984 class examples (comprising personnel, paper, works, problem etc.) and 31413 attribute instance (comprise deliver, write, preside over, participation etc.).For effective assessment algorithm herein, our 5 different query statements that have been inquiry experimental design, table 1 has shown expression formula, inquiry object and the related resource quantity of these query statements.
Table 1 semantic query statement
For the accurate evaluation inquiry accuracy of algorithm herein, in experiment, the algorithm of the proposition such as algorithm and Zhou of the proposition such as algorithm, Castells of the proposition such as the present invention and Liu is entered contrast by we.
(2) measurement index
For the Query Result of every query statement, we only evaluate front 10 results, and use the basic evaluation index in information inquiry field to evaluate:
Inquiry accuracy rate: the resource collection that wherein A is Query Result, RA is resource collection relevant in ontology library.
Inquiry recall rate: wherein, when | when RA|≤the 10, N=|RA|; When | when RA|>10, N=10.
F measure value: F = 2 PR P + R .
(3) Query Result
Hence one can see that, all obtain best inquiry effect for different query statement the present invention, this result is mainly owing to semantic relation weighting algorithm and sort algorithm in this paper querying method, wherein the application of semantic relation weighting algorithm contributes to inquiry to recessive information and the quantification of semantic relation weight, the sequence that sort algorithm can effectively improve related resource in Query Result simultaneously.By contrast, the algorithm of the propositions such as Liu is due to the sequence lacking Query Result, thereby it is the poorest to cause inquiring about effect; Although the algorithm of the propositions such as Castells has increased the sort algorithm of Query Result, due to semantic relation weight is not distinguished, thereby cause being inaccurate for the sequence of Query Result; The algorithm of the propositions such as Zhou, owing to failing that semantic path relation and keyword message are carried out to refinement, therefore cannot be inquired about for the recessive information in body, and the sequence of Query Result also exists certain error.

Claims (9)

1. the information query method based on semantic net, for searching the body class example matching with semantic query statement and Query Result is sorted at ontology library according to specific semantic query statement, its feature comprises the following steps:
S101, traversal instances of ontology figure, and return with semantic query statement in body types match, and the body class example being associated with the key word of the inquiry in semantic query statement.
S102, search respectively all semantic relation paths between current body class example and each key word of the inquiry for described each body class example, and the weight of computing semantic relation path respectively.
S103, according to the weight in semantic relation path between described body class example and each key word of the inquiry and the quantity in semantic relation path, the correlativity between COMPREHENSIVE CALCULATING current body class example and key word of the inquiry.
S104 is according to the correlativity between described body class example and each key word of the inquiry and the weight of each key word of the inquiry, the correlativity between COMPREHENSIVE CALCULATING each body class example and key word of the inquiry set.
S105, according to described correlativity order from big to small, described body class example is sorted.
2. method according to claim 1, is characterized in that, the weight of step 102 computing semantic relation specifically comprises:
S2011, calculate in body frame figure the weight of attribute between each body class and between body class and data type.
S2012, weight according to the weight calculation body class of the each attribute in body frame figure to the semantic relation path between data type.
S2013 uses the weight in the semantic relation path in body frame figure to substitute the weight of corresponding semantic relation path examples in instances of ontology figure.
3. method according to claim 2, is characterized in that, described step S2011 circular is:
w(p(d,r))=α·I(p(d,r))+β·MI(p(d,r))
In formula, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure, I (p (d, r)) represent the quantity of information that attribute p (d, r) produces while generation, MI (p (d, r)) represent attribute p (d, r) the mutual information metric between d and r, α, β is respectively weight parameter, and 0≤α, β≤1.
4. method according to claim 3, is characterized in that, described I (p (d, r)) circular is:
I ( p ( d , r ) ) = - log 2 pr ( p ( d , r ) ) pr ( p ( d , r ) ) = | sub ( p ( d , r ) ) | | N |
(p (the d of pr in formula, r)) be attribute p (d, r) probability of occurrence, sub (p (d, r) be) that in instances of ontology figure, all examples from body class d are to the quantity of the attribute instance of the example of body class or data type r, N is the quantity of all class examples in instances of ontology figure.
5. method according to claim 3, is characterized in that, described MI (p (d, r)) circular is:
MI ( p ( d , r ) ) = &Sigma; o &Element; r &Sigma; s &Element; d pr ( s , o ) &CenterDot; log 2 ( pr ( s , o ) pr ( s ) pr ( o ) )
Pr (s in formula, o) be the probability of occurrence from the example s of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure, pr (s) is the probability of occurrence from the example s of body class d to the attribute instance of all examples of body class or data type r in instances of ontology figure, and pr (o) is the probability of occurrence from all examples of body class d to the attribute instance of the example o of body class or data type r in instances of ontology figure.
6. method according to claim 2, is characterized in that, described step S2012 circular is:
w ( sp ) = ( &Pi; p ( d , r ) &Element; sp w ( p ( d , r ) ) ) &CenterDot; &delta; length ( sp ) - 1
In formula, sp represents that body class is to the semantic relation path of data type from body frame figure, w (p (d, r)) represent the weight of each attribute that this relation path comprises, δ is interval for (0,1) damped expoential, the number of attributes that length (sp) comprises for semantic path sp, p (d, r) represents that body class d is to the attribute of body class or ontology data type r from body frame figure.
7. method according to claim 2, is characterized in that, described step S2013 circular is:
w(ip)=w(sp)
In formula ip represent with body frame figure in the corresponding instances of ontology figure of semantic relation path sp in semantic relation path examples.
8. method according to claim 1, is characterized in that, described step S103 circular is:
R ( a , k i ) = &Sigma; ip &Element; IP ( a , k i ) ( w ( ip ) &CenterDot; spec ( ip ) )
In formula, a represents body class example, k irepresent searching keyword, ip represents semantic relation path examples, IP (a, k i) represent to be key word k from class example a to data value isemantic relation path examples set w (ip) represent the weight of semantic relation path ip, spec (ip) represents the specificity of path examples ip, computing formula is as follows:
spec ( ip ) = &Pi; i = 1 m 1 degree ( s i , e i )
In formula, s irepresent i the body class example that path examples ip comprises, e irepresent with body class example s ifor the attribute instance of main body, degree (s i, e i) represent with body class example s ifor all properties example e of main body iquantity, m represents the quantity of the body class example that path examples ip comprises.
9. method according to claim 3, is characterized in that, described step S104 circular is:
R ( a , K ) = 1 - [ &Sigma; 1 &le; i &le; | K | ( D ( k i ) &CenterDot; ( 1 - NR ( a , k i ) ) ) p &Sigma; 1 &le; i &le; | K | D ( k i ) p ] 1 p
In formula, a represents body class example, and K represents key word of the inquiry set, k irepresent i key word in K, | K| represents to gather the number of elements in K, D (k i) expression key word k iweight, D (k i) computing formula is as follows:
D ( k i ) = log | DV | | DV k i |
In formula, | DV| represents the quantity of all data values in semantic instance graph, | DV ki| represent all key word k that comprise in semantic instance graph ithe quantity of data value.NR (a, k i) represent body class example a and key word of the inquiry k after equalization ibetween correlativity, NR (a, k i) computing formula is as follows:
NR ( a , k i ) = R ( a , k i ) max { R ( a , k 1 ) , R ( a , k 2 ) , &CenterDot; &CenterDot; &CenterDot; , R ( a , k | K | ) }
In formula, R (a, k i) represent that body class example a is to key word of the inquiry k icorrelativity, max{} represents to get maximal value.P is for regulating parameter, and p>0.
CN201410268256.0A 2014-06-17 2014-06-17 Information inquiry method based on semantic network Pending CN104166670A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410268256.0A CN104166670A (en) 2014-06-17 2014-06-17 Information inquiry method based on semantic network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410268256.0A CN104166670A (en) 2014-06-17 2014-06-17 Information inquiry method based on semantic network

Publications (1)

Publication Number Publication Date
CN104166670A true CN104166670A (en) 2014-11-26

Family

ID=51910484

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410268256.0A Pending CN104166670A (en) 2014-06-17 2014-06-17 Information inquiry method based on semantic network

Country Status (1)

Country Link
CN (1) CN104166670A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105808590A (en) * 2014-12-31 2016-07-27 中国电信股份有限公司 Search engine realization method as well as search method and apparatus
CN106354728A (en) * 2015-07-16 2017-01-25 富士通株式会社 Method and device for generating association intensity between objects with semantic graph
CN108846029A (en) * 2018-05-28 2018-11-20 哈尔滨工程大学 The information association analysis method of knowledge based map

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101566988A (en) * 2008-04-24 2009-10-28 华为技术有限公司 Method, system and device for searching fuzzy semantics
US20110202526A1 (en) * 2010-02-12 2011-08-18 Korea Advanced Institute Of Science And Technology Semantic search system using semantic ranking scheme
CN103399932A (en) * 2013-08-06 2013-11-20 武汉大学 Situation identification method based on semantic social network entity analysis technique
CN103440314A (en) * 2013-08-27 2013-12-11 北京工业大学 Semantic retrieval method based on Ontology
US20130332448A1 (en) * 2008-07-09 2013-12-12 International Business Machines Corporation Apparatus and Method of Semantic Service Correlation System
US20140040275A1 (en) * 2010-02-09 2014-02-06 Siemens Corporation Semantic search tool for document tagging, indexing and search
US20140156643A1 (en) * 2012-12-04 2014-06-05 International Business Machines Corporation Enabling business intelligence applications to query semantic models

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101566988A (en) * 2008-04-24 2009-10-28 华为技术有限公司 Method, system and device for searching fuzzy semantics
US20130332448A1 (en) * 2008-07-09 2013-12-12 International Business Machines Corporation Apparatus and Method of Semantic Service Correlation System
US20140040275A1 (en) * 2010-02-09 2014-02-06 Siemens Corporation Semantic search tool for document tagging, indexing and search
US20110202526A1 (en) * 2010-02-12 2011-08-18 Korea Advanced Institute Of Science And Technology Semantic search system using semantic ranking scheme
US20140156643A1 (en) * 2012-12-04 2014-06-05 International Business Machines Corporation Enabling business intelligence applications to query semantic models
CN103399932A (en) * 2013-08-06 2013-11-20 武汉大学 Situation identification method based on semantic social network entity analysis technique
CN103440314A (en) * 2013-08-27 2013-12-11 北京工业大学 Semantic retrieval method based on Ontology

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105808590A (en) * 2014-12-31 2016-07-27 中国电信股份有限公司 Search engine realization method as well as search method and apparatus
CN105808590B (en) * 2014-12-31 2019-08-20 中国电信股份有限公司 Search engine implementation method, searching method and device
CN106354728A (en) * 2015-07-16 2017-01-25 富士通株式会社 Method and device for generating association intensity between objects with semantic graph
CN108846029A (en) * 2018-05-28 2018-11-20 哈尔滨工程大学 The information association analysis method of knowledge based map

Similar Documents

Publication Publication Date Title
You et al. Distributed algorithms for computation of centrality measures in complex networks
Cheng et al. Relin: relatedness and informativeness-based centrality for entity summarization
Li et al. Personalized influential topic search via social network summarization
Pappas et al. Exploring importance measures for summarizing RDF/S KBs
Kunze et al. Dataset retrieval
US10089409B2 (en) Event-triggered data quality verification
CN105975584A (en) Mathematical expression similar distance measurement method
Lian et al. Keyword search over probabilistic RDF graphs
CN104166670A (en) Information inquiry method based on semantic network
US20130159317A1 (en) High precision set expansion for large concepts
Bin et al. Using information content to evaluate semantic similarity on HowNet
Li et al. A method for fuzzy quantified querying over fuzzy resource description framework graph
Yang et al. Selectivity estimation on set containment search
Alipanah et al. Ontology-driven query expansion methods to facilitate federated queries
Qudus et al. An empirical evaluation of cost-based federated SPARQL query processing engines
Moulahi et al. i A ggregator: Multidimensional relevance aggregation based on a fuzzy operator
Zhao et al. A citation recommendation method based on context correlation
Marx et al. DBtrends: Publishing and Benchmarking RDF Ranking Functions.
Carman et al. Learning Semantic Descriptions of Web Information Sources.
Löser et al. Augmenting tables by self-supervised web search
Jia et al. Research on joint ranking recommendation model based on Markov chain
Hong et al. Accurate and efficient query clustering via top ranked search results
Wang et al. KeyLabel algorithms for keyword search in large graphs
Sharma et al. RDF link generation by exploring related links on the Web of data
Liu et al. Top-k keyword search with recursive semantics in relational databases

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20141126

RJ01 Rejection of invention patent application after publication