In this study, we focus on the graph representation learning (a.k.a. network embedding) in attributed graphs. Different from existing embedding methods that treat the incorporation of graph structure and semantic as the simple combination of two optimization objectives, we propose a novel semantic graph representation (SGR) method to formulate the joint optimization of the two heterogeneous sources into a common high-order proximity based framework. Concretely, we first construct an auxiliary weighted graph, where the complex homogeneous and heterogeneous relations among nodes and attributes in the original graph are comprehensively encoded. Conventional embedding methods that consider high-order topology proximities can then be easily applied to the newly constructed graph to learn the representations of both node and attribute while capturing the nonlinear high-order intrinsic correlation inside or among graph structure and semantic. The learned attribute embeddings can also effectively support some semantic-oriented inference tasks (e.g., semantic community detection), helping to reveal the graph's deep semantic. The effectiveness of SGR is further verified on a series of real graphs, where it achieves impressive performance over other baselines.

该研究聚焦于属性图中的图表征学习（即网络嵌入）。与现有的嵌入方法不同，我们提出了一种新颖的语义图表征（SGR）方法，将两个异构源的联合优化结合到一个基于公共高阶接近度的框架中，以全面编码原始图中节点和属性之间的复杂同构和异构关系。我们证明，SGR对于一系列实际图表现出了卓越的性能，成为了其他基线的有效替代方案。

属性图中的图表示学习：基于语义随机游走的方法