嵌入
顶点(图论)
计算机科学
理论计算机科学
代表(政治)
水准点(测量)
随机游动
生成语法
序列(生物学)
特征学习
人工智能
算法
数学
图形
统计
大地测量学
政治
政治学
法学
地理
生物
遗传学
作者
Taisong Jin,Xixi Yang,Zhengtao Yu,Han Luo,Yongmei Zhang,Feiran Jie,Xiangxiang Zeng,Min Jiang
出处
期刊:IEEE transactions on neural networks and learning systems
[Institute of Electrical and Electronics Engineers]
日期:2022-11-07
卷期号:35 (4): 5684-5694
被引量:2
标识
DOI:10.1109/tnnls.2022.3208914
摘要
Network representation learning, also known as network embedding, aims to learn the low-dimensional representations of vertices while capturing and preserving the network structure. For real-world networks, the edges that represent some important relationships between the vertices of a network may be missed and may result in degenerated performance. The existing methods usually treat missing edges as negative samples, thereby ignoring the true connections between two vertices in a network. To capture the true network structure effectively, we propose a novel network representation learning method called WalkGAN, where random walk scheme and generative adversarial networks (GAN) are incorporated into a network embedding framework. Specifically, WalkGAN leverages GAN to generate the synthetic sequences of the vertices that sufficiently simulate random walk on a network and further learn vertex representations from these vertex sequences. Thus, the unobserved links between the vertices are inferred with high probability instead of treating them as nonexistence. Experimental results on the benchmark network datasets demonstrate that WalkGAN achieves significant performance improvements for vertex classification, link prediction, and visualization tasks.
科研通智能强力驱动
Strongly Powered by AbleSci AI