It is crucial to address category imbalance in real-world data on node classification in a graph. This paper introduces the GraphDHV model, a dual encoder that integrates node attributes and topological information. GraphDHV improves inter-class separability and intra-class compactness by employing degree logical edge removal and synthesizing enhanced attribute features with original topology. We compare GraphDHV with ten state-of-the-art baseline methods on six public benchmark datasets. Our experimental results demonstrate that GraphDHV significantly outperforms the baseline methods, with an improvement of the F1 score.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

GraphDHV: Graph Neural Network with Dual Hybrid View on Imbalanced Node Classification

  • Longqing Du,
  • Guangquan Lu,
  • Yadan Han,
  • Zhiping Luo,
  • Guoqiu Wen,
  • Liang Zhang,
  • Wanxin Chen,
  • Shichao Zhang

摘要

It is crucial to address category imbalance in real-world data on node classification in a graph. This paper introduces the GraphDHV model, a dual encoder that integrates node attributes and topological information. GraphDHV improves inter-class separability and intra-class compactness by employing degree logical edge removal and synthesizing enhanced attribute features with original topology. We compare GraphDHV with ten state-of-the-art baseline methods on six public benchmark datasets. Our experimental results demonstrate that GraphDHV significantly outperforms the baseline methods, with an improvement of the F1 score.