Pith. sign in

REVIEW 1 cited by

Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction

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 1911.09419 v3 pith:QQMBPPCW submitted 2019-11-21 cs.LG cs.CLstat.ML

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

Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown to be a powerful technique for predicting missing links in knowledge graphs. Existing knowledge graph embedding models mainly focus on modeling relation patterns such as symmetry/antisymmetry, inversion, and composition. However, many existing approaches fail to model semantic hierarchies, which are common in real-world applications. To address this challenge, we propose a novel knowledge graph embedding model -- namely, Hierarchy-Aware Knowledge Graph Embedding (HAKE) -- which maps entities into the polar coordinate system. HAKE is inspired by the fact that concentric circles in the polar coordinate system can naturally reflect the hierarchy. Specifically, the radial coordinate aims to model entities at different levels of the hierarchy, and entities with smaller radii are expected to be at higher levels; the angular coordinate aims to distinguish entities at the same level of the hierarchy, and these entities are expected to have roughly the same radii but different angles. Experiments demonstrate that HAKE can effectively model the semantic hierarchies in knowledge graphs, and significantly outperforms existing state-of-the-art methods on benchmark datasets for the link prediction task.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A Contextualized BERT model for Knowledge Graph Completion

    cs.CL 2024-12 reject novelty 4.0 of 10

    CAB-KGC, a BERT classifier using head and relation context, reports Hit@1 of 0.322 on FB15k-237 and 0.637 on WN18RR, but the claimed SOTA gains do not match the paper's own comparison table.

Pith tools