Discovering links among social networks

  • Authors:
  • Francesco Buccafurri;Gianluca Lax;Antonino Nocera;Domenico Ursino

  • Affiliations:
  • DIMET, University;DIMET, University;DIMET, University;DIMET, University

  • Venue:
  • ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.