TY - JOUR
T1 - Piecewise graph convolutional network with edge-level attention for relation extraction
AU - Yuan, Changsen
AU - Huang, Heyan
AU - Feng, Chong
AU - Cao, Qianwen
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
PY - 2022
Y1 - 2022
N2 - Graph Convolutional Network (GCN) is a critical method to capture non-sequential information of sentences and recognize long-distance syntactic information. However, the adjacency matrix of GCN has two problems: redundant syntactic information and wrong dependency parsing results. Because the syntactic information is represented by unweighted adjacency matrices in most existing GCN methods. Toward this end, we propose a novel model, PGCN-EA, using Piecewise Graph Convolutional Network with Edge-level Attention to address these two problems. In specific, we first employ the piecewise adjacency matrix based on entity pair, which aims to dynamically reduce the sentence’s redundant features. Second, we propose Edge-level Attention to assign the different weights among nodes based on GCN’s input and create the weight adjacency matrix, emphasizing the importance of child words with the target word and alleviating the influence of wrong dependency parsing. Our model on a benchmark dataset has carried out extensive experiments and achieved the best PR curve as compared to seven baseline models, which are at least more than 2.3 %.
AB - Graph Convolutional Network (GCN) is a critical method to capture non-sequential information of sentences and recognize long-distance syntactic information. However, the adjacency matrix of GCN has two problems: redundant syntactic information and wrong dependency parsing results. Because the syntactic information is represented by unweighted adjacency matrices in most existing GCN methods. Toward this end, we propose a novel model, PGCN-EA, using Piecewise Graph Convolutional Network with Edge-level Attention to address these two problems. In specific, we first employ the piecewise adjacency matrix based on entity pair, which aims to dynamically reduce the sentence’s redundant features. Second, we propose Edge-level Attention to assign the different weights among nodes based on GCN’s input and create the weight adjacency matrix, emphasizing the importance of child words with the target word and alleviating the influence of wrong dependency parsing. Our model on a benchmark dataset has carried out extensive experiments and achieved the best PR curve as compared to seven baseline models, which are at least more than 2.3 %.
KW - Graph convolutional network
KW - Information extraction
KW - Natural language processing
KW - Relation extraction
UR - http://www.scopus.com/inward/record.url?scp=85133220508&partnerID=8YFLogxK
U2 - 10.1007/s00521-022-07312-3
DO - 10.1007/s00521-022-07312-3
M3 - Article
AN - SCOPUS:85133220508
SN - 0941-0643
JO - Neural Computing and Applications
JF - Neural Computing and Applications
ER -