Link prediction on latent heterogeneous graphs

On graph data, the multitude of node or edge types gives rise to heterogeneous information networks (HINs). To preserve the heterogeneous semantics on HINs, the rich node/edge types become a cornerstone of HIN representation learning. However, in real-world scenarios, type information is often noisy...

Full description

Saved in:
Bibliographic Details
Main Authors: NGUYEN, Trung Kien, LIU, Zemin, FANG, Yuan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2023
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/8190
https://ink.library.smu.edu.sg/context/sis_research/article/9193/viewcontent/3543507.3583284_pvoa_cc_by.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-9193
record_format dspace
spelling sg-smu-ink.sis_research-91932023-09-26T10:25:48Z Link prediction on latent heterogeneous graphs NGUYEN, Trung Kien LIU, Zemin FANG, Yuan On graph data, the multitude of node or edge types gives rise to heterogeneous information networks (HINs). To preserve the heterogeneous semantics on HINs, the rich node/edge types become a cornerstone of HIN representation learning. However, in real-world scenarios, type information is often noisy, missing or inaccessible. Assuming no type information is given, we define a so-called latent heterogeneous graph (LHG), which carries latent heterogeneous semantics as the node/edge types cannot be observed. In this paper, we study the challenging and unexplored problem of link prediction on an LHG. As existing approaches depend heavily on type-based information, they are suboptimal or even inapplicable on LHGs. To address the absence of type information, we propose a model named LHGNN, based on the novel idea of semantic embedding at node and path levels, to capture latent semantics on and between nodes. We further design a personalization function to modulate the heterogeneous contexts conditioned on their latent semantics w.r.t. the target node, to enable finer-grained aggregation. Finally, we conduct extensive experiments on four benchmark datasets, and demonstrate the superior performance of LHGNN. 2023-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8190 info:doi/10.1145/3543507.3583284 https://ink.library.smu.edu.sg/context/sis_research/article/9193/viewcontent/3543507.3583284_pvoa_cc_by.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Latent heterogeneous graph Link prediction Graph neural networks Databases and Information Systems OS and Networks
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Latent heterogeneous graph
Link prediction
Graph neural networks
Databases and Information Systems
OS and Networks
spellingShingle Latent heterogeneous graph
Link prediction
Graph neural networks
Databases and Information Systems
OS and Networks
NGUYEN, Trung Kien
LIU, Zemin
FANG, Yuan
Link prediction on latent heterogeneous graphs
description On graph data, the multitude of node or edge types gives rise to heterogeneous information networks (HINs). To preserve the heterogeneous semantics on HINs, the rich node/edge types become a cornerstone of HIN representation learning. However, in real-world scenarios, type information is often noisy, missing or inaccessible. Assuming no type information is given, we define a so-called latent heterogeneous graph (LHG), which carries latent heterogeneous semantics as the node/edge types cannot be observed. In this paper, we study the challenging and unexplored problem of link prediction on an LHG. As existing approaches depend heavily on type-based information, they are suboptimal or even inapplicable on LHGs. To address the absence of type information, we propose a model named LHGNN, based on the novel idea of semantic embedding at node and path levels, to capture latent semantics on and between nodes. We further design a personalization function to modulate the heterogeneous contexts conditioned on their latent semantics w.r.t. the target node, to enable finer-grained aggregation. Finally, we conduct extensive experiments on four benchmark datasets, and demonstrate the superior performance of LHGNN.
format text
author NGUYEN, Trung Kien
LIU, Zemin
FANG, Yuan
author_facet NGUYEN, Trung Kien
LIU, Zemin
FANG, Yuan
author_sort NGUYEN, Trung Kien
title Link prediction on latent heterogeneous graphs
title_short Link prediction on latent heterogeneous graphs
title_full Link prediction on latent heterogeneous graphs
title_fullStr Link prediction on latent heterogeneous graphs
title_full_unstemmed Link prediction on latent heterogeneous graphs
title_sort link prediction on latent heterogeneous graphs
publisher Institutional Knowledge at Singapore Management University
publishDate 2023
url https://ink.library.smu.edu.sg/sis_research/8190
https://ink.library.smu.edu.sg/context/sis_research/article/9193/viewcontent/3543507.3583284_pvoa_cc_by.pdf
_version_ 1779157219918479360