MC2:Unsupervised Multiple Social Network Alignment

Abstract

Social network alignment, identifying social accounts of the same individual across different social networks, shows fundamental importance across a wide spectrum of applications. Individuals more often than not join in multiple social networks and it is in fact intractable or even impossible to acquiring supervision for guiding the alignment. However, to the best of our knowledge, none of existing methods can align multiple social networks without supervision. In this paper, we propose to study the problem of unsupervised multiple social network alignment. To address this problem, we propose a novel unsupervised model of Matrix factorization with diagonal Cone under orthogonal Constraint, referred to as MC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> . Its core idea is to embed and align multiple social networks in the common subspace via an unsupervised approach. Specifically, in MC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> model, we first design a matrix optimization to infer the common subspace from different social networks. To address the nonconvex optimization, we then design an efficient alternating algorithm by leveraging its inherent functional property. Through extensive experiments on real-world datasets, we demonstrate that the proposed MC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> model significantly outperforms the state-of-the-art methods.