IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i22p4193-d967968.html
   My bibliography  Save this article

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

Author

Listed:
  • Libin Chen

    (College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, China)

  • Luyao Wang

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Chengyi Zeng

    (College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, China)

  • Hongfu Liu

    (College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, China)

  • Jing Chen

    (College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, China)

Abstract

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.

Suggested Citation

  • Libin Chen & Luyao Wang & Chengyi Zeng & Hongfu Liu & Jing Chen, 2022. "DHGEEP: A Dynamic Heterogeneous Graph-Embedding Method for Evolutionary Prediction," Mathematics, MDPI, vol. 10(22), pages 1-20, November.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:22:p:4193-:d:967968
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/22/4193/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/22/4193/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shang, Yilun, 2015. "The Estrada index of evolving graphs," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 415-423.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yilun Shang, 2020. "Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs," Mathematics, MDPI, vol. 8(7), pages 1-8, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:22:p:4193-:d:967968. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.