Diffusion-based negative sampling on graphs for link prediction
Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is...
Saved in:
Main Author: | |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8709 https://ink.library.smu.edu.sg/context/sis_research/article/9712/viewcontent/DMNS__WWW24_Camera_Ready___1_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-9712 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-97122024-04-04T09:05:00Z Diffusion-based negative sampling on graphs for link prediction FANG, Yuan FANG, Yuan Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. To address these issues, we investigate a novel strategy of multi-level negative sampling that enables negative node generation with flexible and controllable “hardness” levels from the latent space. Our method, called Conditional Diffusion-based Multi-level Negative Sampling (DMNS), leverages the Markov chain property of diffusion models to generate negative nodes in multiple levels of variable hardness and reconcile them for effective graph link prediction. We further demonstrate that DMNS follows the sub-linear positivity principle for robust negative sampling. Extensive experiments on several benchmark datasets demonstrate the effectiveness of DMNS. 2024-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8709 info:doi/10.1145/3589334.3645650 https://ink.library.smu.edu.sg/context/sis_research/article/9712/viewcontent/DMNS__WWW24_Camera_Ready___1_.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University link prediction negative sampling diffusion models graph neural networks Artificial Intelligence and Robotics Databases and Information Systems Graphics and Human Computer Interfaces |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
link prediction negative sampling diffusion models graph neural networks Artificial Intelligence and Robotics Databases and Information Systems Graphics and Human Computer Interfaces |
spellingShingle |
link prediction negative sampling diffusion models graph neural networks Artificial Intelligence and Robotics Databases and Information Systems Graphics and Human Computer Interfaces FANG, Yuan FANG, Yuan Diffusion-based negative sampling on graphs for link prediction |
description |
Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. To address these issues, we investigate a novel strategy of multi-level negative sampling that enables negative node generation with flexible and controllable “hardness” levels from the latent space. Our method, called Conditional Diffusion-based Multi-level Negative Sampling (DMNS), leverages the Markov chain property of diffusion models to generate negative nodes in multiple levels of variable hardness and reconcile them for effective graph link prediction. We further demonstrate that DMNS follows the sub-linear positivity principle for robust negative sampling. Extensive experiments on several benchmark datasets demonstrate the effectiveness of DMNS. |
format |
text |
author |
FANG, Yuan FANG, Yuan |
author_facet |
FANG, Yuan FANG, Yuan |
author_sort |
FANG, Yuan |
title |
Diffusion-based negative sampling on graphs for link prediction |
title_short |
Diffusion-based negative sampling on graphs for link prediction |
title_full |
Diffusion-based negative sampling on graphs for link prediction |
title_fullStr |
Diffusion-based negative sampling on graphs for link prediction |
title_full_unstemmed |
Diffusion-based negative sampling on graphs for link prediction |
title_sort |
diffusion-based negative sampling on graphs for link prediction |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2024 |
url |
https://ink.library.smu.edu.sg/sis_research/8709 https://ink.library.smu.edu.sg/context/sis_research/article/9712/viewcontent/DMNS__WWW24_Camera_Ready___1_.pdf |
_version_ |
1814047472734961664 |