面向节点分类的最优传输跨网络关系学习

    Cross-Network Relationship Learning for Node Classification via Optimal Transport

    • 摘要: 跨网络节点分类试图从具有丰富标注节点的源网络中提取并迁移知识,用于预测目标网络中节点的标签。现有方法主要侧重于在共享嵌入空间中构建两个网络之间的联系,从而减小两个网络之间节点嵌入的分布差异,对分布在两个网络上节点之间的关系少有研究。本文通过学习不同网络节点之间的跨网络关系,并根据学习到的关系进行跨网络信息聚合,提出了一种基于最优传输的Fused Gromov-Wasserstein 模型,利用特征、结构和标签信息来构建两个网络之间的节点关系。基于学习到的关系,本文设计了一个跨网络图卷积网络来学习节点嵌入。在基准数据集上进行了实验,结果表明,与先进的方法相比,本文提出的方法更优。

       

      Abstract: Cross-network node classification aims to transfer knowledge extracted from a source network with sufficient labeled nodes to predict labels for nodes in a target network. Existing methods mainly focus on associating two networks in a shared embedding space, where the distribution discrepancy of node embedding across two networks isminimized. However, the relationship across two networks remains underexplored. In this paper, we propose a method that learns cross-network relationship among nodes from different networks and performs information aggregation across networks based on our learned relationship. To achieve this, we introduce a labeled Fused Gromov-Wasserstein model based on optimal transport, which exploits feature, structure and label information to construct node association between two networks. Based on the cross-network relationship, we design a cross-network graph convolutional network to learn node embeddings. Experimental results on several benchmark datasets show the superiority of the proposed method over state-of-the-art methods.

       

    /

    返回文章
    返回