Wei Q, Hu G. Unifying Node Labels, Features, and Distances for Deep Network Completion.
ENTROPY 2021;
23:e23060771. [PMID:
34207438 PMCID:
PMC8234573 DOI:
10.3390/e23060771]
[Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/09/2021] [Revised: 06/15/2021] [Accepted: 06/16/2021] [Indexed: 11/23/2022]
Abstract
Collected network data are often incomplete, with both missing nodes and missing edges. Thus, network completion that infers the unobserved part of the network is essential for downstream tasks. Despite the emerging literature related to network recovery, the potential information has not been effectively exploited. In this paper, we propose a novel unified deep graph convolutional network that infers missing edges by leveraging node labels, features, and distances. Specifically, we first construct an estimated network topology for the unobserved part using node labels, then jointly refine the network topology and learn the edge likelihood with node labels, node features and distances. Extensive experiments using several real-world datasets show the superiority of our method compared with the state-of-the-art approaches.
Collapse