Neighbor-anchoring adversarial graph neural networks
Graph neural networks (GNNs) have witnessed widespread adoption due to their ability to learn superior representations for graph data. While GNNs exhibit strong discriminative power, they often fall short of learning the underlying node distribution for increased robustness. To deal with this, inspi...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8200 https://ink.library.smu.edu.sg/context/sis_research/article/9203/viewcontent/TKDE21_NAGNN.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-9203 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-92032023-10-04T05:23:29Z Neighbor-anchoring adversarial graph neural networks LIU, Zemin FANG, Yuan LIU, Yong ZHENG, Vincent W. Graph neural networks (GNNs) have witnessed widespread adoption due to their ability to learn superior representations for graph data. While GNNs exhibit strong discriminative power, they often fall short of learning the underlying node distribution for increased robustness. To deal with this, inspired by generative adversarial networks (GANs), we investigate the problem of adversarial learning on graph neural networks, and propose a novel framework named NAGNN (i.e., Neighbor-anchoring Adversarial Graph Neural Networks) for graph representation learning, which trains not only a discriminator but also a generator that compete with each other. In particular, we propose a novel neighbor-anchoring strategy, where the generator produces samples with explicit features and neighborhood structures anchored on a reference real node, so that the discriminator can perform neighborhood aggregation on the fake samples to learn superior representation. The advantage of our neighbor-anchoring strategy can be demonstrated both theoretically and empirically. Furthermore, as a by-product, our generator can synthesize realistic-looking features, enabling potential applications such as automatic content summarization. Finally, we conduct extensive experiments on four public benchmark datasets, and achieve promising results under both quantitative and qualitative evaluations. 2023-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8200 info:doi/10.1109/TKDE.2021.3087970 https://ink.library.smu.edu.sg/context/sis_research/article/9203/viewcontent/TKDE21_NAGNN.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 Neighbor-anchoring generative adversarial network graph neural network Databases and Information Systems |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Neighbor-anchoring generative adversarial network graph neural network Databases and Information Systems |
spellingShingle |
Neighbor-anchoring generative adversarial network graph neural network Databases and Information Systems LIU, Zemin FANG, Yuan LIU, Yong ZHENG, Vincent W. Neighbor-anchoring adversarial graph neural networks |
description |
Graph neural networks (GNNs) have witnessed widespread adoption due to their ability to learn superior representations for graph data. While GNNs exhibit strong discriminative power, they often fall short of learning the underlying node distribution for increased robustness. To deal with this, inspired by generative adversarial networks (GANs), we investigate the problem of adversarial learning on graph neural networks, and propose a novel framework named NAGNN (i.e., Neighbor-anchoring Adversarial Graph Neural Networks) for graph representation learning, which trains not only a discriminator but also a generator that compete with each other. In particular, we propose a novel neighbor-anchoring strategy, where the generator produces samples with explicit features and neighborhood structures anchored on a reference real node, so that the discriminator can perform neighborhood aggregation on the fake samples to learn superior representation. The advantage of our neighbor-anchoring strategy can be demonstrated both theoretically and empirically. Furthermore, as a by-product, our generator can synthesize realistic-looking features, enabling potential applications such as automatic content summarization. Finally, we conduct extensive experiments on four public benchmark datasets, and achieve promising results under both quantitative and qualitative evaluations. |
format |
text |
author |
LIU, Zemin FANG, Yuan LIU, Yong ZHENG, Vincent W. |
author_facet |
LIU, Zemin FANG, Yuan LIU, Yong ZHENG, Vincent W. |
author_sort |
LIU, Zemin |
title |
Neighbor-anchoring adversarial graph neural networks |
title_short |
Neighbor-anchoring adversarial graph neural networks |
title_full |
Neighbor-anchoring adversarial graph neural networks |
title_fullStr |
Neighbor-anchoring adversarial graph neural networks |
title_full_unstemmed |
Neighbor-anchoring adversarial graph neural networks |
title_sort |
neighbor-anchoring adversarial graph neural networks |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2023 |
url |
https://ink.library.smu.edu.sg/sis_research/8200 https://ink.library.smu.edu.sg/context/sis_research/article/9203/viewcontent/TKDE21_NAGNN.pdf |
_version_ |
1779157223565426688 |