Discover Important Paths in the Knowledge Graph Based on Dynamic
Relation Confidence
- URL: http://arxiv.org/abs/2211.00914v1
- Date: Wed, 2 Nov 2022 06:37:01 GMT
- Title: Discover Important Paths in the Knowledge Graph Based on Dynamic
Relation Confidence
- Authors: Shanqing Yu, Yijun Wu, Ran Gan, Jiajun Zhou, Ziwan Zheng, Qi Xuan
- Abstract summary: The reasoning method based on path features is widely used in the field of knowledge graph reasoning.
This paper proposes a method called DC-Path that combines dynamic relation confidence and other indicators to evaluate path features.
- Score: 2.6032596415721945
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most of the existing knowledge graphs are not usually complete and can be
complemented by some reasoning algorithms. The reasoning method based on path
features is widely used in the field of knowledge graph reasoning and
completion on account of that its have strong interpretability. However,
reasoning methods based on path features still have several problems in the
following aspects: Path search isinefficient, insufficient paths for sparse
tasks and some paths are not helpful for reasoning tasks. In order to solve the
above problems, this paper proposes a method called DC-Path that combines
dynamic relation confidence and other indicators to evaluate path features, and
then guide path search, finally conduct relation reasoning. Experimental result
show that compared with the existing relation reasoning algorithm, this method
can select the most representative features in the current reasoning task from
the knowledge graph and achieve better performance on the current relation
reasoning task.
Related papers
- Neural Probabilistic Logic Learning for Knowledge Graph Reasoning [10.473897846826956]
This paper aims to design a reasoning framework that achieves accurate reasoning on knowledge graphs.
We introduce a scoring module that effectively enhances the expressive power of embedding networks.
We improve the interpretability of the model by incorporating a Markov Logic Network based on variational inference.
arXiv Detail & Related papers (2024-07-04T07:45:46Z) - Improving Multi-hop Logical Reasoning in Knowledge Graphs with Context-Aware Query Representation Learning [3.7411114598484647]
Multi-hop logical reasoning on knowledge graphs is a pivotal task in natural language processing.
We propose a model-agnostic methodology that enhances the effectiveness of existing multi-hop logical reasoning approaches.
Our method consistently enhances the three multi-hop reasoning foundation models, achieving performance improvements of up to 19.5%.
arXiv Detail & Related papers (2024-06-11T07:48:20Z) - Can Graph Learning Improve Task Planning? [61.47027387839096]
Task planning is emerging as an important research topic alongside the development of large language models (LLMs)
In this paper, we explore graph learning-based methods for task planning.
Our approach complements prompt engineering and fine-tuning techniques, with performance further enhanced by improved prompts or a fine-tuned model.
arXiv Detail & Related papers (2024-05-29T14:26:24Z) - Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective [6.199818486385127]
We use the trial-and-error paradigm of Reinforcement Learning for discovering better decision-making strategies.
This work focuses on non-canonical graph problems for which performant algorithms are typically not known.
arXiv Detail & Related papers (2024-04-09T17:45:25Z) - Understanding Reasoning Ability of Language Models From the Perspective of Reasoning Paths Aggregation [110.71955853831707]
We view LMs as deriving new conclusions by aggregating indirect reasoning paths seen at pre-training time.
We formalize the reasoning paths as random walk paths on the knowledge/reasoning graphs.
Experiments and analysis on multiple KG and CoT datasets reveal the effect of training on random walk paths.
arXiv Detail & Related papers (2024-02-05T18:25:51Z) - Multi-modal Causal Structure Learning and Root Cause Analysis [67.67578590390907]
We propose Mulan, a unified multi-modal causal structure learning method for root cause localization.
We leverage a log-tailored language model to facilitate log representation learning, converting log sequences into time-series data.
We also introduce a novel key performance indicator-aware attention mechanism for assessing modality reliability and co-learning a final causal graph.
arXiv Detail & Related papers (2024-02-04T05:50:38Z) - PathFinder: Guided Search over Multi-Step Reasoning Paths [80.56102301441899]
We propose PathFinder, a tree-search-based reasoning path generation approach.
It enhances diverse branching and multi-hop reasoning through the integration of dynamic decoding.
Our model generalizes well to longer, unseen reasoning chains, reflecting similar complexities to beam search with large branching factors.
arXiv Detail & Related papers (2023-12-08T17:05:47Z) - Graph Collaborative Reasoning [18.45161138837384]
Graph Collaborative Reasoning (GCR) can use the neighbor link information for relational reasoning on graphs from logical reasoning perspectives.
We provide a simple approach to translate a graph structure into logical expressions, so that the link prediction task can be converted into a neural logic reasoning problem.
To show the effectiveness of our work, we conduct experiments on graph-related tasks such as link prediction and recommendation based on commonly used benchmark datasets.
arXiv Detail & Related papers (2021-12-27T14:27:58Z) - KompaRe: A Knowledge Graph Comparative Reasoning System [85.72488258453926]
This paper introduces comparative reasoning over knowledge graphs, which aims to infer the commonality and inconsistency with respect to multiple pieces of clues.
We develop KompaRe, the first of its kind prototype system that provides comparative reasoning capability over large knowledge graphs.
arXiv Detail & Related papers (2020-11-06T04:57:37Z) - Joint Semantics and Data-Driven Path Representation for Knowledge Graph
Inference [60.048447849653876]
We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding.
Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
arXiv Detail & Related papers (2020-10-06T10:24:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.