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.

Discovering Links among Social Networks / Buccafurri, Francesco; Lax, Gianluca; Nocera, Antonino; Ursino, Domenico. - (2012), pp. 467-482. (Intervento presentato al convegno European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2012) tenutosi a Bristol nel 24-28 Settembre 2012) [10.1007/978-3-642-33486-3_30].

Discovering Links among Social Networks

Francesco Buccafurri;Gianluca Lax;Antonino Nocera;Domenico Ursino
2012-01-01

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 {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.
2012
978-3-642-33485-6
Link Prediction; Link Mining; Social networks
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12318/15099
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 45
  • ???jsp.display-item.citation.isi??? ND
social impact