Measuring the Inferential Values of Relations in Knowledge Graphs
Knowledge graphs, as an important research direction in artificial intelligence, have been widely applied in many fields and tasks. The relations in knowledge graphs have explicit semantics and play a crucial role in knowledge completion and reasoning. Correctly measuring the inferential value of re...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/18/1/6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832589427151470592 |
|---|---|
| author | Xu Zhang Xiaojun Kang Hong Yao Lijun Dong |
| author_facet | Xu Zhang Xiaojun Kang Hong Yao Lijun Dong |
| author_sort | Xu Zhang |
| collection | DOAJ |
| description | Knowledge graphs, as an important research direction in artificial intelligence, have been widely applied in many fields and tasks. The relations in knowledge graphs have explicit semantics and play a crucial role in knowledge completion and reasoning. Correctly measuring the inferential value of relations and identifying important relations in a knowledge graph can effectively improve the effectiveness of knowledge graphs in reasoning tasks. However, the existing methods primarily consider the connectivity and structural characteristics of relations, but neglect the semantics and the mutual influence of relations in reasoning tasks. This leads to truly valuable relations being difficult to fully utilize in long-chain reasoning. To address this problem, this work, inspired by information entropy and uncertainty-measurement methods in knowledge bases, proposes a method called Relation Importance Measurement based on Information Entropy (RIMIE) to measure the inferential value of relations in knowledge graphs. RIMIE considers the semantics of relations and the role of relations in reasoning. Specifically, based on the values of relations in logical chains, RIMIE partitions the logical sample set into multiple equivalence classes, and generates a knowledge structure for each relation. Correspondingly, to effectively measure the inferential values of relations in knowledge graphs, the concept of <i>relation entropy</i> is proposed, and it is calculated according to the knowledge structures. Finally, to objectively assess the effectiveness of RIMIE, a group of experiments are conducted, which compare the influences of the relations selected according to RIMIE and other patterns on the triple classifications by knowledge graph representation learning. The experimental results confirm what is claimed above. |
| format | Article |
| id | doaj-art-be6e6fa99f2543f9aa470ba366db0acd |
| institution | Kabale University |
| issn | 1999-4893 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj-art-be6e6fa99f2543f9aa470ba366db0acd2025-01-24T13:17:26ZengMDPI AGAlgorithms1999-48932024-12-01181610.3390/a18010006Measuring the Inferential Values of Relations in Knowledge GraphsXu Zhang0Xiaojun Kang1Hong Yao2Lijun Dong3School of Computer Science, China University of Geosciences, Wuhan 430078, ChinaSchool of Computer Science, China University of Geosciences, Wuhan 430078, ChinaSchool of Computer Science, China University of Geosciences, Wuhan 430078, ChinaSchool of Computer Science, China University of Geosciences, Wuhan 430078, ChinaKnowledge graphs, as an important research direction in artificial intelligence, have been widely applied in many fields and tasks. The relations in knowledge graphs have explicit semantics and play a crucial role in knowledge completion and reasoning. Correctly measuring the inferential value of relations and identifying important relations in a knowledge graph can effectively improve the effectiveness of knowledge graphs in reasoning tasks. However, the existing methods primarily consider the connectivity and structural characteristics of relations, but neglect the semantics and the mutual influence of relations in reasoning tasks. This leads to truly valuable relations being difficult to fully utilize in long-chain reasoning. To address this problem, this work, inspired by information entropy and uncertainty-measurement methods in knowledge bases, proposes a method called Relation Importance Measurement based on Information Entropy (RIMIE) to measure the inferential value of relations in knowledge graphs. RIMIE considers the semantics of relations and the role of relations in reasoning. Specifically, based on the values of relations in logical chains, RIMIE partitions the logical sample set into multiple equivalence classes, and generates a knowledge structure for each relation. Correspondingly, to effectively measure the inferential values of relations in knowledge graphs, the concept of <i>relation entropy</i> is proposed, and it is calculated according to the knowledge structures. Finally, to objectively assess the effectiveness of RIMIE, a group of experiments are conducted, which compare the influences of the relations selected according to RIMIE and other patterns on the triple classifications by knowledge graph representation learning. The experimental results confirm what is claimed above.https://www.mdpi.com/1999-4893/18/1/6knowledge graphinformation entropyrelation entropyinferential value |
| spellingShingle | Xu Zhang Xiaojun Kang Hong Yao Lijun Dong Measuring the Inferential Values of Relations in Knowledge Graphs Algorithms knowledge graph information entropy relation entropy inferential value |
| title | Measuring the Inferential Values of Relations in Knowledge Graphs |
| title_full | Measuring the Inferential Values of Relations in Knowledge Graphs |
| title_fullStr | Measuring the Inferential Values of Relations in Knowledge Graphs |
| title_full_unstemmed | Measuring the Inferential Values of Relations in Knowledge Graphs |
| title_short | Measuring the Inferential Values of Relations in Knowledge Graphs |
| title_sort | measuring the inferential values of relations in knowledge graphs |
| topic | knowledge graph information entropy relation entropy inferential value |
| url | https://www.mdpi.com/1999-4893/18/1/6 |
| work_keys_str_mv | AT xuzhang measuringtheinferentialvaluesofrelationsinknowledgegraphs AT xiaojunkang measuringtheinferentialvaluesofrelationsinknowledgegraphs AT hongyao measuringtheinferentialvaluesofrelationsinknowledgegraphs AT lijundong measuringtheinferentialvaluesofrelationsinknowledgegraphs |