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.
Springer, 1983
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 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.