Knowledge graph complementing method based on topic keyword filtering
A knowledge map and keyword technology, applied in the field of knowledge map completion, can solve the problems of complex and redundant text content, inability to complete task completion, etc., and achieve the effect of solving a large amount of noisy information, improving usability, and enhancing differentiation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0047] A knowledge map completion method based on subject keyword filtering according to the present embodiment, the method includes the following steps:
[0048] Step 1: Set the knowledge map G=(E, R, T); among them, E represents the entity set of the knowledge map, R represents the relation set in the knowledge map, and T represents the set of triples to be completed,
[0049] Step 2: Set the set of incomplete triplet elements in the knowledge map G set in step 1 as the completion task set H, and the elements in H are divided into (h, r,?) and (h,? ,t) two forms; among them, the head entity h∈E, the relationship r∈R, and the tail entity t∈E;
[0050] A completion task is a collection of many tasks. Contains a lot of triples such as: (China, capital,?), (Yao Ming, place of birth,?), (Andy Lau, birthday,?) and so on. A set of many such incomplete triples is the task to be completed;
[0051] The knowledge base is filled with a large number of triples, such as: (United State...
specific Embodiment approach 2
[0089] Different from the specific embodiment 1, in this embodiment, a knowledge graph completion method based on topic keyword filtering, in the step 7, obtain the topic calculation word vector matrix D e and D t The attention score, and then select the subject according to the attention score; and calculate the word vector matrix D for the topic e and D t The process of assigning attention scores is as follows:
[0090] Step 7.1: Obtain the attention score described by the subject, and describe the attention score a by the following formula i :
[0091]
[0092]
[0093] Among them, attention(D) represents the attention scoring result of the entity description; the attention to the i-th word in the entity description text a i is the i-th word vector d i The maximum value of the cosine similarity with all row vectors in the inference matrix W(T);
[0094] Step 7.2: In the matrix W, for the document doc i , select the top m topics with the highest probability acco...
specific Embodiment approach 3
[0098] The difference from Embodiment 1 or Embodiment 2 is that in this embodiment, a knowledge map completion method based on subject keyword filtering, in step 12, the training method for adjusting parameters through training includes: stochastic gradient descent method , Adam training method, etc.
[0099] Simulation experiment data:
[0100] In each table, the data corresponding to Topic-ADRL_j is the experimental data of the method of the present invention. Experimental results show that the algorithm outperforms previous algorithms in top ten accuracy and average ranking.
[0101] Table 1 FB15K entity prediction comparison results
[0102]
[0103] Table 2 WN18 Entity Prediction Comparison Results
[0104]
[0105] Table 3 Evaluation results of relationship prediction on FB15K
[0106]
[0107] Table 4 Evaluation results of mapping relationship attributes on FB15K
[0108]
PUM
![No PUM](https://static-eureka.patsnap.com/ssr/23.2.0/_nuxt/noPUMSmall.5c5f49c7.png)
Abstract
Description
Claims
Application Information
![application no application](https://static-eureka.patsnap.com/ssr/23.2.0/_nuxt/application.06fe782c.png)
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com