DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction

Current graph-embedding methods mainly focus on static homogeneous graphs, where the entity type is the same and the topology is fixed. However, in real networks, such as academic networks and shopping networks, there are typically various types of nodes and temporal interactions. The dynamical and...

Full description

Bibliographic Details
Main Authors: Libin Chen, Luyao Wang, Chengyi Zeng, Hongfu Liu, Jing Chen
Format: Article
Language:English
Published: MDPI AG 2022-11-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/10/22/4193
_version_ 1797464692339245056
author Libin Chen
Luyao Wang
Chengyi Zeng
Hongfu Liu
Jing Chen
author_facet Libin Chen
Luyao Wang
Chengyi Zeng
Hongfu Liu
Jing Chen
author_sort Libin Chen
collection DOAJ
description Current graph-embedding methods mainly focus on static homogeneous graphs, where the entity type is the same and the topology is fixed. However, in real networks, such as academic networks and shopping networks, there are typically various types of nodes and temporal interactions. The dynamical and heterogeneous components of graphs in general contain abundant information. Currently, most studies on dynamic graphs do not sufficiently consider the heterogeneity of the network in question, and hence the semantic information of the interactions between heterogeneous nodes is missing in the graph embeddings. On the other hand, the overall size of the network tends to accumulate over time, and its growth rate can reflect the ability of the entire network to generate interactions of heterogeneous nodes; therefore, we developed a graph dynamics model to model the evolution of graph dynamics. Moreover, the temporal properties of nodes regularly affect the generation of temporal interaction events with which they are connected. Thus, we developed a node dynamics model to model the evolution of node connectivity. In this paper, we propose DHGEEP, a dynamic heterogeneous graph-embedding method based on the Hawkes process, to predict the evolution of dynamic heterogeneous networks. The model considers the generation of temporal events as an effect of historical events, introduces the Hawkes process to simulate this evolution, and then captures semantic and structural information based on the meta-paths of temporal heterogeneous nodes. Finally, the graph-level dynamics of the network and the node-level dynamics of each node are integrated into the DHGEEP framework. The embeddings of the nodes are automatically obtained by minimizing the value of the loss function. Experiments were conducted on three downstream tasks, static link prediction, temporal event prediction for homogeneous nodes, and temporal event prediction for heterogeneous nodes, on three datasets. Experimental results show that DHGEEP achieves excellent performance in these tasks. In the most significant task, temporal event prediction of heterogeneous nodes, the values of precision@2 and recall@2 can reach 30.23% and 10.48% on the AMiner dataset, and reach 4.56% and 1.61% on the DBLP dataset, so that our method is more accurate at predicting future temporal events than the baseline.
first_indexed 2024-03-09T18:10:47Z
format Article
id doaj.art-575e8151076a4d1c8429afe3f168ae2f
institution Directory Open Access Journal
issn 2227-7390
language English
last_indexed 2024-03-09T18:10:47Z
publishDate 2022-11-01
publisher MDPI AG
record_format Article
series Mathematics
spelling doaj.art-575e8151076a4d1c8429afe3f168ae2f2023-11-24T09:07:30ZengMDPI AGMathematics2227-73902022-11-011022419310.3390/math10224193DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary PredictionLibin Chen0Luyao Wang1Chengyi Zeng2Hongfu Liu3Jing Chen4College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha 410073, ChinaCollege of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, ChinaCollege of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, ChinaCollege of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, ChinaCurrent graph-embedding methods mainly focus on static homogeneous graphs, where the entity type is the same and the topology is fixed. However, in real networks, such as academic networks and shopping networks, there are typically various types of nodes and temporal interactions. The dynamical and heterogeneous components of graphs in general contain abundant information. Currently, most studies on dynamic graphs do not sufficiently consider the heterogeneity of the network in question, and hence the semantic information of the interactions between heterogeneous nodes is missing in the graph embeddings. On the other hand, the overall size of the network tends to accumulate over time, and its growth rate can reflect the ability of the entire network to generate interactions of heterogeneous nodes; therefore, we developed a graph dynamics model to model the evolution of graph dynamics. Moreover, the temporal properties of nodes regularly affect the generation of temporal interaction events with which they are connected. Thus, we developed a node dynamics model to model the evolution of node connectivity. In this paper, we propose DHGEEP, a dynamic heterogeneous graph-embedding method based on the Hawkes process, to predict the evolution of dynamic heterogeneous networks. The model considers the generation of temporal events as an effect of historical events, introduces the Hawkes process to simulate this evolution, and then captures semantic and structural information based on the meta-paths of temporal heterogeneous nodes. Finally, the graph-level dynamics of the network and the node-level dynamics of each node are integrated into the DHGEEP framework. The embeddings of the nodes are automatically obtained by minimizing the value of the loss function. Experiments were conducted on three downstream tasks, static link prediction, temporal event prediction for homogeneous nodes, and temporal event prediction for heterogeneous nodes, on three datasets. Experimental results show that DHGEEP achieves excellent performance in these tasks. In the most significant task, temporal event prediction of heterogeneous nodes, the values of precision@2 and recall@2 can reach 30.23% and 10.48% on the AMiner dataset, and reach 4.56% and 1.61% on the DBLP dataset, so that our method is more accurate at predicting future temporal events than the baseline.https://www.mdpi.com/2227-7390/10/22/4193dynamic heterogeneous graphgraph embeddinglink prediction
spellingShingle Libin Chen
Luyao Wang
Chengyi Zeng
Hongfu Liu
Jing Chen
DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
Mathematics
dynamic heterogeneous graph
graph embedding
link prediction
title DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
title_full DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
title_fullStr DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
title_full_unstemmed DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
title_short DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction
title_sort dhgeep a dynamic heterogeneous graph embedding method for evolutionary prediction
topic dynamic heterogeneous graph
graph embedding
link prediction
url https://www.mdpi.com/2227-7390/10/22/4193
work_keys_str_mv AT libinchen dhgeepadynamicheterogeneousgraphembeddingmethodforevolutionaryprediction
AT luyaowang dhgeepadynamicheterogeneousgraphembeddingmethodforevolutionaryprediction
AT chengyizeng dhgeepadynamicheterogeneousgraphembeddingmethodforevolutionaryprediction
AT hongfuliu dhgeepadynamicheterogeneousgraphembeddingmethodforevolutionaryprediction
AT jingchen dhgeepadynamicheterogeneousgraphembeddingmethodforevolutionaryprediction