Pith. sign in

REVIEW 2 cited by

Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.01195 v1 pith:IELJXSH3 submitted 2019-06-04 cs.LG cs.CLstat.ML

classification cs.LGcs.CLstat.ML
keywords relationembeddingsknowledgepredictionattentionentityfeaturegraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer and more expressive feature embeddings and hence also perform well on relation prediction. However, we observe that these KG embeddings treat triples independently and thus fail to cover the complex and hidden information that is inherently implicit in the local neighborhood surrounding a triple. To this effect, our paper proposes a novel attention based feature embedding that captures both entity and relation features in any given entity's neighborhood. Additionally, we also encapsulate relation clusters and multihop relations in our model. Our empirical study offers insights into the efficacy of our attention based model and we show marked performance gains in comparison to state of the art methods on all datasets.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A survey of n-ary knowledge representation learning methods proposes a two-dimensional taxonomy based on modeling technique and entity role/position awareness.

  2. Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs

    cs.LG 2025-07 reject novelty 2.0 of 10

    GCAT is presented as a new graph attention model for knowledge graph link prediction, but its equations are those of KBGAT and its reported benchmark numbers do not support the stated performance claims.

Pith tools