PathE computes knowledge graph entity embeddings from relation paths using only relation embedding tables, achieving strong relation prediction with very low parameter counts.
Pan, and Huajun Chen
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings
PathE computes knowledge graph entity embeddings from relation paths using only relation embedding tables, achieving strong relation prediction with very low parameter counts.