Journal of Northeastern University(Natural Science) ›› 2025, Vol. 46 ›› Issue (9): 25-33.DOI: 10.12068/j.issn.1005-3026.2025.20240153

• Information & Control • Previous Articles     Next Articles

Heterogeneous Graph Representation Learning Algorithm Based on Attribute Completion

Dong-ming CHEN, Jia-ming LIU(), Chun-mei LIANG, Dong-qi WANG   

  1. Software College,Northeastern University,Shenyang 110819,China.
  • Received:2024-07-29 Online:2025-09-15 Published:2025-12-03
  • Contact: Jia-ming LIU

Abstract:

In the process of collecting heterogeneous graph data, node attributes are often missing due to privacy protection policies or copyright constraints. Regarding both incomplete attributes and completely missing attributes, a heterogeneous graph representation learning algorithm based on attribute completion (HGAC) was proposed. For nodes with incomplete attributes, the missing attributes were obtained by constructing an adjacency matrix in the attribute space and performing graph convolution. Subsequently, the attributes were regarded as abstract nodes, and under the guidance of meta-paths, the topological embeddings of both nodes and attributes were learned. The similarity among the topological embeddings were then used to complete completely missing attributes. Experiments conducted on three real datasets demonstrate that the proposed algorithm effectively enhances the performance of downstream tasks and possesses strong generalization capability.

Key words: graph representation learning, heterogeneous graph, attribute missing, attribute completion, meta-path

CLC Number: