The study introduces a breakthrough method for Knowledge Graph Completion that utilizes higher-order neighbor subgraphs to effectively address the challenge of high sparsity in Knowledge Graphs.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback