Motif-Driven Contrastive Learning of Graph Representations

主题(音乐) 计算机科学 图形 聚类分析 理论计算机科学 组合数学 人工智能 数学 声学 物理
作者
Shichang Zhang,Ziniu Hu,Arjun Subramonian,Yizhou Sun
出处
期刊:IEEE Transactions on Knowledge and Data Engineering [Institute of Electrical and Electronics Engineers]
卷期号:: 1-12 被引量:2
标识
DOI:10.1109/tkde.2024.3364059
摘要

Graph motifs are significant subgraph patterns occurring frequently in graphs, and they play important roles in representing the whole graph characteristics. For example, in the chemical domain, functional groups are motifs that can determine molecule properties. Mining and utilizing motifs, however, is a non-trivial task for large graph datasets. Traditional motif discovery approaches mostly rely on exact counting or statistical estimation, which are hard to scale for a large number of graphs with continuous and high-dimension features. In light of the significance and challenges of motif mining, we propose : MICRO-Graph: a framework for \underline{M}ot\underline{I}f-driven \underline{C}ontrastive lea\underline{R}ning \underline{O}f \underline{G}raph representations to: 1) pre-train Graph Neural Networks (GNNs) in a self-supervised manner to automatically extract graph motifs from large graph datasets; 2) leverage learned motifs to guide the contrastive learning of graph representations, which further benefit various graph downstream tasks. Specifically, given a graph dataset, a motif learner cluster similar and significant subgraphs into corresponding motif slots. Based on the learned motifs, a motif-guided subgraph segmenter is trained to generate more informative subgraphs, which are used to conduct graph-to-subgraph contrastive learning of GNNs. Our discovering strategy is to simutaneously do clustering and contrastive learning on dynamically sampled subgraphs. The clustering part pull together similar subgraphs across different whole graphs, as the contrastive part push away dissimilar ones. Meanwhile, our learnable sampler will generate subgraph samples better aligned with the discoverying procedure. By pre-training on ogbn-molhiv molecule dataset with our proposed MICRO-Graph, the pre-trained GNN model can enhance various chemical property prediction downstream tasks with scarce label by 2.0%, and significantly higher than other state-of-the-art self-supervised learning baselines.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
2秒前
4秒前
深情安青应助结实初翠采纳,获得10
7秒前
junmoxiao发布了新的文献求助10
7秒前
年轻的汽车完成签到 ,获得积分10
9秒前
10秒前
11秒前
科目三应助ddd采纳,获得10
11秒前
QuangVu完成签到,获得积分10
13秒前
Giroro_roro完成签到,获得积分10
13秒前
程程完成签到,获得积分10
13秒前
13秒前
15秒前
16秒前
16秒前
TY发布了新的文献求助10
18秒前
传统的盼波完成签到,获得积分20
18秒前
舒心乐荷关注了科研通微信公众号
18秒前
xxxksk完成签到 ,获得积分10
19秒前
19秒前
江江完成签到,获得积分10
20秒前
小二郎应助camellia采纳,获得10
22秒前
清秀小蘑菇完成签到,获得积分10
23秒前
May发布了新的文献求助10
23秒前
Emma Lee发布了新的文献求助10
25秒前
25秒前
魁梧的雨双完成签到,获得积分10
26秒前
27秒前
29秒前
英姑应助温暖的数据线采纳,获得10
29秒前
酸汤肥牛完成签到,获得积分10
29秒前
SOLOMON应助May采纳,获得10
30秒前
Orange应助话落谁家采纳,获得10
31秒前
鲫鱼仔发布了新的文献求助10
31秒前
罗_应助菜鸟科研采纳,获得20
31秒前
31秒前
深情安青应助lindsay采纳,获得10
32秒前
orixero应助科研通管家采纳,获得10
32秒前
newfat应助科研通管家采纳,获得30
32秒前
高分求助中
Manual of Clinical Microbiology, 4 Volume Set (ASM Books) 13th Edition 1000
Teaching Social and Emotional Learning in Physical Education 900
Chinese-English Translation Lexicon Version 3.0 500
Electronic Structure Calculations and Structure-Property Relationships on Aromatic Nitro Compounds 500
マンネンタケ科植物由来メロテルペノイド類の網羅的全合成/Collective Synthesis of Meroterpenoids Derived from Ganoderma Family 500
[Lambert-Eaton syndrome without calcium channel autoantibodies] 440
Two-sample Mendelian randomization analysis reveals causal relationships between blood lipids and venous thromboembolism 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2382231
求助须知:如何正确求助?哪些是违规求助? 2089333
关于积分的说明 5249296
捐赠科研通 1816181
什么是DOI,文献DOI怎么找? 906088
版权声明 558898
科研通“疑难数据库(出版商)”最低求助积分说明 483795