arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.06197cs.LGstat.ML
收藏

GAN能学习图的拓扑特征吗?

Can GAN Learn Topological Features of a Graph?

University of Electronic Science and Technology of China(电子科技大学);IBM Watson Research Center(IBM沃森研究中心);Columbia University(哥伦比亚大学);Boston University(波士顿大学)

Weiyi Liu, Pin-Yu Chen, Hal Cooper, Min Hwan Oh, Sailung Yeung, Toyotaro Suzumura

摘要:

本文是将GANs扩展到图拓扑分析的一线研究。通过利用图的层次连接结构,我们已经证明了生成对抗网络(GANs)可以成功地捕获任何任意图的拓扑特征,并根据它们对拓扑重构的贡献将边集按不同阶段进行排序。此外,除了作为一个指标的图重建,我们发现,这些阶段也可以保持重要的拓扑特征的图。

英文摘要:

This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture topological features of any arbitrary graph, and rank edge sets by different stages according to their contribution to topology reconstruction. Moreover, in addition to acting as an indicator of graph reconstruction, we find that these stages can also preserve important topological features in a graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑