Aggregate graph embedding method based on non-uniform neighbor nodes sampling

被引：0
|
作者：
Chen S. [1 ]
Cai X.-D. [1 ]
Hou Z.-Z. [1 ]
Li B. [1 ]
机构：
[1] School of Information and Communication, Guilin University of Electronic Technology, Guilin
来源：
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2019年 / 53卷 / 11期
关键词：
Graph convolutional network; Graph embedding; Neighborhood aggregation; Network embedding; Non-uniform sampling;
D O I：
10.3785/j.issn.1008-973X.2019.11.014
中图分类号：
学科分类号：
摘要：
Aiming at the problem that the uniform sampling function is widely used in aggregate graph embedding methods to construct neighborhoods for nodes in a graph, i.e. neighbor nodes are sampled randomly, and the differences of their properties are neglected, a non-uniform neighbor nodes sampling method was proposed. The neighbor nodes of the target node with larger degrees are sampled preferentially. Some neighbor nodes with lower degrees are hidden so that they do not appear during the sampling process. The remaining nodes in the neighbor node set are randomly sampled to preserve sampling randomness, then these randomly sampled nodes and the preferentially sampled nodes form the neighborhood of the target node. The proposed non-uniform neighbor nodes sampling method was applied to the graph embedding process. Experimental results showed that the proposed method can be used to improve the classification F1 score of graph embedding to 91.7% on the Reddit dataset, and the results was superior than that of several known graph embedding methods. Experiments on the overlapping community dataset PPI also confirmed that the proposed method can be used to generate embedding with higher quality for graph data. © 2019, Zhejiang University Press. All right reserved.
引用
收藏
页码：2163 / 2167and2205
相关论文
共 12 条
  • [1] Hamilton W.L., Ying R., Leskovec J., Representation learning on graphs: methods and applications, IEEE Data Engineering Bulletin, 40, 3, pp. 52-74, (2017)
  • [2] Goyal P., Ferrara E., Graph embedding techniques, applications, and performance: a survey, Knowledge Based Systems, 151, pp. 78-94, (2017)
  • [3] Belkin M., Niyogi P., Laplacian eigenmaps and spectral techniques for embedding and clustering, Advances in Neural Information Processing Systems 14, pp. 585-591, (2001)
  • [4] Roweis S.T., Saul L.K., Nonlinear dimensionality reduction by locally linear embedding, Science, 290, 5500, pp. 2323-2326, (2000)
  • [5] Cao S., Lu W., Xu Q., GraRep: learning graph representations with global structural information, ACM International Conference on Information and Knowledge Management, pp. 891-900, (2015)
  • [6] Perozzi B., Al-Rfou R., Skiena S., DeepWalk: online learning of social representations, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701-710, (2014)
  • [7] Grover A., Leskovec J., Node2vec: scalable feature learning for networks, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855-864, (2016)
  • [8] Kipft N., Welling M., Semi-supervised classification with graph convolutional networks, International Conference on Learning Representations, (2016)
  • [9] Defferrard M., Bresson X., Vandergheynst P., Convolutional neural networks on graphs with fast localized spectral filtering, Advances in Neural Information Processing Systems 29, pp. 3837-3845, (2016)
  • [10] Wang D., Cui P., Zhu W., Structural deep network embedding, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225-1234, (2016)
12