Chrome Extension
WeChat Mini Program
Use on ChatGLM

Bidirectional relation-guided attention network with semantics and knowledge for relational triple extraction

Yi Yang,Shangbo Zhou, Yuxuan Liu

EXPERT SYSTEMS WITH APPLICATIONS(2023)

Cited 2|Views30
No score
Abstract
Relational triple extraction is aimed at detecting entity pairs with relations from sentences, which is a key technology for large-scale knowledge graph construction. Recent studies focus on the overlapping triple problem, where multiple relational triples may have overlaps in a sentence. However, these methods disregard the bidirectionality of triple extraction, which may lead to extracting invalid triples. In addition, many relational triples are labeled in datasets of the triple extraction task, implying domain knowledge information of these datasets, but current methods rarely consider it. In this paper, we present a bidirectional relation-guided attention network with semantics and knowledge (BRASK) for relational triple extraction. BRASK is a bidirectional extraction framework that is based on multitask learning and contains forward and backward triple extraction tasks. Forward triple extraction and backward triple extraction are parallel and complementary, which can obtain predicted results with high confidence. We utilize semantic relations and knowledge relations as guidance in forward triple extraction and backward triple extraction, respectively, thus integrating general and domain knowledge into our model. In addition, we adopt an attention mechanism to learn fine-grained sentence representations for different relations. BRASK can solve the triple overlap problem and capture bidirectional dependencies between subjects and objects. Experimental results show that BRASK achieves new state-of-the-art results in two public datasets, which demonstrates its effectiveness.
More
Translated text
Key words
Relational triple extraction,Bidirectionality,Semantic and knowledge relations,Multitask learning,Attention mechanism
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined