A Relational Memory-based Embedding Model for Triple Classification and Search Personalization
Knowledge graph embedding methods often suffer from a limitation of memorizing valid triples to predict new ones for triple classification and search personalization problems. To this end, we introduce a novel embedding model, named R-MeN, that explores a relational memory network to encode potential dependencies in relationship triples. R-MeN considers each triple as a sequence of 3 input vectors that recurrently interact with a memory using a transformer self-attention mechanism. Thus R-MeN encodes new information from interactions between the memory and each input vector to return a corresponding vector. Consequently, R-MeN feeds these 3 returned vectors to a convolutional neural network-based decoder to produce a scalar score for the triple. Experimental results show that our proposed R-MeN obtains state-of-the-art results on SEARCH17 for the search personalization task, and on WN11 and FB13 for the triple classification task.
Code (1)
Tasks
DecoderGeneral ClassificationGraph EmbeddingKnowledge Graph EmbeddingTriple ClassificationvalidMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Query-based Instance Discrimination Network for Relational Triple Extraction
Joint entity and relation extraction has been a core task in the field of information extraction. Recent approaches usually consider the extraction of relational triples from a stereoscopic perspective, either learning a…
Contrastive LearningJoint Entity and Relation ExtractionRelationRelation ExtractionDynamic Entity Memory Network for Dialogue Relational Triplet Extraction
Relational triplet extraction (RTE) is a crucial task in information extraction and has aroused extensive attention. Although advanced studies on RTE have achieved great progress, they are still insufficient for supporti…
Information RetrievalRetrievalRTETripletBridging Text and Knowledge with Multi-Prototype Embedding for Few-Shot Relational Triple Extraction
Current supervised relational triple extraction approaches require huge amounts of labeled data and thus suffer from poor performance in few-shot settings. However, people can grasp new knowledge by learning a few instan…
Jointly Extracting Explicit and Implicit Relational Triples with Reasoning Pattern Enhanced Binary Pointer Network
Relational triple extraction is a crucial task for knowledge graph construction. Existing methods mainly focused on explicit relational triples that are directly expressed, but usually suffer from ignoring implicit tripl…
graph constructionImplicit RelationsKnowledge GraphsRelation+3Path-Enhanced Multi-Relational Question Answering with Knowledge Graph Embeddings
The multi-relational Knowledge Base Question Answering (KBQA) system performs multi-hop reasoning over the knowledge graph (KG) to achieve the answer. Recent approaches attempt to introduce the knowledge graph embedding …
Graph EmbeddingKnowledge Base Question AnsweringKnowledge Graph EmbeddingKnowledge Graph Embeddings+1