IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3541437.html
   My bibliography  Save this article

An Interlayer Link Prediction Method Based on Edge-Weighted Embedding

Author

Listed:
  • Hefei Hu
  • Sirui Zhang
  • Yanan Wang
  • Siew Ann Cheong

Abstract

Presently, users usually register accounts on online social networks (OSNs). Identifying the same user in different networks is also known as interlayer link prediction. Most existing interlayer link prediction studies use embedding methods, which represent nodes in a common representation space by learning mapping functions. However, these studies often directly model links within the pre-embedding layer as equal weights, fail to effectively distinguish the strength of edge relationships, and do not fully utilize network topology information. In this paper, we propose an interlayer link prediction model based on weighted embedding of connected edges within the network layer, which models the links within the network layer as weighted graphs to better represent the network and then uses appropriate embedding methods to represent the network in a low-dimensional space. After embedding, vector similarity and distance similarity are used as comprehensive evaluation scores. This paper has conducted a large number of simulation experiments on actual networks. The results show that our proposed model has higher prediction accuracy in all aspects than current advanced models and can achieve the highest accuracy when the training frequency is low, which proves the validity of the proposed model.

Suggested Citation

  • Hefei Hu & Sirui Zhang & Yanan Wang & Siew Ann Cheong, 2023. "An Interlayer Link Prediction Method Based on Edge-Weighted Embedding," Complexity, Hindawi, vol. 2023, pages 1-13, December.
  • Handle: RePEc:hin:complx:3541437
    DOI: 10.1155/2023/3541437
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3541437.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3541437.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/3541437?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:3541437. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.