arrow
返回

Learning Graph Representation With Generative Adversarial Nets

delete2021-08-01
delete59
PRE
AI
H
Hongwei Wang *
J
Jialin Wang
王佳 封面图
王佳 (Jia Wang)
M
Miao Zhao
W
Weinan Zhang
F
Fuzheng Zhang
W
Wenjie Li
X
Xing Xie
过敏意 (Minyi Guo)
DOI:10.1109/TKDE.2019.2961882delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph representation learning aims to embed each vertex in a graph into a low-dimensional vector space. Existing graph representation learning methods can be classified into two categories: generative models that learn the underlying connectivity distribution in a graph, and discriminative models that predict the probability of edge between a pair of vertices. In this paper, we propose GraphGAN, an innovative graph representation learning framework unifying the above two classes of methods, in which the generative and the discriminative model play a game-theoretical minimax game. Specifically, for a given vertex, the generative model tries to fit its underlying true connectivity distribution over all other vertices and produces fake samples to fool the discriminative model, while the discriminative model tries to detect whether the sampled vertex is from ground truth or generated by the generative model. With the competition between these two models, both of them can alternately and iteratively boost their performance. Moreover, we propose a novel graph softmax as the implementation of the generative model to overcome the limitations of traditional softmax function, which can be proven satisfying desirable properties of normalization, graph structure awareness, and computational efficiency. Through extensive experiments on real-world datasets, we demonstrate that GraphGAN achieves substantial gains in a variety of applications, including graph reconstruction, link prediction, node classification, recommendation, and visualization, over state-of-the-art baselines.
Keyword:
Generators
Learning systems
Training
Games
Computational modeling
Task analysis
Feature extraction
Graph representation learning
generative adversarial nets
graph softmax
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.8K
被引数:
3.2W

机构

H
hong kong polytechnic university
学者数:
3.0W
论文数: 4.1W
被引数: 921
S
shanghai jiao tong university
学者数:
15.7W
论文数: 11.7W
被引数: 159
M
Microsoft
学者数:
3.0K
论文数: 2.7K
被引数: 7
学者 查看更多机构
引用论文

引用论文

Prostate-derived Ets factor, an oncogenic driver in breast cancer
err2017-05-04
err0
errOAAI
errAshwani K Sood; Joseph Geradts; Jessica Young
err分享
err收藏
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
err分享
err收藏
学者 查看更多内容