Fact Checking via Path Embedding and Aggregation

• URL: http://arxiv.org/abs/2011.08028v1
• Date: Mon, 16 Nov 2020 15:27:38 GMT
• Title: Fact Checking via Path Embedding and Aggregation
• Authors: Giuseppe Pirr\`o
• Abstract summary: This paper presents the Fact Checking via path Embedding and Aggregation (FEA) system. FEA starts by carefully collecting the paths between s and o that are most semantically related to the domain of p. We conducted a large set of experiments on a variety of KGs and found that our hybrid solution brings some benefits in terms of performance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge graphs (KGs) are a useful source of background knowledge to (dis)prove facts of the form (s, p, o). Finding paths between s and o is the cornerstone of several fact-checking approaches. While paths are useful to (visually) explain why a given fact is true or false, it is not completely clear how to identify paths that are most relevant to a fact, encode them and weigh their importance. The goal of this paper is to present the Fact Checking via path Embedding and Aggregation (FEA) system. FEA starts by carefully collecting the paths between s and o that are most semantically related to the domain of p. However, instead of directly working with this subset of all paths, it learns vectorized path representations, aggregates them according to different strategies, and use them to finally (dis)prove a fact. We conducted a large set of experiments on a variety of KGs and found that our hybrid solution brings some benefits in terms of performance.

Related papers

• Soft Reasoning Paths for Knowledge Graph Completion [63.23109723605835]
  Reasoning paths are reliable information in knowledge graph completion (KGC)<n>In real-world applications, it is difficult to guarantee that computationally affordable paths exist toward all candidate entities.<n>We introduce soft reasoning paths to make the proposed algorithm more stable against missing path circumstances.
  arXiv  Detail & Related papers  (2025-05-06T08:12:48Z)
• eXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rules [12.802269132505364]
  Link prediction (LP) is crucial for Knowledge Graphs (KG) completion but commonly suffers from interpretability issues. We propose to explain LP models in KG with path-based explanations.
  arXiv  Detail & Related papers  (2024-12-06T08:33:49Z)
• Mining Path Association Rules in Large Property Graphs (with Appendix) [15.11494401922146]
  Association rule mining successfully discovers regular patterns in item sets and substructures. We introduce the problem of path association rule mining (PARM) We develop an efficient and scalable algorithm PIONEER that exploits an anti-monotonicity property to effectively prune the search space.
  arXiv  Detail & Related papers  (2024-08-04T13:39:57Z)
• Look Globally and Reason: Two-stage Path Reasoning over Sparse Knowledge Graphs [70.8150181683017]
  Sparse Knowledge Graphs (KGs) contain fewer facts in the form of (head entity, relation, tail entity) compared to more populated KGs. This paper proposes a two-stage path reasoning model called LoGRe (Look Globally and Reason) over sparse KGs.
  arXiv  Detail & Related papers  (2024-07-26T07:10:27Z)
• Knowledge Graph-Enhanced Large Language Models via Path Selection [58.228392005755026]
  Large Language Models (LLMs) have shown unprecedented performance in various real-world applications. LLMs are known to generate factually inaccurate outputs, a.k.a. the hallucination problem. We propose a principled framework KELP with three stages to handle the above problems.
  arXiv  Detail & Related papers  (2024-06-19T21:45:20Z)
• 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)
• Path Choice Matters for Clear Attribution in Path Methods [84.29092710376217]
  We introduce textbfConcentration Principle, which allocates high attributions to indispensable features. We then present textbfSAMP, a model-agnostic interpreter, which efficiently searches the near-optimal path. We also propose the infinitesimal constraint (IC) and momentum strategy (MS) to improve the rigorousness and optimality.
  arXiv  Detail & Related papers  (2024-01-19T01:11:44Z)
• Discover Important Paths in the Knowledge Graph Based on Dynamic Relation Confidence [2.6032596415721945]
  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.
  arXiv  Detail & Related papers  (2022-11-02T06:37:01Z)
• Ablation Path Saliency [0.0]
  Several types of saliency methods have been proposed for explaining black-box classification. We observe however that several of these methods can be seen as edge cases of a single, more general procedure. We demonstrate furthermore that ablation paths can be directly used as a technique of its own right.
  arXiv  Detail & Related papers  (2022-09-26T07:00:40Z)
• 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)
• Connecting the Dots: A Knowledgeable Path Generator for Commonsense Question Answering [50.72473345911147]
  This paper augments a general commonsense QA framework with a knowledgeable path generator. By extrapolating over existing paths in a KG with a state-of-the-art language model, our generator learns to connect a pair of entities in text with a dynamic, and potentially novel, multi-hop relational path.
  arXiv  Detail & Related papers  (2020-05-02T03:53:21Z)

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.