Discovering Links among Social Networks

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 {em bridge} explicit by specifying the so-called { t 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 { t 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 { t 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.