<p>Relation prediction in knowledge graphs is a classic task. However, predicting unseen facts under the open-world assumption remains challenging, as conventional closure reasoning methods tend to fail. To address this, we propose an uncertain knowledge graph embedding and Bayesian inferring model, UKGEBN, which examines the capabilities of approximate inference under the open-world assumption. This model employs a large language model to encode entities and relations by treating facts as natural language sentences. It then learns knowledge confidence through a recurrent neural network and subsequently constructs Bayesian networks for the uncertain knowledge graph based on the learned confidence. The constructed Bayesian network can reasonably infer unseen knowledge facts, even if the elements of these facts-such as new entities and relationships-have never been encountered in the knowledge base before. The experimental results show that the new model has improved the MSE metric by 24.6% in relation prediction on the benchmark dataset. Case studies indicate that the model significantly enhances the revelation of latent semantic information, facilitating the prediction of implicit relationships in uncertain knowledge graphs.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Prediction of Implicit Relationships Using Uncertain Knowledge Graph Embedding and Bayesian Networks

  • Shihan Yang,
  • Liannan Lin,
  • Chunjiang Liu,
  • Mingkai Zhang,
  • Haiyi Yang

摘要

Relation prediction in knowledge graphs is a classic task. However, predicting unseen facts under the open-world assumption remains challenging, as conventional closure reasoning methods tend to fail. To address this, we propose an uncertain knowledge graph embedding and Bayesian inferring model, UKGEBN, which examines the capabilities of approximate inference under the open-world assumption. This model employs a large language model to encode entities and relations by treating facts as natural language sentences. It then learns knowledge confidence through a recurrent neural network and subsequently constructs Bayesian networks for the uncertain knowledge graph based on the learned confidence. The constructed Bayesian network can reasonably infer unseen knowledge facts, even if the elements of these facts-such as new entities and relationships-have never been encountered in the knowledge base before. The experimental results show that the new model has improved the MSE metric by 24.6% in relation prediction on the benchmark dataset. Case studies indicate that the model significantly enhances the revelation of latent semantic information, facilitating the prediction of implicit relationships in uncertain knowledge graphs.