Methods › Graphs › Graph Embeddings › RelDiff
RelDiff
Introduced by Hitarth Narvala et al. in RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
RelDiff generates entity-relation-entity embeddings in a single embedding space. RelDiff adopts two fundamental vector algebraic operators to transform entity and relation embeddings from knowledge graphs into entity-relation-entity embeddings. In particular, RelDiff can encode finer-grained information about the relations than is captured when separate embeddings are learned for the entities and the relations.
Papers archive 2025-07-28
1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification 1 Nov 2021 · 0 repositories
Tasks archive 2025-07-28
6 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Entity Embeddings | 1 |
| Knowledge Graph Embeddings | 1 |
| Relation | 1 |
| Sensitivity | 1 |
| Sensitivity Classification | 1 |
| Text Classification | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections