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.
Complex embeddings for simple link prediction
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Knowledge graph embeddings predict missing connections to generate context-specific data quality assessment plans, tested on a radiation sensor dataset.
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.
-
Automated Big Data Quality Assessment using Knowledge Graph Embeddings
Knowledge graph embeddings predict missing connections to generate context-specific data quality assessment plans, tested on a radiation sensor dataset.