Aligning Dynamic Social Networks: An Optimization Over Dynamic Graph Autoencoder
Social network alignment, aligning different social networks on their common users, is receiving increasing attention from both academic and industry. Most of the existing studies consider the social network to be static and neglect its inherent dynamics. In fact, the dynamics of social networks con...
Uloženo v:
| Vydáno v: | IEEE transactions on knowledge and data engineering Ročník 35; číslo 6; s. 5597 - 5611 |
|---|---|
| Hlavní autoři: | , , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.06.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1041-4347, 1558-2191 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Social network alignment, aligning different social networks on their common users, is receiving increasing attention from both academic and industry. Most of the existing studies consider the social network to be static and neglect its inherent dynamics. In fact, the dynamics of social networks contain the discriminative pattern of an individual, which can be leveraged to facilitate social network alignment. Hence, we for the first time propose to study the problem of aligning dynamic social networks. Towards this end, we propose a novel Dynamic Graph autoencoder based dynamic social network Alignment approach, referred to as DGA , unfolding the fruitful dynamics of social networks for user alignment. However, it faces challenges in both modeling and optimization: (1) To model the intra-network dynamics, we design a novel dynamic graph autoencoder to learn user embeddings with complex network dynamics. (2) To model the inter-network alignment, we design a unified optimization framework over proposed dynamic graph autoencoders, constructing a common subspace for user alignment across different networks. (3) To address this optimization problem, we design an effective alternating algorithm with solid theoretical guarantees. We conduct extensive experiments on real-world datasets and show that the proposed approach substantially outperforms the state-of-the-art methods. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1041-4347 1558-2191 |
| DOI: | 10.1109/TKDE.2022.3152502 |