你只迁移你共享的:交集诱导的图迁移学习用于链接预测
You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction
AI总结:
针对稀疏图链接预测,提出利用图间共享节点的交集诱导迁移学习框架,通过交集子图迁移知识,在电商与引文数据上优于现有基线。
摘要:
链接预测是许多实际应用的核心,但其性能可能因目标图稀疏而受到阻碍。为缓解稀疏性引起的问题,我们研究了一个此前被忽视的现象:在许多情况下,可以为原始图找到一个密集连接且互补的图。该较密集的图可能与原始图共享节点,这为迁移选择性、有意义的知识提供了天然的桥梁。我们将此设定识别为图交集诱导的迁移学习(GITL),其动机源于电子商务或学术合著预测中的实际应用。我们开发了一个框架,以有效利用此设定中的结构先验。我们首先利用两图之间的共享节点创建交集子图,然后将知识从源增强的交集子图迁移到完整的目标图。在第二步中,我们考虑两种方法:改进的标签传播,以及教师-学生机制下的多层感知机(MLP)模型。在专有电子商务数据集和开源引文图上的实验结果表明,所提出的工作流优于未显式利用交集结构的现有迁移学习基线。
英文摘要:
Link prediction is central to many real-world applications, but its performance may be hampered when the graph of interest is sparse. To alleviate issues caused by sparsity, we investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions. We develop a framework to effectively leverage the structural prior in this setting. We first create an intersection subgraph using the shared nodes between the two graphs, then transfer knowledge from the source-enriched intersection subgraph to the full target graph. In the second step, we consider two approaches: a modified label propagation, and a multi-layer perceptron (MLP) model in a teacher-student regime. Experimental results on proprietary e-commerce datasets and open-source citation graphs show that the proposed workflow outperforms existing transfer learning baselines that do not explicitly utilize the intersection structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。