Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation

Author:

Chen Ying1ORCID,Qiang Siwei1ORCID,Ha Mingming2ORCID,Liu Xiaolei1ORCID,Li Shaoshuai1ORCID,Tong Jiabi1ORCID,Yuan Lingfeng1ORCID,Guo Xiaobo3ORCID,Zhu Zhenfeng4ORCID

Affiliation:

1. MYbank, Ant Group, China

2. School of Automation and Electrical Engineering, University of Science and Technology Beijing, and MYbank, Ant Group, China

3. Institute of Information Science, Beijing Jiaotong University, and MYbank, Ant Group, China

4. Institute of Information Science, Beijing Jiaotong University, China

Abstract

In recent years, semi-supervised graph learning with data augmentation (DA) has been the most commonly used and best-performing method to improve model robustness in sparse scenarios with few labeled samples. However, most existing DA methods are based on the homogeneous graph, but none are specific for the heterogeneous graph. Differing from the homogeneous graph, DA in the heterogeneous graph faces greater challenges: heterogeneity of information requires DA strategies to effectively handle heterogeneous relations, which considers the information contribution of different types of neighbors and edges to the target nodes. Furthermore, over-squashing of information is caused by the negative curvature formed by the non-uniformity distribution and the strong clustering in a complex graph. To address these challenges, this article presents a novel method named HG-MDA (Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation). For the problem of heterogeneity of information in DA, node and topology augmentation strategies are proposed for the characteristics of the heterogeneous graph. Additionally, meta-relation-based attention is applied as one of the indexes for selecting augmented nodes and edges. For the problem of over-squashing of information, triangle-based edge adding and removing are designed to alleviate the negative curvature and bring the gain of topology. Finally, the loss function consists of the cross-entropy loss for labeled data and the consistency regularization for unlabeled data. To effectively fuse the prediction results of various DA strategies, sharpening is used. Existing experiments on public datasets (i.e., ACM, DBLP, and OGB) and the industry dataset MB show that HG-MDA outperforms current SOTA models. Additionally, HG-MDA is applied to user identification in internet finance scenarios, helping the business to add 30% key users, and increase loans and balances by 3.6%, 11.1%, and 9.8%.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference53 articles.

1. Friends and neighbors on the Web

2. On the bottleneck of graph neural networks and its practical implications;Alon Uri;arXiv preprint arXiv:2006.05205,2020

3. D. Berthelot N. Carlini I. Goodfellow N. Papernot A. Oliver and C. Raffel. 2019. MixMatch: A holistic approach to semi-supervised learning. arXiv:1905-02249 (2019).

4. P. Bielak T. Kajdanowicz and N. V. Chawla. 2021. Graph Barlow Twins: A self-supervised representation learning framework for graphs. arXiv:2106.02466 (2021).

5. Deyu Bo BinBin Hu Xiao Wang Zhiqiang Zhang Chuan Shi and Jun Zhou. 2022. Regularizing graph neural networks via consistency-diversity graph augmentations. Proceedings of the AAAI Conference on Artificial Intelligence 36 4 (2022) 3913–3921.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. MuHca: Mixup Heterogeneous Graphs for Contrastive Learning with Data Augmentation;PRICAI 2023: Trends in Artificial Intelligence;2023-11-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3