High sparse Knowledge Graph is a key challenge to solve the Knowledge Graph Completion task. Due to the sparsity of the KGs, there are not enough first-order neighbors to learn the features of ...

One notable advance in the field is the formulation of metrics that capture convergence properties of sparse graph sequences via Borel measures, thus generalising classical dense graph limits [1].