Pith. sign in

REVIEW 2 cited by

Knowledge Graph Embedding using Graph Convolutional Networks with Relation-Aware Attention

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 2102.07200 v1 pith:ZNCE7BD6 submitted 2021-02-14 cs.LG cs.AI

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

Knowledge graph embedding methods learn embeddings of entities and relations in a low dimensional space which can be used for various downstream machine learning tasks such as link prediction and entity matching. Various graph convolutional network methods have been proposed which use different types of information to learn the features of entities and relations. However, these methods assign the same weight (importance) to the neighbors when aggregating the information, ignoring the role of different relations with the neighboring entities. To this end, we propose a relation-aware graph attention model that leverages relation information to compute different weights to the neighboring nodes for learning embeddings of entities and relations. We evaluate our proposed approach on link prediction and entity matching tasks. Our experimental results on link prediction on three datasets (one proprietary and two public) and results on unsupervised entity matching on one proprietary dataset demonstrate the effectiveness of the relation-aware attention.

Discussion (0). Continue with ORCID 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. ReaLM: Residual Quantization Bridging Knowledge Graph Embeddings and Large Language Models

    cs.CL 2025-10 conditional novelty 4.0 of 10

    Using residual quantization to represent KG entities as code tokens lets an LLM do link prediction and reach reported state-of-the-art MRR on WN18RR (0.608) and FB15k-237 (0.467) when ontology constraints are added.

  2. OpenAg: Democratizing Agricultural Intelligence

    cs.AI 2025-06 unverdicted novelty 3.0 of 10

    A conceptual framework that assembles existing knowledge graph, multi-agent, causal AI, and transfer learning methods for agriculture, presented without experimental validation.

Pith tools