A Semantic Filter Based on Relations for Knowledge Graph Completion

Zongwei Liang, Junan Yang, Hui Liu, Keju Huang


Abstract
Knowledge graph embedding, representing entities and relations in the knowledge graphs with high-dimensional vectors, has made significant progress in link prediction. More researchers have explored the representational capabilities of models in recent years. That is, they investigate better representational models to fit symmetry/antisymmetry and combination relationships. The current embedding models are more inclined to utilize the identical vector for the same entity in various triples to measure the matching performance. The observation that measuring the rationality of specific triples means comparing the matching degree of the specific attributes associated with the relations is well-known. Inspired by this fact, this paper designs Semantic Filter Based on Relations(SFBR) to extract the required attributes of the entities. Then the rationality of triples is compared under these extracted attributes through the traditional embedding models. The semantic filter module can be added to most geometric and tensor decomposition models with minimal additional memory. experiments on the benchmark datasets show that the semantic filter based on relations can suppress the impact of other attribute dimensions and improve link prediction performance. The tensor decomposition models with SFBR have achieved state-of-the-art.
Anthology ID:
2021.emnlp-main.625
Volume:
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Month:
November
Year:
2021
Address:
Online and Punta Cana, Dominican Republic
Editors:
Marie-Francine Moens, Xuanjing Huang, Lucia Specia, Scott Wen-tau Yih
Venue:
EMNLP
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
7920–7929
Language:
URL:
https://aclanthology.org/2021.emnlp-main.625
DOI:
10.18653/v1/2021.emnlp-main.625
Bibkey:
Cite (ACL):
Zongwei Liang, Junan Yang, Hui Liu, and Keju Huang. 2021. A Semantic Filter Based on Relations for Knowledge Graph Completion. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 7920–7929, Online and Punta Cana, Dominican Republic. Association for Computational Linguistics.
Cite (Informal):
A Semantic Filter Based on Relations for Knowledge Graph Completion (Liang et al., EMNLP 2021)
Copy Citation:
PDF:
https://aclanthology.org/2021.emnlp-main.625.pdf
Software:
 2021.emnlp-main.625.Software.zip
Video:
 https://aclanthology.org/2021.emnlp-main.625.mp4
Data
FB15k-237