Graph embedding aims to map the high-dimensional nodes to a low-dimensional space and learns the graph relationship from its latent representations. Most existing graph embedding methods focus on the topological structure of graph data, but ignore the semantic information of graph data, which results in the unsatisfied performance in practical applications. To overcome the problem, this paper proposes a novel deep convolutional adversarial graph autoencoder ( GAE) model. To embed the semantic information between nodes in the graph data, the random walk strategy is first used to construct the positive pointwise mutual information ( PPMI) matrix, then, graph convolutional net-work ( GCN) is employed to encode the PPMI matrix and node content into the latent representation. Finally, the learned latent representation is used to reconstruct the topological structure of the graph data by decoder. Furthermore, the deep convolutional adversarial training algorithm is introduced to make the learned latent representation conform to the prior distribution better. The state-of-the-art experimental results on the graph data validate the effectiveness of the proposed model in the link prediction, node clustering and graph visualization tasks for three standard datasets, Cora, Citeseer and Pubmed.

MA Xiuhui;WANG Rong;CHEN Shudong;DU Rong;ZHU Danyang;ZHAO Hua

University of Chinese Academy of Sciences,Beijing 100049,P.R.China;Institute of Microelectronics of the Chinese Academy of Sciences,Beijing 100029,P.R.China;Key Laboratory of Space Object Measurement Department,Beijing Institute of Tracking and Telecommunications Technology,Beijing 100094,P.R.China

高技术通讯（英文版）

[1]MA Xiuhui;WANG Rong;CHEN Shudong;DU Rong;ZHU Danyang;ZHAO Hua-.Deep convolutional adversarial graph autoencoder using positive pointwise mutual information for graph embedding)[J].高技术通讯（英文版）,2022(01):98-106

Deep,convolutional,adversarial,graph,autoencoder,using,positive,pointwise,mutual,information,embedding,Graph,aims,map,high,dimensional,nodes,low,space,learns,relationship,from,its,latent,representations,Most,existing,methods,focus,topological,structure,ignore,semantic,which,results,unsatisfied,performance,practical,applications,To,overcome,problem,this,paper,proposes,novel,deep,GAE,model,between,random,walk,strategy,first,used,PPMI,matrix,then,net,work,GCN,employed,content,into,Finally,learned,reconstruct,by,decoder,Furthermore,training,algorithm,introduced,make,conform,prior,distribution,better,state,art,experimental,validate,effectiveness,proposed,link,prediction,clustering,visualization,tasks,three,standard,datasets,Cora,Citeseer,Pubmed

0.536182