Document-level relation extraction method based on graph neural network and reasoning path
A neural network and relationship extraction technology, applied in neural learning methods, biological neural network models, neural architectures, etc., can solve the problem of affecting model performance, ignoring the solution node reasoning relationship, and considering two node reasoning paths that are not displayed in the graph neural network and other issues to achieve the effect of improving performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0030] combine figure 1 and figure 2 , the present invention proposes a document-level relationship extraction method based on a graph neural network and an inference path, the method comprising:
[0031] Step 1. Convert an input document into a graph structure based on heuristic rules;
[0032] Step 2, using the path search algorithm to extract multiple paths between different entity pairs in the graph structure;
[0033] Step 3, encoding the input document by using the neural network encoder, and obtaining the vector representation of the nodes in the graph, and using the graph neural network to update the vector representation of the nodes in the graph;
[0034] Step 4: Obtain the vector representation of path information between entity pairs in the graph structure;
[0035] Step 5: Judge the relationship between the entity pairs, and use the labeled data to train the deep learning model.
[0036] The graph structure converted in step 1 is a heterogeneous graph structu...
Embodiment 2
[0068] In this embodiment, steps 1, 2, 3, and 5 are the same as those in the first embodiment. In step 4 of this embodiment, a vector representation of path information between entity pairs in the graph structure is obtained. In addition to using the nodes output by the graph neural network to represent the features of the nodes in the path, consider directly using the initial representation of the nodes as the features of the nodes in the path (such as figure 2 left).
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


