Completing Networks by Learning Local Connection Patterns. (arXiv:2204.11852v2 [cs.LG] UPDATED)

Network completion is a harder problem than link prediction because it does
not only try to infer missing links but also nodes. Different methods have been
proposed to solve this problem, but few of them employed structural information
- the similarity of local connection patterns. In this paper, we propose a
model named C-GIN to capture the local structural patterns from the observed
part of a network based on the Graph Auto-Encoder framework equipped with Graph
Isomorphism Network model and …

arxiv learning lg networks patterns