Spectral Initialization and Scheduled Graph Smoothness for Uncertain Knowledge Graph Completion
Uncertain knowledge graphs (UKGs) extend knowledge graphs by assigning each triple a continuous confidence score. Since most possible triples lack observed confidences, recent methods rely on semi-supervised learning to generate pseudo-labels. These methods initialize entity embeddings without using the confidence-weighted graph, discarding its global community and hub structure. We introduce…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
