Relation operators in knowledge graphs are Kraus channels obeying three axioms, enabling KrausKGE which outperforms baselines on N-to-N relations and supplies a rank-based complexity measure.
Knowledge graph embedding: A survey from the perspective of representation spaces.ACM Computing Surveys, 56(6):1–42
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions
Relation operators in knowledge graphs are Kraus channels obeying three axioms, enabling KrausKGE which outperforms baselines on N-to-N relations and supplies a rank-based complexity measure.