针对噪声异构图,提出用特征相似性构建新图来提升表示学习效果。
NoiseHGNN: Synthesized Similarity Graph-Based Neural Network For Noised Heterogeneous Graph Representation Learning
- 基于节点特征相似性构建高阶相似图,修正原始噪声图结构。
- 同步监督原始与相似图的嵌入,提升标签预测准确率。
- 适合处理含链接噪声的异构图任务,尤其在低质量数据上表现突出。
真实世界图数据普遍存在噪声(如链接错误、结构偏差),严重影响图表示学习与下游任务效果。现有方法在同质图中利用原始节点特征生成相似性图以修复结构,其前提为“相似节点间存在直接连接”。然而,在异构图中,相似节点往往无直接边,该假设失效,导致噪声异构图学习面临挑战。本文提出一种新型合成相似性图神经网络,首先计算所有节点的特征相似性,构建高阶相似图;其次设计相似性感知编码器,共享参数融合原始图与合成图;然后采用同步监督策略,使原始图与合成图的嵌入共同预测相同标签;同时,从合成图提取的目标图与从原始图通过元路径提取的图进行对比,学习相互信息。大量实验表明,该方法在多个真实数据集上达到当前最优性能,部分噪声数据集相较以往SOTA提升5~6%。代码与数据已开源。
原文摘要 · Abstract (English)
Real-world graph data environments intrinsically exist noise (e.g., link and structure errors) that inevitably disturb the effectiveness of graph representation and downstream learning tasks. For homogeneous graphs, the latest works use original node features to synthesize a similarity graph that can correct the structure of the noised graph. This idea is based on the homogeneity assumption, which states that similar nodes in the homogeneous graph tend to have direct links in the original graph. However, similar nodes in heterogeneous graphs usually do not have direct links, which can not be used to correct the original noise graph. This causes a significant challenge in noised heterogeneous graph learning. To this end, this paper proposes a novel synthesized similarity-based graph neural network compatible with noised heterogeneous graph learning. First, we calculate the original feature similarities of all nodes to synthesize a similarity-based high-order graph. Second, we propose a similarity-aware encoder to embed original and synthesized graphs with shared parameters. Then, instead of graph-to-graph supervising, we synchronously supervise the original and synthesized graph embeddings to predict the same labels. Meanwhile, a target-based graph extracted from the synthesized graph contrasts the structure of the metapath-based graph extracted from the original graph to learn the mutual information. Extensive experiments in numerous real-world datasets show the proposed method achieves state-of-the-art records in the noised heterogeneous graph learning tasks. In highlights, +5$\sim$6\% improvements are observed in several noised datasets compared with previous SOTA methods. The code and datasets are available at https://github.com/kg-cc/NoiseHGNN.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。