Evidence map›Paper›PMID 37981625›Full record

ArticleVisual computing for industry, biomedicine, and art2023

Reliable knowledge graph fact prediction via reinforcement learning.

Fangfang Zhou, Jiapeng Mi, Beiwen Zhang, Jingcheng Shi, Ran Zhang, Xiaohui Chen, Ying Zhao, Jian Zhang

Abstract read
In one paragraph

Article in Visual computing for industry, biomedicine, and art, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. V4RIN: visual analysis of regional industry network with domain knowledge.Visual computing for industry, biomedicine, and art · 2024
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Fangfang ZhouSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China.
Jiapeng MiSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China.
Beiwen ZhangSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China.
Jingcheng ShiSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China.
Ran ZhangSchool of Target and Data, Information Engineering University, Zheng Zhou, Henan, 450001, China.
Xiaohui ChenSchool of Target and Data, Information Engineering University, Zheng Zhou, Henan, 450001, China.
Ying ZhaoSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China.
Jian ZhangSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, 410083, China. jianzhang@csu.edu.cn.ORCID http://orcid.org/0000-0001-5418-0455

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Knowledge graph (KG) fact prediction aims to complete a KG by determining the truthfulness of predicted triples. Reinforcement learning (RL)-based approaches have been widely used for fact prediction. However, the existing approaches largely suffer from unreliable calculations on rule confidences owing to a limited number of obtained reasoning paths, thereby resulting in unreliable decisions on prediction triples. Hence, we propose a new RL-based approach named EvoPath in this study. EvoPath features a new reward mechanism based on entity heterogeneity, facilitating an agent to obtain effective reasoning paths during random walks. EvoPath also incorporates a new postwalking mechanism to leverage easily overlooked but valuable reasoning paths during RL. Both mechanisms provide sufficient reasoning paths to facilitate the reliable calculations of rule confidences, enabling EvoPath to make precise judgments about the truthfulness of prediction triples. Experiments demonstrate that EvoPath can achieve more accurate fact predictions than existing approaches.

Indexed as

Entity heterogeneityFact predictionKnowledge graphPostwalking mechanismReinforcement learning

Identifiers

PMID37981625
PMCPMC10657918

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.