ERDERP: Entity and Relation Double Embedding on Relation Hyperplanes and Relation Projection Hyperplanes

Lin Lin, Jie Liu, Feng Guo (), Changsheng Tong, Lizheng Zu and Hao Guo
Additional contact information
Lin Lin: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China
Jie Liu: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China
Feng Guo: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China
Changsheng Tong: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China
Lizheng Zu: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China
Hao Guo: School of Mechatronics Engineering, Harbin Institute of Technology, 92 Xidazhi Road, Harbin 150001, China

Mathematics, 2022, vol. 10, issue 22, 1-19

Abstract: Since data are gradually enriched over time, knowledge graphs are inherently imperfect. Thus, knowledge graph completion is proposed to perfect knowledge graph by completing triples. Currently, a family of translation models has become the most effective method for knowledge graph completion. These translation models are modeled to solve the complexity and diversity of entities, such as one-to-many, many-to-one, and many-to-many, which ignores the diversity of relations themselves, such as multiple relations between a pair of entities. As a result, with current translation models, it is difficult to effectively extract the semantic information of entities and relations. To effectively extract the semantic information of the knowledge graph, this paper fundamentally analyzes the complex relationships of the knowledge graph. Then, considering the diversity of relations themselves, the complex relationships are refined as one-to-one-to-many, many-to-one-to-one, one-to-many-to-one, many-to-one-to-many, many-to-many-to-one, one-to-many-to-many, and many-to-many-to-many. By analyzing the complex relationships, a novel knowledge graph completion model, entity and relation double embedding on relation hyperplanes and relation projection hyperplanes (ERDERP), is proposed to extract the semantic information of entities and relations. First, ERDERP establishes a relation hyperplane for each relation and projects the relation embedding into the relation hyperplane. Thus, the semantic information of the relations is extracted effectively. Second, ERDERP establishes a relation projection hyperplane for each relation projection and projects entities into relation projection hyperplane. Thus, the semantic information of the entities is extracted effectively. Moreover, it is theoretically proved that ERDERP can solve antisymmetric problems. Finally, the proposed ERDERP are compared with several typical knowledge graph completion models. The experimental results show that ERDERP is significantly effective in link prediction, especially in relation prediction. For instance, on FB15k and FB15k-237, Hits@1 of ERDERP outperforms TransH at least 30%.

Keywords: knowledge graph completion; translation model; complex relationships; link prediction; relation prediction (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/22/4182/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/22/4182/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:22:p:4182-:d:967203

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().