ITERATIVE DEEP GRAPH LEARNING FOR GRAPH NEURAL NETWORKS

摘要

An initial noisy graph topology is obtained and an initial adjacency matrix is generated by a similarity learning component using similarity learning and a similarity metric function. An updated adjacency matrix with node embeddings is produced from the initial adjacency matrix using a graph neural network (GNN). The node embeddings are fed back to revise the similarity learning component. The generating, producing, and feeding back operations are repeated for a plurality of iterations.