We investigate how generative adversarial nets (GANs) can help semi-supervised learning on graphs. We first provide insights on working principles of adversarial learning over graphs and then present GraphSGAN, a novel approach to semi-supervised learning on graphs. In GraphSGAN, generator and classifier networks play a novel competitive game. At equilibrium, generator generates fake samples in low-density areas between subgraphs. In order to discriminate fake samples from the real, classifier implicitly takes the density property of subgraph into consideration. An efficient adversarial learning algorithm has been developed to improve traditional normalized graph Laplacian regularization with a theoretical guarantee. Experimental results on several different genres of datasets show that the proposed GraphSGAN significantly outperforms several state-of-the-art methods. GraphSGAN can be also trained using mini-batch, thus enjoys the scalability advantage.

研究使用生成式对抗网络来帮助半监督图学习，提出GraphSGAN方法，在该方法中，生成器和分类器网络进行竞争性博弈，生成器通过在子图之间的低密度区域生成假样本来平衡，分类器通过隐式考虑子图密度属性来区分真实样本和假样本。实验结果表明，GraphSGAN显著优于几种现有方法。

基于生成对抗网络的图半监督学习