Name
Abstract | ||
|---|---|---|
Nowadays online users prefer to join multiple social media for the purpose of socialized online service. The problem anchor link prediction is formalized to link user data with the common ground on user profile, content and network structure across social networks. Most of the traditional works concentrated on learning matching function with explicit or implicit features on observed user data. However, the low quality of observed user data confuses the judgment on anchor links, resulting in the matching collision problem in practice. In this paper, we explore local structure consistency and then construct a matching graph in order to circumvent matching collisions. Furthermore, we propose graph convolution networks with mini-batch strategy, efficiently solving anchor link prediction on matching graph. The experimental results on three real application scenarios show the great potentials of our proposed method in both prediction accuracy and efficiency. In addition, the visualization of learned embeddings provides us a qualitative way to understand the inference of anchor links on the matching graph. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ICBK50248.2020.00065 | 2020 IEEE International Conference on Knowledge Graph (ICKG) |
Keywords | DocType | ISBN |
Anchor link prediction,Graph convolution networks,Matching graph | Conference | 978-1-7281-8157-8 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Gao | 1 | 96 | 14.86 |
| Yongqing Wang | 2 | 4 | 1.42 |
| Shanshan Lyu | 3 | 0 | 0.34 |
| Huawei Shen | 4 | 739 | 61.40 |
| Xueqi Cheng | 5 | 3148 | 247.04 |