Published in

Springer, Lecture Notes in Computer Science, p. 467-482, 2012

DOI: 10.1007/978-3-642-33486-3_30

Links

Tools

Export citation

Search in Google Scholar

Discovering Links among Social Networks

Proceedings article published in 2012 by Francesco Buccafurri, Gianluca Lax, Antonino Nocera, Domenico Ursino ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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.