Distinct social networks are interconnected via bridge users, who play thus a key role when crossing information is investigated in the context of Social Internetworking analysis. Unfortunately, not always users make their role of bridge explicit by specifying the so-called me edge (i.e., the edge connecting the accounts of the same user in two distinct social networks), missing thus a potentially very useful information. As a consequence, discovering missing me edges is an important problem to face in this context yet not so far investigated. In this paper, we propose a common-neighbors approach to detecting missing me edges, which returns good results in real life settings. Indeed, an experimental campaign shows both that the state-of-the-art common-neighbors approaches cannot be effectively applied to our problem and, conversely, that our approach returns precise and complete results. © 2012 Springer-Verlag.
CITATION STYLE
Buccafurri, F., Lax, G., Nocera, A., & Ursino, D. (2012). Discovering links among social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7524 LNAI, pp. 467–482). https://doi.org/10.1007/978-3-642-33486-3_30
Mendeley helps you to discover research relevant for your work.