CoChat

Knowledge Base Completion via Coupled Path Ranking

Open access
Wang, Quan, Liu, Jing, Luo, Yuanfei, Wang, Bin, Lin, Chin-Yew · 2016 · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Cited by 74

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Abstract

Knowledge bases (KBs) are often greatly incomplete, necessitating a demand for K-B completion.The path ranking algorithm (PRA) is one of the most promising approaches to this task.Previous work on PRA usually follows a single-task learning paradigm, building a prediction model for each relation independently with its own training data.It ignores meaningful associations among certain relations, and might not get enough training data for less frequent relations.This paper proposes a novel multi-task learning framework for PRA, referred to as coupled PRA (CPRA).It first devises an agglomerative clustering strategy to automatically discover relations that are highly correlated to each other, and then employs a multi-task learning strategy to effectively couple the prediction of such relations.As such, CPRA takes into account relation association and enables implicit data sharing among them.We empirically evaluate CPRA on benchmark data created from Freebase.Experimental results show that CPRA can effectively identify coherent clusters in which relations are highly correlated.By further coupling such relations, CPRA significantly outperforms PRA, in terms of both predictive accuracy and model interpretability.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/p16-1124

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 74

Metadata

Authors
Wang, Q., Liu, J., Luo, Y., Wang, B., & Lin, C.-Y.
Venue
Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Published
2016
Pages
1308-1318
OpenAlex
W2508664155
Cited by
74
References
6
FWCI
5.99
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.