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.
Representing text for joint embedding of text and knowledge bases
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
dataset 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
dataset 1polarities
use dataset 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.