Nodes in a multiplex network are connected by multiple types of relations. However, most existing network embedding methods assume that only a single type of relation exists between nodes. Even for those that consider the multiplexity of a network, they overlook node attributes, resort to node labels for training, and fail to model the global properties of a graph. We present a simple yet effective unsupervised network embedding method for attributed multiplex network called DMGI, inspired by Deep Graph Infomax (DGI) that maximizes the mutual information between local patches of a graph, and the global representation of the entire graph. We devise a systematic way to jointly integrate the node embeddings from multiple graphs by introducing 1) the consensus regularization framework that minimizes the disagreements among the relation-type specific node embeddings, and 2) the universal discriminator that discriminates true samples regardless of the relation types. We also show that the attention mechanism infers the importance of each relation type, and thus can be useful for filtering unnecessary relation types as a preprocessing step. Extensive experiments on various downstream tasks demonstrate that DMGI outperforms the state-of-the-art methods, even though DMGI is fully unsupervised.

本文提出了一种面向具有属性的多重网络的简单而有效的无监督网络嵌入方法DMGI，利用深度图最大化(DGI)的思想来最大化图的局部信息和全局表示，与关系类型的特定节点嵌入之间的差异，处理多种关系类型的节点之间的差异性，并使用注意机制来过滤不必要的关系类型，经实验证明DMGI的性能优于现有的最先进方法。

无监督带属性多重网络嵌入