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

Network Alignment across Social Networks Using Multiple Embedding Techniques

Author

Listed:
  • Van-Vang Le

    (Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
    Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 708 33 Ostrava, Czech Republic)

  • Toai Kim Tran

    (Faculty of Economics, Ho Chi Minh City University of Technology and Education, Ho Chi Minh City 700000, Vietnam)

  • Bich-Ngan T. Nguyen

    (Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 708 33 Ostrava, Czech Republic
    Faculty of Information Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City 700000, Vietnam)

  • Quoc-Dung Nguyen

    (Faculty of Mechanical-Electrical and Computer Engineering, School of Engineering and Technology, Van Lang University, Ho Chi Minh City 700000, Vietnam)

  • Vaclav Snasel

    (Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, 708 33 Ostrava, Czech Republic)

Abstract

Network alignment, which is also known as user identity linkage, is a kind of network analysis task that predicts overlapping users between two different social networks. This research direction has attracted much attention from the research community, and it is considered to be one of the most important research directions in the field of social network analysis. There are many different models for finding users that overlap between two networks, but most of these models use separate and different techniques to solve prediction problems, with very little work that has combined them. In this paper, we propose a method that combines different embedding techniques to solve the network alignment problem. Each association network alignment technique has its advantages and disadvantages, so combining them together will take full advantage and can overcome those disadvantages. Our model combines three-level embedding techniques of text-based user attributes, a graph attention network, a graph-drawing embedding technique, and fuzzy c-mean clustering to embed each piece of network information into a low-dimensional representation. We then project them into a common space by using canonical correlation analysis and compute the similarity matrix between them to make predictions. We tested our network alignment model on two real-life datasets, and the experimental results showed that our method can considerably improve the accuracy by about 10–15% compared to the baseline models. In addition, when experimenting with different ratios of training data, our proposed model could also handle the over-fitting problem effectively.

Suggested Citation

  • Van-Vang Le & Toai Kim Tran & Bich-Ngan T. Nguyen & Quoc-Dung Nguyen & Vaclav Snasel, 2022. "Network Alignment across Social Networks Using Multiple Embedding Techniques," Mathematics, MDPI, vol. 10(21), pages 1-18, October.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:3972-:d:953995
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Riccardo Giubilei & Pierpaolo Brutti, 2022. "Supervised Classification for Link Prediction in Facebook Ego Networks With Anonymized Profile Information," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 302-325, July.
    2. Baiyang Chen & Xiaoliang Chen & Peng Lu & Yajun Du, 2020. "CAREA: Cotraining Attribute and Relation Embeddings for Cross-Lingual Entity Alignment in Knowledge Graphs," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-11, December.
    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.

      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:21:p:3972-:d:953995. 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.