Name
Title | ||
|---|---|---|
Reconciling Multiple Social Networks Effectively and Efficiently: An Embedding Approach |
Abstract | ||
|---|---|---|
AbstractRecently, reconciling social networks, identifying the accounts belonging to the same individual across social networks, receives significant attention from both academic and industry. Most of the existing studies have limitations in the following three aspects: multiplicity, comprehensiveness and robustness. To address these limitations, we rethink this problem and, for the first time, robustly and comprehensively reconcile multiple social networks. In this paper, we propose two frameworks, MASTER and MASTER+, i.e., across Multiple social networks, integrate Attribute and STructure Embedding for Reconciliation. In MASTER, we first design a novel Constrained Dual Embedding model, simultaneously embedding and reconciling multiple social networks, to formulate this problem into a unified optimization. To address this optimization, we then design an effective NS-Alternating algorithm and prove it converges to KKT points. To further speed up MASTER, we propose a scalable framework, namely MASTER+. The core idea is to group accounts into clusters and then perform MASTER in each cluster in parallel. Specifically, we design an efficient Augmented Pre-Embedding model and Balance-aware Fuzzy Clustering algorithm for the high efficiency and the high accuracy. Extensive experiments demonstrate that both MASTER and MASTER+ outperform the state-of-the-art approaches. Moreover, MASTER+ inherits the effectiveness of MASTER and enjoys higher efficiency. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TKDE.2019.2929786 | Periodicals |
Keywords | DocType | Volume |
Social network reconciliation, network alignment, network embedding, matrix factorization, semidefinite programming | Journal | 33 |
Issue | ISSN | Citations |
1 | 1041-4347 | 1 |
PageRank | References | Authors |
0.35 | 0 | 5 |