Please use this identifier to cite or link to this item:
Title: Approximate personalized propagation for unsupervised embedding in heterogeneous graphs
Authors: Chen, Yibi
Hu, Yikun
Li, Keqin
Yeo, Chai Kiat
Li, Kenli
Keywords: Engineering::Computer science and engineering
Issue Date: 2022
Source: Chen, Y., Hu, Y., Li, K., Yeo, C. K. & Li, K. (2022). Approximate personalized propagation for unsupervised embedding in heterogeneous graphs. Information Sciences, 600, 287-300.
Journal: Information Sciences
Abstract: Graphs are effective for representing various relationships in the real world and have been successfully applied in many areas, such as publication citations and movie networks. Compared to homogeneous graphs (i.e., nodes and edges of a single relation type), heterogeneous graphs have heterogeneity and richer information (i.e., nodes and edges of different relation types). How to tackle complex non-pairwise graph-structured data and model various relation-types is a daunting challenge for heterogenous graphs. However, the existing unsupervised methods focus on node attribute learning, while node neighborhood information utilizes very limited because they only consider node propagation that is within few steps. In this paper, we propose an unsupervised method, called APPTE, that models adequate node neighborhood information in local context, and captures the global neighborhood information. Meanwhile, our method considers the robustness and generalization ability. Specifically, we construct approximate personalized propagation in local context to utilize an infinite number of neighborhood aggregation layers for extending node neighborhood propagation range, and then fuse these local context to capture global neighborhood information. Additionally, we improve the robustness and generalization ability of model, employing throwedge to increase the randomness and diversity of the graph connections by randomly deleting a part of edges. The experimental results on three benchmark datasets containing heterogeneous graphs demonstrate that our proposed method is superior to the available state-of-the-art methods.
ISSN: 0020-0255
DOI: 10.1016/j.ins.2022.04.002
Schools: School of Computer Science and Engineering 
Rights: © 2022 Elsevier Inc. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Citations 50

Updated on May 21, 2024

Web of ScienceTM
Citations 50

Updated on Oct 31, 2023

Page view(s)

Updated on May 20, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.